Lagrangean heuristic 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'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Year:
2006

Citing 5
Cited 2

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
Heuristic algorithm for anycast flow assignment in connection-oriented networks

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
The web replica allocation and topology assignment problem in wide area networks: algorithms and computational results

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we address the problem of anycast flow assignment. 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. We formulate an optimization problem of anycast flows assignment in a connection-oriented network, which is 0/1 and NP-complete. Thus, we propose a new effective heuristic algorithm based on Lagrangean relaxation technique. To our best survey, this is the first study that applies the Lagrangean relaxation to anycast flow problem. We evaluate the performance of the proposed scheme by making a comparison with its counterpart using a sample network topology and different scenarios of traffic demand patterns and replica location. Obtained results show advantage of the Lagrangean heuristic over a previously proposed algorithm.