On anycast routing with bandwidth constraint

Authors:
Chor Ping Low;Choon Leng Tan
Affiliations:
School of Electrical and Electronic Engineering, Nanyang Technological University, Blk S2, Nanyang Avenue, Singapore, Singapore 639798;School of Electrical and Electronic Engineering, Nanyang Technological University, Blk S2, Nanyang Avenue, Singapore, Singapore 639798
Venue:
Computer Communications
Year:
2003

Citing 6
Cited 2

Route selection with multiple metrics

Information Processing Letters
A Routing Protocol for Anycast Messages

IEEE Transactions on Parallel and Distributed Systems
On Finding Feasible Solutions for the Delay Constrained Group Multicast Routing Problem

IEEE Transactions on Computers
Routing Algorithms for Anycast Messages

ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Integrated routing algorithms for anycast messages

IEEE Communications Magazine
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

A hybrid method for solving ARWA problem on WDM network

Computer Communications
An anycasting protocol for anonymous access to a group of contents-equivalent servers in a distributed system

ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems

Quantified Score

Hi-index	0.24

Visualization

Abstract

Anycast refers to the transmission of data from a source node to (any) one member in a group of designated recipients in a network. In this paper, we study the problem of finding a set of low cost paths for anycast routing with bandwidth constraint. The anycast routing problem (ARP) in this case involves the construction of a set of low-cost paths with bandwidth requirements, one for each source, for anycasting messages to one of the member in the anycast destination group. An optimal solution to ARP is a set of paths, one for each source node, that incurs the least overall cost. This problem is known to be NP-complete and hence a heuristic algorithm is proposed to find solutions for the problem. In addition, we derive a lower bound on the cost of an optimal solution for ARP by using Lagrangean Relaxation and Subgradient Optimization techniques. This lower bound is used to evaluate the performance of anycast routing algorithms in terms of their ability to find close-to-optimal solution. Simulation results show that the lower bound is tight and that our proposed algorithm is able to achieve good performance in terms of its ability of finding a set of low-cost paths for the problem.