Provably good approximation to minimum cost delay-constrained multicast trees

Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999

Volumn , Issue , 1999, Pages 610-614

  Xue, Guoliang ^a  

^a University of Vermont   (United States)

Author keywords

Approximation algorithms; communication systems; minimum cost delay constrained multicast trees

Indexed keywords

APPROXIMATION ALGORITHMS; COMMUNICATION SYSTEMS; COMPUTER NETWORKS; COSTS; ECONOMIC AND SOCIAL EFFECTS; INTERACTIVE COMPUTER SYSTEMS; MULTICASTING; REAL TIME SYSTEMS;

DELAY CONSTRAINTS; EFFICIENT APPROXIMATION ALGORITHMS; MINIMUM COST; MULTICAST TREE; PERFORMANCE BOUNDS; SHORTEST PATH TREE; STEINER MINIMUM TREES; TRADE OFF;

TREES (MATHEMATICS);

EID: 84940693780     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.1999.805581     Document Type: Conference Paper

References (20)

1. B. Awerbuch, A. Baratz and D. Peleg, Cost-sensitive analysis of communication protocols, ACM PODC'90, pp. 177-187.
2. K. Bharath-Kumar and J.M. Jaffe, Routing to multiple destinations in computer networks, IEEE Transactions on Communications, Vol. 31(1983), pp. 343-351.
3. I. Chlamtac, A. Farago, H.B. Zhang and A. Fumagalli, A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks, IEEE/ACM Transactions on Networking, Vol. 6(1998), pp. 422-431.
4. J. Cong, A.B. Kahng, G. Robins, M. Sarrafzadeh and C.K. Wong, Provably good performance-driven global routing, IEEE Transactions on CAD, Vol. 11(1992), pp. 739-752.
5. E.W. Dijkstra, A note on two problems in connection with graphs, Numerische Mathematik, Vol. 1(1959), pp. 269-271.
6. M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the Association for Computing Machinery, Vol. 34(1987), pp. 596-615.
7. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP'-Completeness, Freeman, 1979.
8. X.H. Jia, A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks, IEEE/ACM Transactions on Networking, Vol. 6(1998), pp. 828-837.
9. X.H. Jia, N. Pissinou and K. Makki, A delay-bounded multicast routing algorithm in WANs, Computer Communications. 20(1997), pp. 1098-1106.
10. X.H. Jia, Y.B. Zhang, N. Pissinou and K. Makki, An efficient admission control method of real-time multicast connections in wide area networks, IEEE ICCCN'98, pp. 865-872.
11. M. Karpinski and A. Zelikovsky, New approximation algorithms for the Steiner tree problems, Journal of Combinatorial Optimization, Vol. 1(1997), pp. 47-65.
12. S. Khuller, B. Raghavachari and N. Young, Balancing minimum spanning and shortest path trees, ACM/SIAM SODA'93, pp. 243-250.
13. G.H. Lin and G.L. Xue, Balancing shortest path trees and Steiner minimum trees in the rectilinear plane, IEEE ISC AS'99, accepted.
14. M. Parsa, Q. Zhu and J.J. Garcia-Luna-Aceves, An iterative algorithm for delay-constrained minimum-cost multicasting, IEEE/ACM Transactions on Networking, Vol. 6(1998), pp. 461-474.
15. S. Ramanathan, Multicast tree generation in networks with asymmetric links, IEEE/ACM Transactions on Networking, Vol. 4(1996), pp. 558-568.
16. C.P. Ravikumar and R. Bajpai, Source-based delay-bounded multicasting in multimedia networks, Computer Communications, Vol. 21(1998), pp. 126-132.
17. H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math. Japonica Vol. 24(1980), pp. 573-577.
18. D.B. West, Introduction to Graph Theory, Prentice Hall, 1996.
19. G.L. Xue, End-to-end delay paths: quickest or most reliable? IEEE Communications Letters, Vol. 2(1998), pp. 156-158.
20. G.L. Xue and S.Z. Sun, Optimal multicast trees in communication systems with channel capacities and channel reliabilities, IEEE Transactions on Communications, Vol. 46(1999), pp. 662-663.