Multicast Routing with Delay and Delay Variation Constraints for Collaborative Applications on Overlay Networks

Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include video-conferencing, distributed database replication, and online games. This type of application requires a multicasting subnetwork, using which messages should arrive at the destinations within a specified delay bound. These applications also require that destinations receive the message from the source at approximately the same time. The problem of finding a multicasting subnetwork with delay and delay-variation bound has been proved to be an NP complete problem in the literature and heuristics have been proposed for this problem. In this paper, we provide an efficient heuristic to obtain a multicast subnetwork on an overlay network, given a source and a set of destinations that is within a specified maximum delay and a specified maximum variation in the delays from a source to the destinations. The time-complexity of our algorithm is O(|E|+nk log(|E|/n)+m2k), where n and |E| are the number of nodes and edges in the network, respectively, k is the number of shortest paths determined, and m is the number of destinations. We have shown that our algorithm is significantly better in terms of time-complexity than existing algorithms for the same problem. Our extensive empirical studies indicate that our heuristic uses significantly less runtime in comparison with the best-known heuristics while achieving the tightest delay variation for a given end-to-end delay bound

[1]  Qing Zhu,et al.  An iterative algorithm for delay-constrained minimum-cost multicasting , 1998, TNET.

[2]  Zbigniew Dziong,et al.  Analysis of multicast routing algorithms for broadband networks , 1998, 1998 IEEE ATM Workshop Proceedings. 'Meeting the Challenges of Deploying the Global Broadband Network Infrastructure' (Cat. No.98EX164).

[3]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[4]  Anees Shaikh,et al.  Destination-Driven Routing for Low-Cost Multicast , 1997, IEEE J. Sel. Areas Commun..

[5]  Andrés Marzal,et al.  Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison , 1999, WAE.

[6]  Hans Eriksson,et al.  MBONE: the multicast backbone , 1994, CACM.

[7]  Yuval Shavitt,et al.  Approximation and heuristic algorithms for minimum delay application-layer multicast trees , 2004, IEEE INFOCOM 2004.

[8]  Srivatsan Raghavan,et al.  Improved multicast routing with delay and delay variation constraints , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[9]  Pi-Rong Sheu,et al.  A fast and efficient heuristic algorithm for the delay- and delay variation bound multicast tree problem , 2001, Proceedings 15th International Conference on Information Networking.

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

[11]  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).

[12]  A. Hac,et al.  Multicasting algorithm in multimedia communication network , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[13]  Seok Joo Koh,et al.  Enhancement of the CBT multicast routing protocol , 2001, Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001.

[14]  Sridhar Radhakrishnan,et al.  Multicast Routing with Delay and Delay Variation Constraints for Multimedia Applications , 2004, HSNMC.

[15]  Liang Guo,et al.  QDMR: An efficient QoS dependent multicast routing algorithm , 2000, Journal of Communications and Networks.

[16]  George N. Rouskas,et al.  Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..

[17]  Jonathan S. Turner,et al.  Multicast routing and bandwidth dimensioning in overlay networks , 2002, IEEE J. Sel. Areas Commun..

[18]  Tony Ballardie,et al.  Core Based Trees (CBT) Multicast Routing Architecture , 1997, RFC.

[19]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[20]  Joseph D. Touch,et al.  Application deployment in virtual networks using the X-Bone , 2002, Proceedings DARPA Active Networks Conference and Exposition.

[21]  Lin Chen,et al.  An effective heuristic algorithm for dynamic multicast routing with delay-constrained , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[22]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[23]  Anton Riabov,et al.  Overlay multicast trees of minimal delay , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[24]  Samir Khuller,et al.  OMNI: An efficient overlay multicast infrastructure for real-time applications , 2006, Comput. Networks.

[25]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[26]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[27]  Srinivasan Seshan,et al.  Enabling conferencing applications on the internet using an overlay muilticast architecture , 2001, SIGCOMM '01.

[28]  Srinivasan Seshan,et al.  Enabling conferencing applications on the internet using an overlay muilticast architecture , 2001, SIGCOMM 2001.