Multicast tree generation in networks with asymmetric links

IEEE/ACM Transactions on Networking

Volumn 4, Issue 4, 1996, Pages 558-568

  Ramanathan, S ^a,b  

^a IEEE

^b BBN TECHNOLOGIES   (United States)

Author keywords

Approximation algorithms; Asymmetric links; Directed graph; Multicast; Steiner trees

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; POLYNOMIALS; TELECOMMUNICATION LINKS;

APPROXIMATION ALGORITHMS; POLYNOMIAL TIME ALGORITHM; STEINER MINIMAL TREE;

TELECOMMUNICATION NETWORKS;

EID: 0030211409     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.532865     Document Type: Article

References (21)

1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
2. P. Winter, "Steiner problem in networks: A survey," Networks, vol. 17, pp. 129-167, 1987.
3. F. K. Hwang and D. Richards, "Steiner tree problems," Networks, vol. 22, pp. 55-89, 1992.
4. R. M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, Miller and Thatcher, Eds. New York: Plenum Press, pp. 85-103, 1972.
5. H. Takahashi and A. Matsuyama, "An approximate solution for the Steiner problem in graphs," Math. Japonica, vol. 24, pp. 573-577, 1980.
6. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees," Acta Informatica, vol. 15, pp. 141-145, 1981.
7. V. J. Rayward-Smith, "The computation of nearly minimal Steiner trees in graphs," Int. J. Math. Educ. Sci. Technol., vol. 14, pp. 15-23, 1983.
8. J. Plesnik, "A bound for the Steiner tree problem in graphs," Math. Slovaca, vol. 31, pp. 155-163, 1981.
9. A. Z. Zclikovsky, "A 11/6-approximation algorithm for the network steiner problem," Algorithmica, vol. 9, pp. 463-470, 1993.
10. B. K. Kadaba and J. M. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., vol. COM-31, no. 3, pp. 343-351, Mar. 1983.
11. B. M. Waxman, "Routing of mulitpoint connections," IEEE J. Select. Areas Commun., vol. 6, no. 9, Dec. 1988.
12. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos. "Multicast routing for multimedia communications," IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 286-292, June 1993.
13. F. Bauer and A. Varma, "Degree-constrained multicasting in point-to-point networks," in Proc. IEEE INFOCOM 1995, pp. 369-376.
14. Q. Zhu, M. Parsa, and J. J. Garcia-Luna-Aceves, "A source-based algorithm for delay-constrained minimum-cost multicasting," in Proc. IEEE INFOCOM, 1995, pp. 377-385.
15. X. Jiang, "Routing broadband multicast streams," Computer Commun., vol. 15, no. 1, pp. 45-51, 1992.
16. C.-H. Chow, "On multicast path finding algorithms," in Proc. IEEE Infocom, 1991.
17. K. Claffy, G. Polyzos, and H. W. Braun, "Traffic characteristics of the T1 NSFNET backbone," in Proc. IEEE INFOCOM, Mar. 1993.
18. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
19. C. Lund and M. Yannakakis, "On the hardness of approximating minimization problems," in Proc. 25th Annual ACM Symp. Theory Comput., 1993.
20. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis II, "An analysis of several heuristics for the travelling salesman problem," SIAM J. Comput., vol. 3, no. 6, 1977.
21. S. Even, Graph Algorithms. Rockville, MD: Computer-Science Press, 1979.