Routing algorithms for asymmetric multi-destination connections in multicluster networks

IEICE Transactions on Communications

Volumn E81-B, Issue 8, 1998, Pages 1582-1589

  Zhang, Yibo ^a   Asano, Shoichiro ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Communication network; Multicast routing; Multidestination connection; Steiner tree

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; ROUTERS; TREES (MATHEMATICS);

STEINER TREE HEURISTICS;

TELECOMMUNICATION NETWORKS;

EID: 0032139383     PISSN: 09168516     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. B. Rajagopalan, "Reliability and scaling issues in multicast communication," Proc. ACM SIGCOMM'92, pp.188-198, 1992.
2. H. Noma, Y. Kitamura, T. Miyasato, and F. Kishino, "Multi-point virtual space teleconferencing system," IEICE Trans. Commun., vol.E78-B, no.7, pp.970-979, July 1995.
3. M. Ghanbari, "Two-layer coding of video streams for VBR networks," IEEE J. Select. Areas Commun., vol.7, no.5, pp.771-781, June 1989.
4. N. Shacham, "Multipoint communication by hierarchically encoded data," Proc. IEEE INFOCOM'92, pp.2107-2114, 1992.
5. N. Shacham and J.S. Meditch, "An algorithm for optimal multicast of multimedia streams," Proc. IEEE INFOCOM'94, pp.856-864, 1994.
6. P. Winter, "Steiner problem in networks: A survey," NETWORKS, vol.17, pp.129-167, 1987.
7. R.M. Karp, "Reducibility among combinatorial problems," Complexity Computer Communications, eds. Miller & Thatcher, pp.85-103, New York, Plenum, 1972.
8. H. Takahashi and A. Matsuyama, "An approximate solution for the Steiner problem in graphs," Math. Japonica, vol.24, pp.573-577, 1980.
9. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees," Acta Informatica, vol.15, pp.141-145, 1981.
10. V.J. Rayward-Smith and A. Claire, "On finding Steiner vertices," NETWORKS, vol.16, pp.283-294, 1986.
11. K. Bharath-Kumar and J.M. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., vol.COM-31, no.3, pp.343-351, March 1983.
12. B.M. Waxman, "Routing of multipoint connections," IEEE J. Select. Areas Commun., vol.6, no.9, pp.I617-1622, Dec. 1988.
13. Y. Tanaka and P.C. Huang, "Multiple destination routing algorithms," IEICE Trans. Commun., voI.E76-B, no.5, pp.544-552, May 1993.
14. V. Kompella, J. Pasquale, and G. Polyzos, "Multicast routing for multimedia communication," IEEE/ACM Trans. Networking, vol.1, no.3, pp.286-292, June 1993.
15. Q. Zhu, M. Parsa, and J.J. Garcia-Luna-Aceves, "A sourcebased algorithm for delay-constrained minimum-cost multicasting," Proc. IEEE INFOCOM'95, pp.377-385, 1995.
16. X. Jiang, "Distributed path finding algorithm for stream multicast," Computer Communications, vol.16, no.12, pp.767-775, Dec. 1993.
17. R.G. Gallager, P.A. Humblet, and P.M. Spira, "A distributed algorithm for minimum-weight spanning trees," ACM Trans. Prog. Lang. Syst., vol.5, no.l, pp.66-77, 1983.
18. A. Shaikh and K. Shin, "Destination-driven routing for low-cost multicast," IEEE J. Select. Areas Commun., vol.15, no.3, pp.373-381, April 1997.
19. L. Kleinrock and F. Kamoun, "Hierarchical routing for large networks: Performance evaluation and optimization," Computer Networks, vol.1, pp. 155-174, 1977.
20. P. Krishna, N.H. Vaidya, M. Chatterjee, and O.K. Pradhan, "A cluster-based approach for routing in dynamic networks," ACM Computer Communication Review, vol.27, no.2, pp.49-64, April 1997.
21. D. Waitzman, S. Deering, and C. Partridge, "Distance vector multicast routing protocol," RFC1075, Nov. 1988.
22. J. Moy, "Multicast extension to OSPF," Internet Draft, Sept. 1992.
23. L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, "RSVP: A new resource reservation protocol," IEEE Network Magazine, pp.8-18, Sept. 1993.