Branch-and-Bound Algorithm for Anycast Flow Assignment in Connection-Oriented Networks

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.

[1]  Jack Dongarra,et al.  Computational Science - ICCS 2005, 5th International Conference, Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part I , 2005, International Conference on Computational Science.

[2]  Sy-Yen Kuo,et al.  Load-balanced anycast routing , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

[3]  Krzysztof Walkowiak,et al.  Unsplittable Anycast Flow Problem: Formulation and Algorithms , 2006, International Conference on Computational Science.

[4]  Christian Scheideler,et al.  Anycasting in Adversarial Systems: Routing and Admission Control , 2003, ICALP.

[5]  Krzysztof Walkowiak.  A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks , 2004, Comput. Optim. Appl..

[6]  Stephen Gilmore,et al.  Combining Measurement and Stochastic Modelling to Enhance Scheduling Decisions for a Parallel Mean Value Analysis Algorithm , 2006, International Conference on Computational Science.

[7]  Masayuki Murata,et al.  IPv6 anycast for simple and effective service-oriented communications , 2004, IEEE Communications Magazine.

[8]  Gang Peng,et al.  CDN: Content Distribution Network , 2004, ArXiv.

[9]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[10]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[11]  Hanif D. Sherali,et al.  Optimal base station selection for anycast routing in wireless sensor networks , 2006, IEEE Transactions on Vehicular Technology.

[12]  K. Walkowiak.  Survivable Routing of Unicast and Anycast Flows in MPLS Networks , 2007, 2007 Next Generation Internet Networks.

[13]  Krzysztof Walkowiak,et al.  A Unified Approach to Survivability of Connection-Oriented Networks , 2005, ISCIS.

[14]  Krzysztof Walkowiak.  Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks , 2005, International Conference on Computational Science.

[15]  Paul Francis,et al.  Towards a global IP anycast service , 2005, SIGCOMM '05.

[16]  Mostafa Ammar,et al.  QoS routing for anycast communications: motivation and an architecture for DiffServ networks , 2002, IEEE Commun. Mag..

[17]  Marcin Markowski,et al.  The Web Replica Allocation and Topology Assignment Problem in Wide Area Networks: Algorithms and Computational Results , 2005, ICCSA.

[18]  David Taniar,et al.  Computational Science and Its Applications - ICCSA 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part I , 2005, ICCSA.

[19]  Krzysztof Walkowiak.  Lagrangean Heuristic for Anycast Flow Assignment in Connection-Oriented Networks , 2006, International Conference on Computational Science.

[20]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[21]  Pinar Yolum,et al.  Computer and Information Sciences - ISCIS 2005, 20th International Symposium, Istanbul, Turkey, October 26-28, 2005, Proceedings , 2005, ISCIS.