Efficient Internet Multicast Routing Using Anycast Path Selection
Journal of Network and Systems Management
MeGaDiP: a wide-area media gateway discovery protocol
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Intelligent multimedia computing and networking
Delay Control and Parallel Admission Algorithms for Real-Time Anycast Flow
The Journal of Supercomputing
Distributed Admission Control for Anycast Flows
IEEE Transactions on Parallel and Distributed Systems
Versatile anycasting with mobile IPv6
AAA-IDEA '06 Proceedings of the 2nd international workshop on Advanced architectures and algorithms for internet delivery and applications
A hybrid method for solving ARWA problem on WDM network
Computer Communications
Research on anycast routing algorithm based on genetic algorithm
CISST'09 Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications
An anycast routing algorithm based on genetic algorithm
WSEAS Transactions on Computers
Effective admission control for real-time anycast flow
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
k-anycast routing schemes for mobile ad hoc networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Next generation networks architecture and layered end-to-end qos control
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
On anycast routing with bandwidth constraint
Computer Communications
| Hi-index | 0.25 |
The use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same path for anycast packets from a source, while multipath routing splits anycast traffic into several different paths. The former is simple and easy to implement, while the latter may potentially reduce congestion, improving delay and throughput performance. However, multipath routing may require additional cost to maintain multipath information. To take advantage of both approaches and overcome their shortcomings, we develop a set of integrated routing algorithms that can adaptively select a subset of routers in the network to carry out multipath routing for anycast messages. We demonstrate that systems using our integrated routing algorithms perform substantially better than those where either the single-path or multipath approach is used alone