A Distributed Routing Method for Dynamic Multicasting

Single point, sender based control does not scale well for multicast delivery. For applications, such as group video or teleconferencing a low total cost multicast tree is required. In this article we present a destination driven algorithm to minimize the total tree cost of multicast tree in a dynamic situation for the whole session duration. In this heuristic approach we considered the staying duration of participants are available at the time of joining. The performance of our algorithm is analyzed through extensive simulation and evaluated against several other existing dynamic multicast routing and also against one well known near optimum heuristic algorithm used for solving Steiner tree problem. We have further tested our algorithm using erroneous information given by the joining participants. Simulation results show that its performance does not degrade that much even when the range of error is considerably high, which proves the robustness of our algorithm.

[1]  Norio Shiratori,et al.  Multicast: concept, problems, routing protocols, algorithms and QoS extensions , 2002 .

[2]  Norio Shiratori,et al.  Optimal Routing for Dynamic Multipoint Connection , 1999, Eur. Trans. Telecommun..

[3]  Norio Shiratori,et al.  Dynamic multicast routing in advance resource reservation environment , 2000, Proceedings Seventh International Conference on Parallel and Distributed Systems (Cat. No.PR00568).

[4]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[5]  Yoshiaki Tanaka,et al.  Multicast routing based on predicted traffic statistics , 1994 .

[6]  Timothy K. Shih,et al.  Distributed Multimedia Databases: Techniques and Applications , 2001 .

[7]  Mohammed Atiquzzaman,et al.  Architectures, Protocols and Quality of Service for the Internet of the Future , 1999, Eur. Trans. Telecommun..

[8]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[9]  James Kadirire.  Minimising packet copies in multicast routing by exploiting geographic spread , 1994, CCRV.

[10]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[11]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[12]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[13]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[14]  Jon Crowcroft,et al.  Core Based Trees (CBT) An Architecture for Scalable Inter-Domain Multicast Routing , 1993, SIGCOMM 1993.

[15]  Kameshwar MunagalayStanford UniversityJuly.  Extending Greedy Multicast Routing to Delay Sensitive Applications , 1999 .

[16]  Ashish Goel,et al.  Efficient computation of delay-sensitive routes from one source to all destinations , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[17]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..