A case for tree evolution in QoS multicasting

IEEE International Workshop on Quality of Service, IWQoS

Volumn 2002-January, Issue , 2002, Pages 116-125

  Chakrabarti, A ^a   Striegel, A ^a   Manimaran, G ^a  

^a Iowa State University   (United States)

Author keywords

Acceleration; Computer aided software engineering; Computer networks; Costs; Degradation; IP networks; Multicast protocols; Quality of service; Routing protocols; Scalability

Indexed keywords

ACCELERATION; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER NETWORKS; COST ENGINEERING; COSTS; DEGRADATION; ECONOMIC AND SOCIAL EFFECTS; FORESTRY; INTERNET; INTERNET PROTOCOLS; QUALITY OF SERVICE; ROUTING PROTOCOLS; SCALABILITY; SOFTWARE ENGINEERING; TELECOMMUNICATION SERVICES;

EVOLUTION MODELING; GROUP COMMUNICATIONS; IP NETWORKS; MULTICAST PROTOCOL; SCALABLE SOLUTION; SERVICE DISRUPTIONS; SHORTEST PATH TREE; SIMULATION STUDIES;

MULTICASTING;

EID: 0038318639     PISSN: 1548615X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWQoS.2002.1006580     Document Type: Conference Paper

References (15)

1. A. Chakrabarti, G. Manimaran, "A Case for Scalable Multicast Tree Migration," in Proc. IEEE Globecom, 2001.
2. J. Hou and B. Wang, "Multicast routing and its QoS extension: Problems, algorithms, and Protocols," in IEEE Network, Jan./Feb. 2000.
3. K.Carlberg, "QoS Multicast using single metric Unicast Routing", PhD thesis, University College London, Oct. 1999.
4. S. Deering, C. Partridge, and D. Waitzmann, "Distance vector multicast routing protocol," RFC 1075, Nov. 1988.
5. T. Ballardie, P. Francis, and J. Crowcroft, "Core-based trees (CBT): An architecture for scalable inter-domain multicast routing," in Proc. ACM SIGCOMM, pp.85-95, 1993.
6. S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C. Liu, and L. Wei, "The PIM architecture for wide-area multicast routing," in IEEE/ACM Trans. Networking, vol.4, no.2, pp.153-162, Apr. 1996.
7. M. Parsa and J.J. Garcia-Luna-Aceves, "A protocol for scalable loop-free multicasting," in IEEE JSAC, vol.15, no.3, April 1997.
8. C. Donahoo and Zegura, "Core selection methods for multicast routing," in Proc. ICCCN, 1995.
9. E. Fleury, Y. Huang, and P.K. McKinley, "On the performance and feasibility of multicast core selection heuristics," in Proc. ICCCN, 1998.
10. L. Schwiebert and R. Chintalapati, "Improved fault recovery for core based trees," in Computer Communications, vol.23, no.9, Apr. 2000.
11. C. Donahoo and Zegura, "Core migration for dynamic multicast routing," in Proc. ICCCN, 1996.
12. R. Sriram, G. Manimaran, C. Siva Ram Murthy, "A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees," in IEEE/ACM Trans. Networking, vol.7, no.4, pp.514-529, Aug. 1999.
13. H. Takashami and A. Matsuyama, "An approximate solution for the Steiner tree problem in graphs," in Intl. J. Math Educ. in Sci. and Technol., vol.14, no.1, pp.15-23, 1983.
14. L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, "RSVP: A New Resource Reservation Protocol,", in IEEE Network, September 1993.
15. UCB/LBNL/VINT Network Simulator - ns (version 2), Available at www.mash.cs.berkeley.edu/ns/.