Distributed routing for dynamic multicasting with advance resource reservation information

International Conference on Information Networking

Volumn 2001-January, Issue , 2001, Pages 603-610

  Chakraborty, D ^a   Pornavalai, C ^a   Chakraborty, G ^a   Shiratori, N ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Asynchronous transfer mode; Communication switching; Cost function; Electronic mail; Multicast algorithms; NP complete problem; Packet switching; Routing; Switches; Unicast

Indexed keywords

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; COST FUNCTIONS; COSTS; ELECTRIC SWITCHES; ELECTRONIC MAIL; JOINING; NETWORK ROUTING; OPTIMIZATION; PACKET SWITCHING; ROUTING ALGORITHMS; SWITCHES; TREES (MATHEMATICS);

COMMUNICATION SWITCHING; DYNAMIC MULTICAST GROUPS; DYNAMIC MULTICASTING; MULTICAST ALGORITHMS; MULTIMEDIA APPLICATIONS; RESOURCE RESERVATIONS; ROUTING; UNICAST;

MULTICASTING;

EID: 84857355310     PISSN: 19767684     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICOIN.2001.905519     Document Type: Conference Paper

References (14)

1. J.D. Ullman. A.V. Aho, J.E. Hopcroft. Data structures and algorithms. Pub. Addision-Wesley, April 1987.
2. D. Chakraborty C. Pornavalai, G.Chakraborty and N. Shiratori. Optimal routing for dynamic multipoint connection. In European Transaction on Telecommunications. Vol 10, No 2, March-April 1999.
3. G. Ventre. D. Ferrari, A. Gupta. Distributed advance reservation of real-time connections. Proceedings of Sixth International Workshop on Network and Operating System Support for Distributed Audio and Video. April, 1995.
4. C.Pornavalai D.Chakraborty, G.Chakraborty and N. Shiratori. Dynamic multicast routing in advance resource reservation environment. Proc. of ICPADS 2000. Iwate, Japan.
5. Matthew Doar and Ian Leslie. How bad is naive multicast routing? Proceedings of IEEE INFOCOM, San Francisco, CA. April, 1993, pages 82-89.
6. Amit Gupta. Improved performance for multi-party communication through advance resource reservation. Proceedings of Sixth International Workshop on Network and Operating System Support for Distributed Audio and Video. April, 1996.
7. Paul C. Huang and Y. Tanaka. Multicast routing based on predicted traffic statistics. In IEICE Trans. Communication, Vol. E77-B, No.10, October, 1994.
8. F.K. Hwang and D.S. Richards. Steiner tree problems. Networks. Vol. 22, No.1, pages 55-89. Jan. 1992.
9. James Kadirire. Minimizing packet copies in multicast routing by exploiting geographic spread. ACM SIGCOMM CCR. Vol 24, No.3, July, 1994.
10. G. Markowsky L. Kou and L. Berman. A fast algorithm for steiner trees. Acta Informatica. Vol. 15. No.11. 1981.
11. M.R.Garey and D.S. Johnson. Computers and intractablitity: A guide to the theory of np-compleness. San Francisco, CA: Freeman, 1979.
12. A. Orda R. Guerin and D. Williams. Qos routing mechanism and ospf extensions. InInternet Draft, Nov. 1996.
13. J.C. Pasquale V.P. Kompella and G.C. Plyzos. Multicast routing for multimedia communication. In IEEE/ACM Trans,. Networking. Vol.1, No.3, pages 286-292, June. 1993.
14. Berman M. Waxman. Routing of multiple connections. IEEE Journal on selected areas in Communications. Vol.6. No.9. 1988.