Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications

Volumn 15, Issue 3, 1997, Pages 346-356

  Rouskas, George N ^a,b,c,d   Baldine, Ilia ^b,e,f  

^a IEEE   (United States)

^b North Carolina State University   (United States)

^c NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^d Georgia Institute of Technology   (United States)

^e ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

^f NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

Delay constrained multicast communication; Multicast routing

Indexed keywords

CONSTRAINT THEORY; DELAY CONTROL SYSTEMS; INTERACTIVE COMPUTER SYSTEMS; MINIMIZATION OF SWITCHING NETS; PACKET NETWORKS; PACKET SWITCHING; PROBLEM SOLVING; REAL TIME SYSTEMS;

DELAY CONSTRAINED MULTICAST COMMUNICATION; MULTICAST ROUTING;

NETWORK PROTOCOLS;

EID: 0031125310     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.564133     Document Type: Article

References (16)

1. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice Hall, 1992.
2. K. Bharath-Kumar and J. M. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., vol. COMM-31, no. 3, pp. 343-351, Mar. 1983.
3. E. W. Dijkstra, "A note on two problems in connection with graphs," Numer. Math., vol. 1, pp. 269-271, 1959.
4. M. R. Garey, R. L. Graham, and D. S. Johnson, "The complexity of computing steiner minimal trees," SIAM J. Appl. Math., vol. 32, no. 4, pp. 835-859, June 1977.
5. M. R. Garey and D. S. Johnson, Computers and Intractability. New York: Freeman, 1979.
6. E. N. Gilbert and H. O. Pollak, "Steiner minimal tree," SIAM J. Appl. Math., vol. 16, 1968.
7. S. L. Hakimi, "Steiner's problem in graphs and its implications," Networks, vol. 1, pp. 113-133, 1971.
8. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, "Multicast routing for multimedia communication," IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 286-292, June 1993.
9. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees," Acta Informatica, vol. 15, pp. 141-145, 1981.
10. E. Lawler, Combinatorial Optimization: Networks and Matmids. New York: Holt, Rinehart and Winston, 1976.
11. R. C. Prim, "Shortest connection networks and some generalizations," Bell Syst. Tech. J., vol. 36, pp. 1389-1401, Nov. 1957.
12. H. Salama, D. Reeves, Y. Viniotis, and T. Sheu. "Comparison of multicast routing algorithms for high-speed networks," IBM, Tech. Rep. IBM-TR29.1930, Sept. 1994.
13. _, "Evaluation of multicast routing algorithms for distributed realtime applications in high-speed networks," in Proc. 6th IFIP Conf. High Speed Networks, Sept. 1995, pp. 27-42.
14. J. S. Turner, "New directions in communications (or which way to the information age?)," IEEE Commun. Mag., vol. 24, no. 10, pp. 8-15, Oct. 1986.
15. B. W. Waxman, "Routing of multipoint connections," IEEE J. Select. Areas Commun., vol. 6, no. 9, pp. 1617-1622, Dec. 1988.
16. Q. Zhu, M. Parsa, and J. J. Garcia-Luna-Aceves, "A source-based algorithm for near-optimum delay-constrained multicasting," in Proc. IEEE Infocom '95, Mar. 1995, pp. 377-385.