A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks

IEEE/ACM Transactions on Networking

Volumn 6, Issue 6, 1998, Pages 828-837

  Jia, Xiaohua ^a,b  

^a IEEE   (Hong Kong)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Delay bounded multicast; Distributed routing algorithm; Multicast routing; Multimedia systems; Real time communications

Indexed keywords

EID: 0002991522     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.748092     Document Type: Article

References (21)

1. F. Bauer and A. Varma, "Distributed algorithms for multicast path set up in data networks," IEEE/ACM Trans. Networking, vol. 4, pp. 181-191, Apr. 1996.
2. R. E. Bellman, Dynamic Programming. Princeton, NJ: Princeton Univ., 1957.
3. K. Bharath-Kumar and J. M. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., vol. COM-31, pp. 343-351, Mar. 1983.
4. G. Chen, M. Houle, and M. Kuo, "The Steiner problem in distributed computing systems," Inform. Sci., vol. 74, no. 1-2, pp. 73-96, Oct. 1993.
5. C. Cheng, R. Riley, S. Kumar, and J. Garcia-Luna-Aceves, "A loop-free extended Bellman-Ford routing protocol without bouncing effect," ACM Computer Commun. Rev., vol. 19, no. 4, pp. 224-236, Sept. 1989.
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT, 1992.
7. D. Ferrari and D. C. Verma, "A scheme for real-time channel establishment in wide-area networks," IEEE J. Select. Areas Commun., vol. 8, pp. 368-379, Apr. 1990.
8. J. Ford and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton Univ., 1962.
9. R. G. Gallarger, P. A. Humblet, and P. M. Spira, "A distributed algorithm for minimum-weight spanning trees," ACM Trans. Programming Languages and Systems, vol. 5, no. 1, pp. 66-77, Jan. 1983.
10. J. Garcia-Luna-Aceves and W. Zaumen, "Area-based, loop-free Internet routing," in Proc. IEEE INFOCOM 94, Canada, June 1994, pp. 1000-1007.
11. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
12. Gilbert and H. O. Pollak, "Steiner minimal tree," SIAM J. Appl. Math., vol. 16, 1968.
13. F. K. Hwang and D. S. Richards, "Steiner tree problems," Networks, vol. 22, pp. 55-89, 1992.
14. X. Jia, N. Pissinou, and K. Makki, "A real-time multicast routing algorithm for multimedia applications," Computer Commun. J., vol. 20, no. 12, pp. 1098-1106, Nov. 1997.
15. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, "Multicast routing for multimedia communication," IEEE/ACM Trans. Networking, vol. 1, pp. 286-292, June 1993.
16. _, "Optimal multicast routing with quality of service constraints," J. Network Syst. Management, vol. 4, no. 2, pp. 107-131, 1996.
17. H. F. Salama, D. S. Reeves, and Y. Viniotis, "Evaluation of multicast routing algorithms for real-time communication on high-speed networks," IEEE J. Select. Areas Commun., vol. 15, pp. 332-345, Apr. 1997.
18. B. M. Waxman, "Routing of multipoint connections," IEEE J. Select. Areas Commun., vol. 6, pp. 1617-1622, Dec. 1988.
19. P. Winter, "Steiner problem in networks: A survey," Networks, vol. 17, pp. 129-167, 1987.
20. P. Winter and J. M. Smith, "Path-distance heuristics for the Steiner problem in undirected networks," Algorithmica, pp. 309-327, 1992.
21. Q. Zhu, M. Parsa, and J. Garcia-Luna-Aceves, "A source-based algorithm for delay-constrained minimum-cost multicasting," in Proc. IEEE INFOCOM'95, 1995, pp. 377-385.