Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Multicast routing in internetworks and extended LANs
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Parallel queues with resequencing
Journal of the ACM (JACM)
The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Multi-Path Routing combined with Resource Reservation
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Distributed center-location algorithms
IEEE Journal on Selected Areas in Communications
A protocol for scalable loop-free multicast routing
IEEE Journal on Selected Areas in Communications
Efficient Internet Multicast Routing Using Anycast Path Selection
Journal of Network and Systems Management
A New Conference Network for Group Communication
IEEE Transactions on Computers
An Efficient Algorithm for Application-Layer Anycasting
DCW '02 Revised Papers from the 4th International Workshop on Distributed Communities on the Web
Distributed Admission Control for Anycast Flows with QoS Requirements
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
IPv6 single-path and multi-path anycast routing protocols performance analysis
ISICT '03 Proceedings of the 1st international symposium on Information and communication technologies
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
A Novel Middleware Based Web Database Model
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
A hybrid method for solving ARWA problem on WDM network
Computer Communications
A scalable overlay framework for internet anycasting service
Proceedings of the 2007 ACM symposium on Applied computing
Service discovery based on anycasting in mobile ad-hoc networks
Proceedings of the 2nd international workshop on Agent-oriented software engineering challenges for ubiquitous and pervasive computing
A scheme for solving Anycast scalability in IPv6
International Journal of Network Management
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
Multi-cost job routing and scheduling in Grid networks
Future Generation Computer Systems
Online Algorithm for Application Layer Anycast
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Extension headers for IPv6 anycast
Computer Communications
A distributed k-anycast routing protocol based on mobile agents
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
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
An efficient reliable architecture for application layer anycast service
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
On anycast routing with bandwidth constraint
Computer Communications
| Hi-index | 0.00 |
An anycast packet is one that should be delivered to one member in a group of designated recipients. Using anycast services may considerably simplify some applications. Little work has been done on routing anycast packets. In this paper, we propose and analyze a routing protocol for anycast message. It is composed of two subprotocols: the routing table establishment subprotocol and the packet forwarding subprotocol. In the routing table establishment subprotocol, we propose four methods (SSP, MIN-D, SBT, and CBT) for enforcing an order among routers for the purpose of loop prevention. These methods differ from each other on information used to maintain orders, the impact on QoS, and the compatibility to the existing routing protocols. In the packet forwarding subprotocol, we propose a Weighted-Random Selection (WRS) approach for multiple path selection in order to balance network traffic. In particular, the fixed and adaptive methods are proposed to determine the weights. Both of them explicitly take into account the characteristics of distribution of anycast recipient group while the adaptive method uses the dynamic information of the anycast traffic as well. Correctness property of the protocol is formally proven. Extensive simulation is performed to evaluate our newly designed protocol. Performance data shows that the loop-prevention methods and the WRS approaches have great impact on the performance in terms of average end-to-end packet delay. In particular, the protocol using the SBT or CBT loop-prevention methods and the adaptive WRS approach performs very close to a dynamic optimal routing protocol in most cases.