Abstract
With conventional dynamic routing algorithms, many query messages are required in a distributed environment for efficient multicast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.
Chapter PDF
Similar content being viewed by others
References
The IP Multicast Initiative, The IP Multicast Initiative Home page, http://www.ipmulticast.com/, Dec. 1998.
The MBone Information Web, Home Page, http://www.mbone.com/, Dec. 1998.
C. Diot, W. Dabbous and J. Crowcroft, “Multipoint Communication: a Survey of Protocols, Functions, and Mechanisms,” IEEE JSAC., Vol. 15, No. 3, pp. 277–290, April 1997.
A. Ballardie, “Core Based Trees (CBT Version 2) Multicast Routing — Protocol Specification —,” RFC2189, Sept. 1997.
D. Estrin, D. Farinacci, A. Helmy, D. Thaler, S. Deering, M. Handley, V. Jacobson, C. Liu, P. Sharma and L. Wei, “Protocol Independent Multicast-sparse Mode (PIM-SM): Protocol Specification,” RFC2362, June 1998.
J. Moy, “Multicast Extensions to OSPF,” RFC 1584, March 1994.
M. Doar and I. Leslie, “How Bad is Naïve Multicast Routing?” IEEE INFO-COM’93, pp. 82–89, March 1993.
B. M. Waxman, “Routing of Multipoint Connections,” IEEE JSAC., Vol. 6, No. 9, pp. 1617–1622, Dec. 1988.
B. M. Waxman, “Performance Evaluation of Multipoint Routing Algorithms,” IEEE INFOCOM’93, pp. 980–986, March 1993.
H. Lin and S. Lai, “VTDM-a Dynamic Multicast Routing Algorithm,” IEEE INFOCOM’98, pp. 1426–1432, March–April 1998.
J. Kadirire, “Minimizing Packet Copies in Multicast Routing by Exploiting Geographic Spread,” ACM SIGCOMM Computer Communication Review, Vol. 24, pp. 47–63, 1994.
J. Kadirire, “Comparison of Dynamic Multicast Routing Algorithms for Wide-area Packet Switched (Asynchronous Transfer Mode) Networks,” IEEE INFOCOM’95, pp. 212–219, March 1995.
R. Venkateswaran, C. S. Raghavendra, X. Chen and V. P. Kumar, “DMRP: a Distributed Multicast Routing Protocol for ATM Networks,” ATM Workshop’97, May 1997.
K. Carlberg and J. Crowcroft, “Building Shared Trees using a One-to-many Joining Mechanism,” ACM Computer Communication Review, Vol. 27, No. 1, pp. 5–11, Jan. 1997.
M. Faloutsos, A. Banerjea, and R. Pankaj, “QoSMIC: Quality of Service Sensitive Multicast Internet Protocol,” ACM SIGCOMM’ 98, Sep. 1998.
L. Wei and D. Estrin, “The Trade-offs of Multicast Trees and Algorithms,” ICCN’94, Sept. 1994.
F. Bauer and A. Varma, “ARIES: a Rearrangeable Inexpensive Edge-based On-line Steiner Algorithm,” IEEE INFOCOM’96, pp. 361–368, March 1996.
M. Faloutsos, R. Pankaj and K. C. Sevcik, “Bounds for the On-line Multicast Problem in Directed Graphs,” 4th International Colloquium on Structural Information and Communication Complexity, July 1997.
P. Winter, “Steiner Problem in Networks: a Survey,” Networks, Vol. 17, pp. 129–167, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asaka, T., Miyoshi, T., Tanaka, Y. (2000). New Distributed Multicast Routing and Its Performance Evaluation. In: Pujolle, G., Perros, H., Fdida, S., Körner, U., Stavrakakis, I. (eds) Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks. NETWORKING 2000. Lecture Notes in Computer Science, vol 1815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45551-5_70
Download citation
DOI: https://doi.org/10.1007/3-540-45551-5_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67506-8
Online ISBN: 978-3-540-45551-6
eBook Packages: Springer Book Archive