Advertisement

Achieving Network Efficient Stateful Anycast Communications

  • Tim Stevens
  • Filip De Turck
  • Bart Dhoedt
  • Piet Demeester
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5200)

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.

Keywords

anycast architecture proxy router service dimensioning 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Partridge, C., Mendez, T., Milliken, W.: RFC 1546: Host Anycasting Service (1993)Google Scholar
  2. 2.
    Sarat, S., Pappas, V., Terzis, A.: On the Use of Anycast in DNS. SIGMETRICS Performance Evaluation Review 33(1), 394–395 (2005)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Katabi, D., Wroclawski, J.: A Framework for Scalable Global IP-Anycast (GIA). ACM SIGCOMM Computer Communication Review 30(4), 3–15 (2000)CrossRefGoogle Scholar
  5. 5.
    Ballani, H., Francis, P.: Towards a Global IP Anycast Service. ACM SIGCOMM Computer Communication Review 35(4), 301–312 (2005)CrossRefGoogle Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Barabási, A.-L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Bollobás, B.: Random Graphs. Academic Press, London (1985)zbMATHGoogle Scholar
  9. 9.
    Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley-Interscience, New York (1988)CrossRefzbMATHGoogle Scholar
  10. 10.
    Khumawala, B.M.: An Efficient Branch and Bound Algorithm for the Warehouse Location Problem. Management Science 18(12), B718–B731 (1972)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Tim Stevens
    • 1
  • Filip De Turck
    • 1
  • Bart Dhoedt
    • 1
  • Piet Demeester
    • 1
  1. 1.Ghent UniversityDepartment of Information Technology (INTEC)GentBelgium

Personalised recommendations