Abstract
Using IP anycast, connectionless services such as DNS can be decentralized to cope with high service request rates. Unfortunately, most Internet services cannot take direct advantage of anycast addressing because they rely on stateful communications. Subsequent packets of the same session may be routed to a different anycast group member, resulting in a broken service. Therefore, we introduce a transparent layer-3 architecture that provides anycast support for stateful services.
Taking into account user demands, available resources, extra network overhead and anycast infrastructure costs, we address optimal proxy router placement and infrastructure dimensioning, an issue that has not been tackled before for similar architectures. Simulation results indicate that even modest overlay infrastructures, consisting of a small number of proxy routers, often result in an effective stateful anycast solution where the detour via the proxy routers is negligible.
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
Partridge, C., Mendez, T., Milliken, W.: RFC 1546: Host Anycasting Service (1993)
Sarat, S., Pappas, V., Terzis, A.: On the Use of Anycast in DNS. SIGMETRICS Performance Evaluation Review 33(1), 394–395 (2005)
Zegura, E., Ammar, M., Fei, Z., Bhattacharjee, S.: Application-Layer Anycasting: A Server Selection Architecture and Use in a Replicated Web Service. IEEE/ACM Transactions on Networking 8(4), 455–466 (2000)
Katabi, D., Wroclawski, J.: A Framework for Scalable Global IP-Anycast (GIA). ACM SIGCOMM Computer Communication Review 30(4), 3–15 (2000)
Ballani, H., Francis, P.: Towards a Global IP Anycast Service. ACM SIGCOMM Computer Communication Review 35(4), 301–312 (2005)
Freedman, M., Lakshminarayanan, K., Mazières, D.: OASIS: Anycast for Any Service. In: Proceedings of the 3rd Symposium on Networked Systems Design and Implementation (NSDI 2006), San Jose, California, United States (2006)
Barabási, A.-L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (1999)
Bollobás, B.: Random Graphs. Academic Press, London (1985)
Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley-Interscience, New York (1988)
Khumawala, B.M.: An Efficient Branch and Bound Algorithm for the Warehouse Location Problem. Management Science 18(12), B718–B731 (1972)
ILOG CPLEX (2006), http://www.ilog.com/products/cplex/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stevens, T., De Turck, F., Dhoedt, B., Demeester, P. (2008). Achieving Network Efficient Stateful Anycast Communications. In: Vazão, T., Freire, M.M., Chong, I. (eds) Information Networking. Towards Ubiquitous Networking and Services. ICOIN 2007. Lecture Notes in Computer Science, vol 5200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89524-4_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-89524-4_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89523-7
Online ISBN: 978-3-540-89524-4
eBook Packages: Computer ScienceComputer Science (R0)