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

  • Krzysztof Walkowiak
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4707)


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.


anycast branch-and-bound connection-oriented network 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Awerbuch, B., Brinkmann, A., Scheideler, C.: Anycasting in adversarial systems: routing and admission control. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1153–1168. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Ballani, H., Francis, P.: Towards a Global IP Anycast Service. In: Proc. SIGCOMM’05, Philadelphia, pp. 301–312 (2005)Google Scholar
  3. 3.
    Doi, S., Ata, S., Kitamura, K., Murata, M.: IPv6 anycast for simple and effective service-oriented communications. IEEE Communication Magazine 5, 163–171 (2004)Google Scholar
  4. 4.
    Fratta, L., Gerla, M., Kleinrock, L.: The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design. Networks 3, 97–133 (1973)CrossRefGoogle Scholar
  5. 5.
    Hao, F., Zegura, E., Ammar, M.: QoS routing for anycast communications: motivation and an architecture for DiffServ networks. IEEE Communication Magazine 6, 48–56 (2002)Google Scholar
  6. 6.
    Hou, Y.T., Shi, Y., Sherali, H.D.: Optimal base station selection for anycast routing in wireless sensor networks. IEEE Transactions on Vehicular Technology 3, 813–821 (2006)Google Scholar
  7. 7.
    Kasprzak, A.: Designing of Wide Area Networks. Wroclaw Univ. of Tech. Press (2001)Google Scholar
  8. 8.
    Lin, C., Lo, J., Kuo, S.: Load-Balanced Anycast Routing. In: Proc, of the Parallel and Distributed Systems. In: Tenth international Conference on (Icpads’04), Washington (2004)Google Scholar
  9. 9.
    Markowski, M., Kasprzak, A.: The web replica allocation and topology assignment problem in wide area networks: algorithms and computational results. In: Gervasi, O., Gavrilova, M., Kumar, V., Laganà, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3483, pp. 772–781. Springer, Heidelberg (2005)Google Scholar
  10. 10.
    Peng, G.: CDN: Content Distribution Network. (2003)Google Scholar
  11. 11.
    Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman Publishers, Seattle, Washington (2004)zbMATHGoogle Scholar
  12. 12.
    Walkowiak, K.: A Branch-and-bound Algorithm for Primary Routes Assignment in SurvivableConnection Oriented Networks. Computational Optimization and Applications 2, 149–171 (2004)CrossRefGoogle Scholar
  13. 13.
    Walkowiak, K.: Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2005. LNCS, vol. 3516, pp. 1092–1095. Springer, Heidelberg (2005)Google Scholar
  14. 14.
    Walkowiak, K.: A Unified Approach to Survivability of Connection-Oriented Networks. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds.) ISCIS 2005. LNCS, vol. 3733, pp. 3–12. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Walkowiak, K.: Lagrangean Heuristic for Anycast Flow Assignment in Connection-Oriented Networks. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2006. LNCS, vol. 3991, pp. 618–625. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. 16.
    Walkowiak, K.: Survivable Routing of Unicast and Anycast Flows in MPLS Networks. In: Proc. 3rd EURO-NGI Conference on Next Generation Internet Networks, pp. 72–79 (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Krzysztof Walkowiak
    • 1
  1. 1.Chair of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370 WroclawPoland

Personalised recommendations