An efficient delay-constrained multicast routing algorithm

Journal of High Speed Networks

Volumn 7, Issue 1, 1998, Pages 43-55

  Sun, Quan ^a   Langendörfer, Horst ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Delay constraint; Multicast routing algorithm; Tree cost

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GRAPH THEORY; QUALITY OF SERVICE; REAL TIME SYSTEMS; ROUTERS; SET THEORY;

DELAY CONSTRAINTS; MULTICAST ROUTING ALGORITHMS; SOURCE NODES; TREE COSTS;

MULTICASTING;

EID: 0002601806     PISSN: 09266801     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. V.P. Kompella, J.C. Pasquale and G.C. Polyzos, Multicasting for multimedia applications, in: IEEE INFOCOM '92, 1992, pp. 2078-2085.
2. V.P. Kompella, J.C. Pasquale and G.C. Polyzos, Multicast routing for multimedia communication, IEEE/ACM Trans. of Networking 1(3) (1993), 286-292.
3. S. Wi and Y. Choi, A delay constrained distributed multicast routing algorithm, in: 12th International Conference on Computer Communication (ICCC '95), 1995, pp. 833-838.
4. R. Widyono, The design and evaluation of routing algorithms for real-time channels. Technical Report TR-94-024, Tenet Group, Department of EECS, University of California at Berkeley, 1994.
5. A.G. Waters, A new heuristic for ATM multicast routing, in: 2nd IFIP Workshop on Performance Modelling and Evaluation of ATM Networks, 1994, pp. 8. 1-9.
6. Q. Zhu, M. Parsa and J.J. Garcia-Luna-Aceves, A source-based algorithm for near-optimum delay-constrained multicasting, in: IEEE INFOCOM '95, 1995, pp. 377-385.
7. Q. Sun and H. Langendörfer, Efficient multicast routing for delay-sensitive applications, in: 2nd International Workshop on Protocols for Multimedia Systems (PROMS '95), 1995, pp. 452-458.
8. Q. Sun and H. Langendörfer, A distributed delay-constrained dynamic multicast routing algorithm, in: European Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services (IDMS '97), Lecture Notes in Computer Sciences, Vol. 1309, Springer-Verlag, 1997, pp. 97-106.
9. A.G. Waters and J.S. Crawford, Low-cost ATM multicast routing with constrained delays. Internal Report, Computer Laboratory, University of Kent at Canterbury, UK, Jan. 1996.
10. M. Doar and I. Leslie, How bad is naive multicast routing, in Proc. of INFOCOM '93, 1993, pp. 82-89.
11. L. Wei and D. Estrin, The trade-offs of multicast trees and algorithms, Internet draft, draft-ietf-idmr-mtree-01.ps, March 24, 1995.
12. E. Biersack and J. Nonnenmacher, WAVE: A new multicast routing algorithm for static and dynamic multicast groups, in: 5th Workshop on Network and Operating System Support for Digital Audio and Video, 1995.
13. B. Rajagopalan and R. Nair, Quality of Service (QoS)-based Routing in the Internet - some Issues, Internet draft, Oct. 1996.
14. H.F. Salama, D.S. Reeves and Y. Viniotis, MCRSIM simulator source code and MCRSIM User's Manual, Center for Advanced Computing and Communication, North Carolina State University, Raleigh, 1995 (available by anonymous ftp from ftp.csc.ncsu.edu/pub/rtcomm 〈ftp://ftp.csc.ncsu.edu/pub/rtcomm〉).
15. H.F. Salama, D.S. Reeves and Y. Viniotis, Evaluation of multicast routing algorithms for real-time communication on high-speed networks, IEEE Journal on Selected Areas in Communications 15(3) (1997), 332-345.
16. H.F. Salama, D.S. Reeves and Y. Viniotis, The delay-constrained minimum spanning tree problem. Technical Report TR-96/17, Center for Advanced Computing and Communication, North Carolina State University, USA, June 1996.
17. ATM Forum, Private Network-Network Interface Specification Version 1.0, ATM Forum Draft, March 1996.
18. E.W. Dijkstra, A note on two problems in connection with graphs, Numerische Mathematik 1 (1959), 269-271.
19. L. Kou, G. Markowsky and L. Berman, A fast algorithm for Steiner trees, Acta Informatica 15 (1981), 141-145.
20. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, 1978, pp. 183-188.
21. R. Sedgewick, Algorithms, 2nd edn, Addison-Wesley, 1988.
22. H. Esbensen, Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm, Networks 26 (1995), 173-185.
23. R.W. Floyd, Algorithm 97: shortest paths, Communications of ACM 5 (1962), 345.
24. B.M. Waxman, Routing of multipoint connections, IEEE Journal of Selected Areas in Communications, 6(9) (1988), 1617-1622.
25. S. Rampal and D.S. Reeves, Routing and Admission Control Algorithms for Multimedia Traffic, Dept. of Computer Science, North Carolina State University, Raleigh, 1995.