A Study of Anycast Application for Efficiency Improvement of Multicast Trees

Abstract

Abstract. In this paper, we considered previously existing multicast routing algorism and protocol and especially put more attention on CBT routing protocol to analyze its strength and weakness. As a result, traffic was converged upon core router because of structural problem of CBT protocol and according to the converged traffic, there was congestion at the core link, thus it caused efficiency degrades of the whole routing. Therefore, we proposed a way of conversion to Anycast Routing method from the method of CBT multicast tree routing that was suitable for traffic decentralization even though there was high bandwidth depended on increment of traffic load. In order to support multimedia service that requires from small to large bandwidth and to consider multicast routing protocol to improve characteristic of multicast packet's delay, CBT/Anycast routing method can be proposed as an alternative plan for freedom of bandwidth in traffic.

A Quality of Service Anycast Routing Algorithm Based on Improved Ant Colony Optimization

“…It allows a host to communicate with the "nearest" destination host, which is one of the destination hosts that have the same anycast address and provide the same service. In addition, in order to provide better server selection and load balancing, anycast supports auto-configuration in DNS and has important application in ad hoc networks and sensor networks [2]. With the rapid expansion of the Internet, which leads to the usage of replicated servers and other anycast services are increasing, an effective anycast routing algorithms are becoming important to solve this problem.…”

“…When the m ants pass different paths, each path has different ant, ants are exceedingly dispersed (2). The m ants walk on the same path, that the ants are extremely concentrated.…”