An autonomous and decentralized protocol for delay sensitive overlay multicast tree

Here, we present a protocol for dynamically maintaining a degree-bounded delay sensitive spanning tree in a decentralized way on overlay networks. The protocol aims at repairing the spanning tree autonomously even if multiple node's leave operations or failures (disappearances) occur simultaneously or continuously in a specified period. It also aims at maintaining the diameter (maximum delay) of the tree as small as possible. The simulation results using ns-2 have shown that the protocol could keep reasonable diameters compared with the existing centralized static algorithm even if many node's participations and disappearances occur frequently.

[1]  Ronald L. Graham,et al.  On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[2]  Vincent Roca,et al.  A Host-Based Multicast (HBM) Solution for Group Communications , 2001, ICN.

[3]  Samir Khuller,et al.  Construction of an efficient overlay multicast infrastructure for real-time applications , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  Paul Francis,et al.  Yoid: Extending the Internet Multicast Architec-ture , 2000 .

[5]  Bobby Bhattacharjee,et al.  Scalable application layer multicast , 2002, SIGCOMM '02.

[6]  Marcel Waldvogel,et al.  Dimensioning server access bandwidth and multicast routing in overlay networks , 2001, NOSSDAV '01.

[7]  Dinesh C. Verma,et al.  ALMI: An Application Level Multicast Infrastructure , 2001, USITS.

[8]  John S. Heidemann,et al.  Minimizing routing state for light-weight network simulation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[9]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..