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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Ballani, H., Francis, P.: Towards a Global IP Anycast Service. In: Proc. SIGCOMM’05, Philadelphia, pp. 301–312 (2005)
Doi, S., Ata, S., Kitamura, K., Murata, M.: IPv6 anycast for simple and effective service-oriented communications. IEEE Communication Magazine 5, 163–171 (2004)
Fratta, L., Gerla, M., Kleinrock, L.: The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design. Networks 3, 97–133 (1973)
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)
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)
Kasprzak, A.: Designing of Wide Area Networks. Wroclaw Univ. of Tech. Press (2001)
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)
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)
Peng, G.: CDN: Content Distribution Network. sunysb.edu/tr/rpe13.ps.gz (2003)
Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman Publishers, Seattle, Washington (2004)
Walkowiak, K.: A Branch-and-bound Algorithm for Primary Routes Assignment in SurvivableConnection Oriented Networks. Computational Optimization and Applications 2, 149–171 (2004)
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)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walkowiak, K. (2007). Branch-and-Bound Algorithm for Anycast Flow Assignment in Connection-Oriented Networks. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74484-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-74484-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74482-5
Online ISBN: 978-3-540-74484-9
eBook Packages: Computer ScienceComputer Science (R0)