Constructing minimum cost dynamic multicast trees under delay constraint

Proceedings - International Conference on Computer Communications and Networks, ICCCN

Volumn 2005, Issue , 2005, Pages 133-138

  Yang, Min ^a   Yang, Yuanyuan ^a  

^a Stony Brook University   (United States)

Author keywords

Delay constraint; Dynamic steiner tree; Heuristic; Multicast; Multicast tree; Routing

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); HEURISTIC METHODS; INTERNET; PROBLEM SOLVING; QUALITY OF SERVICE; TREES (MATHEMATICS);

DELAY CONSTRAINTS; DYNAMIC STEINER TREES; MULTICAST TREES; ROUTING;

MULTICASTING;

EID: 33748339580     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.2005.1523827     Document Type: Conference Paper

References (16)

1. B. Waxman, "Routing of Multipoint Connections," IEEE JAC, Dec. 1988, pp. 1617-1622.
2. Z. Baoxian, L. Yue and C. Changjia, "An Efficient Delay-Constrained Multicast Routing Algorithm," Int'l Conf. Comm. Tech., 2000,
3. H.T. Tran and R.J. Harris, "Qos Multicast Routingwith Delay Constraints," International Network Optimization Conference, 2003.
4. G. Popescu and Z. Liu, "Stateless Application-Level Multicast for Dynamic Group Communication," IEEE International Symposium on Distributed Simulation and Real-Time Applications, 2004, pp. 20-28.
5. R. Sriram, G. Manimaran and C. Murthy, "A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees," IEEE/ACM Trans. Networking, vol. 7, no. 4, 1999, pp. 514-529.
6. F. Bauer and A. Varma, "ARIES: A Rearrangeable Inexpensive Edge Based On-Line Steiner Algorithm," IEEE JAC, Dec. 1988, pp. 1617-1622.
7. L. Kou, G. Markowsky and L. Berman, "A Fast Algorithm for Steiner Trees," Acta Informatica, vol. 15, 1981, pp. 141-145.
8. V.P. Kompella, J.C. Pasquale and G.C. Polyzos, "Multicast Routing for Multimedia Communication," IEEE/ACM Trans. Networking, June 1993, pp. 286-292.
9. Q. Zhu, M. Parsa and J. Garcia-Luna-Aceves, "A Source-Based Algorithm for Delay-Constrained Minimum-Cost Multicasting," IEEE INFOCOM, 1995, pp. 377-385.
10. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, MIT Press, 1990.
11. Makoto Imase and Bernard M. Waxman, "Dynamic Steiner Tree Problem," SIAM J. Discrete Math., 4(3), 1991, pp. 369-384.
12. K.C. Wang and J.H. Chen, "An Efficient Probabilistic Dynamic Multicast Routing in ATM Networks," Journal of Information Science and Engineering, vol. 15, no. 4, July 1999, pp. 485-504.
13. L. Zosin and S. Khuller, "On Directed Steiner Trees," SODA'02, pp.59-63.
14. S. Ramanathan, "Multicast Tree Generation in Networks with Asymmetric Links," IEEE/ACM Trans. Networking, vol.4, no.4, 1996, pp. 558-568.
15. D.S. Lun. et al, "Achieving Minimum-Cost Multicast: A Decentralized Approach Based on Network Coding," IEEE INFOCOM, 2005.
16. J. Kadirire and G. Knight, "Comparison of Dynamic Multicast Routing Algorithms for Wide-Area Packet-Switched (ATM) Networks," IEEE INFOCOM, 1995, pp. 212-219.