AN EFFICIENT ALGORITHM FOR SHORTEST PATH MULTICAST ROUTING UNDER DELAY AND DELAY VARIATION CONSTRAINTS

A new heuristic algorithm is proposed for constructing multicast tree for multimedia and interactive applications that require certain quality of services, QoS. We consider two main QoS parameters that are the delay and delay variation. The problem is formulated as constructing shortest path tree under delay and delay variation constraints. The tree is used to concurrently transmit packets from source to multiple destinations such that exactly one copy of any packet traverses the links of the multicast tree. This problem is known to be NP-Complete. The proposed heuristic algorithm solves this problem in polynomial time and gives near optimal tree. We first mention some related work in this area then we formalize the problem and introduce the new algorithm with the proof of its complexity. Other heuristic algorithms are examined and compared with the proposed algorithm via simulation.

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

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

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

[4]  George C. Polyzos,et al.  Multicasting for multimedia applications , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[5]  Qing Zhu,et al.  A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.

[6]  Mohamed F. Mokbel.  A Delay-Constrained Shortest Path Algorithm for Multicast Routing in Multimedia Applications , 2001 .

[7]  George N. Rouskas,et al.  Cost, Delay, and Delay Variation Conscious Multicast Routing , 1997 .

[8]  Ron Widyono.  The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .

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

[10]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[11]  Xiaohua Jia,et al.  A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks , 1998, TNET.

[12]  Quan Sun,et al.  Efficient Multicast Routing for Delay-Sensitive Applications , 1995 .

[13]  R. Bellman.  Dynamic programming. , 1957, Science.

[14]  Mohamed N. El-Derini,et al.  NEW ALGORITHMS FOR MULTICAST ROUTING IN REAL TIME NETWORKS , 1999 .

[15]  Yanghee Choi,et al.  Delay constrained distributed multicast routing algorithm , 1997, Comput. Commun..