Efficient and Scalable Overlay Multicast Mechanism for Real-time Tree Construction 


Vol. 34,  No. 12, pp. 1399-1406, Dec.  2009


PDF Full-Text
  Abstract

In the internet broadcast, efficient and scalable mechanism of multicast is needed for the communication between groups. Furthermore, Optimization of the multicast tree is required to improve the performance of overlay multicast. This optimization is well-known as NP-complete. If a node in the tree has limited out-degree, a user who wants to join the group has to find parent user who has already joined. In this paper, the users who want to join the group need to setup their level using delay test from source node. And then new users can find candidate parent nodes effectively using ACK-SEND approach and take proper position by comparing level. The closer node of the user to root node should be located in lower level. Also, even if a barrier is caused, fast recovery will be guaranteed using ACK-SEND approach. Through this, the newcomer node can fine their location in the multicast tree and join the group fast and effectively.

  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]

Y. Nam, D. Im, H. Yang, J. Nam, "Efficient and Scalable Overlay Multicast Mechanism for Real-time Tree Construction," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 12, pp. 1399-1406, 2009. DOI: .

[ACM Style]

Yun-Seung Nam, Dong-Gee Im, Hyun-Jong Yang, and Ji-Seung Nam. 2009. Efficient and Scalable Overlay Multicast Mechanism for Real-time Tree Construction. The Journal of Korean Institute of Communications and Information Sciences, 34, 12, (2009), 1399-1406. DOI: .

[KICS Style]

Yun-Seung Nam, Dong-Gee Im, Hyun-Jong Yang, Ji-Seung Nam, "Efficient and Scalable Overlay Multicast Mechanism for Real-time Tree Construction," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 12, pp. 1399-1406, 12. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880