Branch-and-bound 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:
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Year:
2007

Citing 11
Cited 0

A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks

Computational Optimization and Applications
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
Load-Balanced Anycast Routing

ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
Towards a global IP anycast service

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
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
A unified approach to survivability of connection-oriented networks

ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Lagrangean heuristic for anycast flow assignment in connection-oriented networks

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
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
IPv6 anycast for simple and effective service-oriented communications

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our discussion in this article centers around 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 flow assignment in a connection-oriented network, which is a binary and NP-complete problem. Therefore, to enable calculation of optimal solution we propose an exact algorithm based on the branch-and-bound approach. There has not been any study we are aware of that proposes and examines the branch-and-bound algorithm for anycast flow optimization. We describe the most important elements of the branch-and-bound algorithm and present results of numerical experiments.