A new delay-constrained algorithm for multicast routing tree construction

International Journal of Communication Systems

Volumn 17, Issue 10, 2004, Pages 985-1000

  Aissa, Mohamed ^a   Mnaouer, Adel Ben ^b  

^a Sur College of Education   (Oman)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Delay constrained routing; End to end quality of service; Minimal spanning tree; Minimum cost; Minimum radius; Multicast routing algorithms

Indexed keywords

ALGORITHMS; BANDWIDTH; MULTICASTING; MULTIMEDIA SYSTEMS; QUALITY OF SERVICE; RESOURCE ALLOCATION; ROUTERS; TELECOMMUNICATION SERVICES; TREES (MATHEMATICS);

DELAY-CONSTRAINED ROUTING; END-TO-END QUALITY OF SERVICE; MIMINUM RADIUS; MINIMAL SPANNING TREE; MINIMUM COST; MULTICAST ROUTING ALGORITHMS;

TELECOMMUNICATION NETWORKS;

EID: 10444257205     PISSN: 10745351     EISSN: None     Source Type: Journal    
DOI: 10.1002/dac.685     Document Type: Article

References (18)

1. Casetti C, et al. A new class of QoS strategies based on network graph reduction. Proceedings of the Conference on Computers and Communication (IEEE INFOCOM'02), June 2002.
2. Nelakuditi S, Zhang ZL, Tsang RP, Du DHC. Adaptive proportional routing: a localized QoS routing approach. IEEE/ACM Transactions on Networking 2002; 10(6):790-804.
3. Kou L, Markowsky G, Berman L. A fast algorithm for Steiner Trees. Acta Informatica 1981; 15(2);141-145.
4. Kompella VP, Pasquate JC, Polyzos GC. Two distributed algorithms for multicasting multimedia information. Proceedings of Computer Communications and Networks, San Diego, CA, June 1993.
5. Salama HF. Multicast routing for real-time communication on high-speed networks. Ph.D. Dissertation, Raleigh, NC, 1996.
6. Sun Q, Langendorfer H. A new distributed routing algorithm with end-to-end delay guarantee. Second Workshop Protocols Multimedia Systems (PROMS'95), October, 1995; 452-458.
7. Alpert CJ, Hu TC, Huang JH. A direct combination of the Prim and Dijkstra constructions for improved performance-driven global routing. Proceedings of the IEEE International Symposium on Circuit and Systems, Chicago, May 1993; 1869-1872.
8. Shaikh A, Shin K. Destination-driven routing for low-cost multicast. IEEE JSAC 1997; 15:373-381.
9. Shaikh A, Lu S, Shin K. Localized multicast routing. Proceedings of the IEEE GLOBECOM, Singapore, November 1995; 1352-1356.
10. Matta I, Guo L. QDMR: an efficient QoS dependent multicast routing algorithm. Journal of Communications and Networks - Special Issue on QoS in IP Networks 2000; 2(2):168-176.
11. Dijkstra EW. A note on two problems in connection with graphs. Numerische Mathematik 1959; 1:269-271.
12. Prim BC. Shortest connecting networks and some generalizations. Bell System Technical Journal 1959; 36:1389-1401.
13. Cong J, et al. Provably good performance-driven global routing. IEEE Transactions on CAD 1992; 11(6):739-752.
14. Khuller S, et al. Balancing minimum spanning and shortest path trees. Proceedings of the ACM/SIAM Symposium on Discrete Algorithms, January 1993; 243-250.
15. Joseph C, el al. The multimedia multicasting problem. Multimedia Systems 1998; N6:43-59.
16. Meylan F, Kiatake LGG, Santos MZ, Kofuji ST, Courtiat JP. Comparative analysis of multicast routing algorithms for multimedia communication over ATM networks. IEEE Latin American Network Operations and Management Symposium, Rio de Janeiro, December 1999.
17. Saunders S, Takaoka T. Improved shortest path algorithms for nearly acyclic graphs. Theoretical Computer Science 2003; 293(3):535-556.
18. Wang B, Hou JC. Multicast routing and its QoS extension: problems, algorithms, and protocols. IEEE Networks 2000; 14(1):22-36.