Abstract
According to the social demand to the expansion of internet use and construction of ultrahigh speed network, the realtime and the maximized capacity multimedia data service gets exceeding the infra level of communication. As a response to the communication condition, multicast service provides effective use from various resources and corresponds actively to high-speed data transmission. For these reasons, multicast service is considered as a major internet solution for the next generation. Thus in this study, various multicast routing methods are proposed and an analysis for CBT routing method based on CBT routing protocol from the existing multicast routing protocol is made. As a result, there happens traffic congestion to a core router because of structure problem of CBT protocol, thus performance of the whole routing declines as a consequence. The AIMD (Additive Increase Multiple Decrease) algorism applied Anycast routing method that is suitable for traffic dispersion in high bandwidth according to increment of traffic load from CBT Shared Tree Routing Method is strongly suggested in this thesis.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Parsa, M., Garcia-Luna-Aceves, J.J.: A protocol for scalable loop-tree multicast routing. IEE IEEE J. Select. Areas Commun. 15, 316–331 (1997)
Jia, X., Wang, L.: A Group Multicast Routing Algorithm by using Multiple Minimum Steiner Trees. Computer Communications, 750–758 (1997)
Ballardie, A.: Core Based Trees (CBT) Multicast Routing Architecture, RFC2201 (1997)
Ballardie, A.: Core Based Trees (CBT Version 2) Multicast Routing Protocol Specificastion RFC2189 (1997)
Moy, J.: Multicast Extensions to OSPF. IETF RFC 1584 (1994)
Ettikan, K.: An Analysis Of Anycast Architecture And Transport Layer Problems. In: Asia Pacific Regional Internet Conference on Operational Technologies, Kuala Lu-mpur, Mal-aysia (February-March 2001)
Lin, J., Paul, S.: RMTP: A Reliable Multicast Transport Protocol. In: Yavatkar, R., Griffioen, J., Sudan, M. (eds.) IEEE INFOCOM 1996, San Francisco, CA (March 1996) (reliable Dissemination)
Yoon, W., Lee, D., Youn, H., Lee, S., Koh, S.: A Combined Group/Tree Approach for Many-to-Many Reliable Multicast. In: IEEE INFOCOM 2002 (June 2002)
Levine, B.N., Paul, S., Garcia-Luna-Aceves, J.J.: Organizing multicast receivers deterministically by packet-loss correlation. In: The sixth ACM international conference on Multimedia, September 1998, pp. 201–210 (1998)
The Network Simulator: ns-2, http://www.isi.edu/nsnam/ns/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, KJ., Choi, WH., Kim, JS. (2004). Adaptive CBT/Anycast Routing Algorithm for Multimedia Traffic Overload. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24768-5_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-24768-5_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22060-2
Online ISBN: 978-3-540-24768-5
eBook Packages: Springer Book Archive