Heuristic algorithm for anycast flow assignment in connection-oriented networks

Authors:
Krzysztof Walkowiak
Affiliations:
Chair of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wroclaw, Poland
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Year:
2005

Citing 4
Cited 4

Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
Anycasting in adversarial systems: routing and admission control

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
QoS dynamic routing in content delivery networks

NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
QoS routing for anycast communications: motivation and an architecture for DiffServ networks

IEEE Communications Magazine

A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks

ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Branch-and-bound algorithm for anycast flow assignment in connection-oriented networks

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Unsplittable anycast flow problem: formulation and algorithms

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Lagrangean heuristic for anycast flow assignment in connection-oriented networks

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Replication of content on geographically distributed servers can improve both performance and reliability of the Web service. Anycast is a one-to-one-of-many delivery technique that allows a client to choose a content server of a set of replicated servers. Presenting numerous mirror content servers to a client implies the difficult problem of finding the best server in terms of network performance. We formulate an optimization problem of anycast flows assignment in a connection-oriented network. This is a 0/1, NP-complete problem, which is computationally very difficult due to the size of solution space and constraints. Therefore, we propose computationally effective heuristic algorithm. To our knowledge, this is the first proposal to solve the problem of anycast flow assignment in connection-oriented network. Results of simulations are shown to evaluate performance of proposed algorithm for various scenarios.