Routing Algorithms for Anycast Messages (original) (raw)

A routing protocol for anycast messages

IEEE Transactions on Parallel and Distributed Systems, 2000

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 sub-protocols: the routing table establishment sub-protocol and the packet forwarding sub-protocol. In the routing table establishment sub-protocol, we propose four methods (SSP, MIND , 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 proved. Extensive simulation is performed to evaluate our newly designed protocol. Performance data show 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.

Integrated routing algorithms for anycast messages

IEEE Communications Magazine, 2000

In this paper, we study integrated routing algorithms for anycast messages in packet switching networks. Integrated approach makes use of single path routing and multi-path routing. The former is simple and easy to implement and the later splits traffic into several different paths and may potentially reduce congestion, improving delay and throughput performance. However, a multi-path routing router requires additional storage in order to maintain muti-path information. In the case that the memory size of a router is limited, using multi-path routing may result in longer delay at the router due to the time taken to (re)establish entries in routing table. To take advantages of both the approaches and to overcome their shortcomings, we adaptively select a suh-set of routers in the network to carry out multi-path routing. The rest of routers do single path routing. We demonstrate that our integrated routing algorithms perform substantially better than the systems where either single path routing approach or multi-path approach is used alone.

An efficient anycast routing protocol based on multi-metrics

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings., 2004

Anycast communication becomes popular recently as it can be used to provide effective routing to server members in a replicated server group that is represented by an anycast address. This paper proposes a novel anycast routing protocol called Anycast Routing protocol based on Multi-Metrics (ARMM). ARMM protocol sets up the routing by taking hop number, data transmission delay, residual bandwidth, and server load as the server and path selection criteria. ARMM differs from other approaches as it uses values of bandwidth and delay on the direction from servers (anycast members) to clients, rather than the normal direction from clients to servers. So ARMM can select the best server/path with sufficient network resource (say bandwidth etc) for server data transmission to clients. Simulation results demonstrated that our protocol performs better than those protocols using conventional client to server routing approach in case that the servers may require to transmit a large volume of flows to the clients.

Integrated routing protocol for multicast and anycast messages

International Conference on Parallel Processing, 2001., 2001

A novel eficient and dynamic integrated routing protocol for multicast and anycast messages is presented. The contributions of the protocol differ from well-known shared-tree systems in two aspects: (1) Off-tree anycast configuration and routing: multicast sources use anycast routing to select a better path from the source to one router in the group in order to avoid congestion or any fault in the network. (2) On-tree router anycast configurations: The nodes in the shared-tree are formed into a virtual anycast group. The shared-tree approach is extended with capability of a group cores (anycast group). The simulation data demonstrates the eficiency of the protocol.

Load-balanced anycast routing in computer networks

Proceedings ISCC 2000. Fifth IEEE Symposium on Computers and Communications, 2000

We present a practical approach to routing and anycasting with near-optimum delays taking into account the processing loads at routers and processing elements of a computer network. To accomplish this, the minimum-delay routing problem formulated by Gallager is generalized into the problem of minimum-delay routing with load-balancing to account for processing delays in network nodes (servers and routers). Gallager's theorem for necessary and sufficient conditions for minimum-delay routing is modified to include processing delays and changes of traffic levels at network nodes. The first distributed algorithm for load balanced anycasting and routing in computer networks is presented. This algorithm, named MIDAS, provides approximate solutions to the modified necessary and sufficient conditions for minimum-delay routing. Simulations are use to compare the performance of the new algorithm with the performance of a traditional approach to sever load balancing.

Effective real-time anycast flow connection algorithm and delay analysis

2003 International Conference on Parallel Processing, 2003. Proceedings., 2003

Define anycast services as a group of replicated servers that may provide similar or identical services. Using anycast services can significantly simplify some applications such as to seek appropriate servers to provide quality of service and to achieve the load balance and fault-tolerance for service availability. An anycast flow is a sequence of packet that can be established between a user and any server in an anycast (replicated) service group. This paper studies a set of efficient distributed connection setup algorithms for real-time anycast flows. Given an anycast flow between a server j and a request node s with end-to-end deadline D s,j and minimum bandwidth requirement B s,j , our algorithms can effectively seek multiple destination connections in parallel thus the best path which satisfies the requirements of the anycast flow is chosen. The deterministic approach for worst delay bound analysis is also given.

Multi-shared-trees based multicast routing control protocol using anycast selection

International Journal of Parallel, Emergent and Distributed Systems, 2005

A novel internet multicast routing protocol is presented to possess efficiency and effectiveness for multicast packet routing with short delay, high throughput, resource utilization and scalability for a single multicast group g. The protocol has two features: (1) Multiple Shared-Trees (MST) are configured to provide efficient, dynamic and quality multicast routing; (2) Anycasting approach is applied by forming the tree roots into an anycast group so that the multicast packets can be anycast to the nearest node at one of the shared trees to achieve the best routing service for the packets. The performance of the MST protocol is analyzed through extensive simulations and compared with well-known source tree and shared-tree routing.

Joint Optimization of Application Specific Routing in an Anycast Network

ArXiv, 2018

Recent developments in the field of Networking have provided opportunities for networks to efficiently cater application specific needs of a user. In this context, a routing path is not only dependent upon the network states but also is calculated in the best interest of an application using the network. These advanced routing algorithms can exploit application state data to enhance advanced network services such as anycast, edge cloud computing and cyber physical systems (CPS). In this work, we aim to design such a routing algorithm where the router decisions are based upon convex optimization techniques.