Efficient Multicast Tree Algorithm for Acceptable Delay and Minimum Delay Variation 


Vol. 12,  No. 1, pp. 105-110, Feb.  2005
10.3745/KIPSTC.2005.12.1.105


PDF
  Abstract

With the proliferation of multimedia group application, the construction of multicast trees satisfying QoS requirements is becoming a problem of prime importance. In this paper, we study the delay- and delay variation-bounded multicast tree (DVBMT) problem which is NP-complete. The problem is to construct a spanning tree for destination node, which has the minimized multicast delay variation, and the delay on the path from the source to each destination is bounded. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison sohws that the proposed scheme outperforms DDVCA which is known to be effective so far in any network topology. The enhancement is up to about 3.6%~11.1% in term of normalized surcharge for DDVCA. The time complexity of our algorithm is O(mn^2).

  Statistics
  Cite this article

[IEEE Style]

M. S. Kim, H. S. Choo, Y. R. Lee, "Efficient Multicast Tree Algorithm for Acceptable Delay and Minimum Delay Variation," The KIPS Transactions:PartC, vol. 12, no. 1, pp. 105-110, 2005. DOI: 10.3745/KIPSTC.2005.12.1.105.

[ACM Style]

Moon Seong Kim, Hyun Seung Choo, and Young Ro Lee. 2005. Efficient Multicast Tree Algorithm for Acceptable Delay and Minimum Delay Variation. The KIPS Transactions:PartC, 12, 1, (2005), 105-110. DOI: 10.3745/KIPSTC.2005.12.1.105.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals