A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 1999, Pages 1073-1080

  Sriram, R ^a   Manimaran, G ^a   Siva Ram Murthy, C ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COST-COMPETITIVENESS; DYNAMIC MULTICAST; GROUP MEMBERS; GROUP MEMBERSHIPS; INFOCOM; MULTICAST APPLICATION; MULTICAST GROUPS; MULTICAST SESSIONS; MULTICAST TREE; QUALITY FACTORS; VIDEO BROADCASTS;

ALGORITHMS; COMPETITION; DROPS; FORESTRY; MULTICASTING; MULTIMEDIA SYSTEMS; QUALITY OF SERVICE; TREES (MATHEMATICS);

TREES (MATHEMATICS); MULTICASTING;

QUALITY FACTOR CONCEPT;

EID: 0032648772     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.1999.751662     Document Type: Conference Paper

References (16)

1. T. Ballardie, P. Francis, and J. Crowcroft, "Core-based trees (CBT): An architecture for scalable inter-domain multicast routing," Computer Commun. Rev., vol. 23, no. 4, pp. 85-95, 1993.
2. F. Bauer and A. Varma, "ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm," IEEE JSAC, vol. 15, no. 3, pp. 382-397, Apr. 1997. (Pubitemid 127571573)
3. F. Bauer and A. Verma, "Distributed algorithms for multicast path setup in data networks," IEEE/ACM Trans, on Networking, vol. 4, no. 2, pp. 181-191, Apr. 1996. (Pubitemid 126784914)
4. S. Deering et al., "The PIM architecture for wide-area multicast routing," IEEE/ACM Trans. Networking, vol. 4, no. 2, pp. 153-162, 1996. (Pubitemid 126784911)
5. M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, W.H. Freeman, 1979.
6. S. Hong, H. Lee, and B. H. Park, "An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership," Proc. of IEEE INFOCOM, pp. 1433-1440, 1998.
7. F. Hwang and D. Richards, "Steiner tree problems," Networks, vol. 22, pp. 55-89, 1992.
8. M. Imase and B. Waxman, "Dynamic Steiner tree problems," SIAM J. Disc. Math., vol. 4, no. 3, pp. 369-384, Aug. 1991.
9. J. Kadirire and G. Knight, "Comparison of dynamic multicast routing algorithms for wide-area packet switched (Asynchronous Transfer Mode) networks," Proc. of IEEE INFOCOM, pp. 212-219, Apr. 1995.
10. V. Kompella, J. C. Pasquale, and G. C. Polyzos, "Two distributed algorithms for the constrained Steiner tree problem," Proc. Comput. Commun. Networking, San Diego, CA, June 1993.
11. R. Sriram, G. Manimaran and C. Siva Ram Murthy, "Preferred-link based delay-constrained least cost routing in wide area networks," Computer Communications, vol. 21, no. 18, pp. 1655-1669, Dec. 1998. (Pubitemid 128409221)
12. R. Sriram, G. Manimaran and C. Siva Ram Murthy, "Algorithms for delay-constrained low-cost multicast tree construction," Computer Communications, vol. 21, no. 18, pp. 1693-1706, Dec. 1998. (Pubitemid 128409224)
13. H. F. Salama, Douglas S. Reeves, and Yannis Viniotis, "A distributed algorithm for delay-constrained unicast routing," Proc. IEEE INFOCOM, 1997.
14. B. Waxman, "Routing of multipoint connections," IEEE JSAC, vol. 6, no. 9, pp. 1617-1622, Dec. 1988.
15. B. Waxman, "Performance evaluation of multipoint routing algorithm," Proc. IEEE INFOCOM, pp. 980-986, 1993.
16. P. Winter, "Steiner problem in networks: A survey," Networks, vol. 17, no. 2, pp. 129-167, 1987.