The algorithm for constructing an efficient data delivery tree in host-based multicast scheme

Authors:
Jin-Han Jeon;Keyong-Hoon Kim;Jiseung Nam
Affiliations:
Dept. of Computer Engineering, Chonnam National University, Kwangju, Korea;Dept. of Computer Engineering, Chonnam National University, Kwangju, Korea;Dept. of Computer Engineering, Chonnam National University, Kwangju, Korea
Venue:
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Year:
2005

Citing 8
Cited 0

A case for end system multicast (keynote address)

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Topology-aware overlay networks for group communication

NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
An Overlay Tree Building Control Protocol

NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
End-Host Multicast Communication Using Switch-Trees Protocols

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Overcast: reliable multicasting with on overlay network

OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
ALMI: an application level multicast infrastructure

USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Modeling Internet topology

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

To minimize the network resource and to meet the need of related application programs such as Internet Broadcasting or Video conferencing are the main concerns of Host-based Multicast tree construction algorithm. Existing works reduced performance-degrading factors like the duplicate data transmission on the same network link and overhead incurred at host or end-systems. However, they had relatively high RDP(Relative Delay Penalty), which made it difficult to adapt for application programs. In this work, we proposed a DDTA(Data Delivery Tree Adjust) algorithm which can reduce RDP by minimizing the tree depth, but it also could incur performance debasement. Proposed algorithm adapted techniques such as the detection of hosts existing in the same LAN to decrease the RDP and node switching to compensate performance loss. In addition, it suggests schemes for rapid recovery of a data delivery tree and shows that its RDP is lower than existing work.