Application Layer Multicast Tree Constructing Algorithm for Real-time Media Delivery 


Vol. 29,  No. 11, pp. 991-1000, Nov.  2004


PDF
  Abstract

This paper presents an application layer multicast tree constructing algorithm to minimize the average time delay from the sender to end-systems for the effective real-time media delivery. Simultaneously, the proposed algorithm takes into account the computing power and the network condition of each end-system as a control variable and thus avoids the undesirable case that loads are concentrated to only several end-systems. The multicast tree is constructed by clustering technique and modified Dijkstra's algorithm in two steps, i.e. tree among proxy-senders and tree in each cluster. By the experimental results, we show that the proposed algorithm can provide an effective solution.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Song and D. S. Lee, "Application Layer Multicast Tree Constructing Algorithm for Real-time Media Delivery," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 11, pp. 991-1000, 2004. DOI: .

[ACM Style]

Hwangjun Song and Dong Sup Lee. 2004. Application Layer Multicast Tree Constructing Algorithm for Real-time Media Delivery. The Journal of Korean Institute of Communications and Information Sciences, 29, 11, (2004), 991-1000. DOI: .

[KICS Style]

Hwangjun Song and Dong Sup Lee, "Application Layer Multicast Tree Constructing Algorithm for Real-time Media Delivery," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 11, pp. 991-1000, 11. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880