Abstract
Our discussion in this article centers on a new optimization problem called unsplittable anycast flow problem (UAFP). We are given a directed network with arc capacities and a set of anycast requests. 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. In the context of unsplittable flows, anycast request consists of two connections: upstream (from the client to the server) and the downstream (in the opposite direction). The objective of UAFP is to find a subset of the requests of maximum total demand for which upstream and downstream connection uses only one path and the capacity constraint is satisfied. To our best survey, this is the first study that addresses the UFP (unsplittable flow problem) in the context of anycast flows. After formulation of UAFP, we propose several heuristics to solve that problem. Next, we present results of simulation evaluation of these algorithms.
Chapter PDF
References
Crawley, E., Nair, R., Jajagopalan, B., Sandick, H.: A Framework for QoS-based Routing in the Internet. RFC2386 (1998)
Grover, W.: Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice Hall PTR, Upper Saddle River (2004)
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)
Kasprzak, A.: Designing of Wide Area Networks. Wroclaw Univ. of Tech. Press (2001)
Kleinberg, J.: Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge (1996)
Kodialam, M., Lakshman, T.: Minimum Interference Routing with Applications to MPLS Traffic Engineering. In: Proceedings of INFOCOM, pp. 884–893 (2000)
Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: Proc. of the Symposium on Discrete Algorithms, pp. 184–193 (2002)
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.L., 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. Technical Report (2003), sunysb.edu/tr/rpe13.ps.gz
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. (eds.) ICCS 2005. LNCS, vol. 3516, pp. 1092–1095. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walkowiak, K. (2006). Unsplittable Anycast Flow Problem: Formulation and Algorithms. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758501_83
Download citation
DOI: https://doi.org/10.1007/11758501_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34379-0
Online ISBN: 978-3-540-34380-6
eBook Packages: Computer ScienceComputer Science (R0)