Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

ASTAS: Architecture for Scalable and Transparent Anycast Services

  • Stevens, Tim (Department of Information Technology, Ghent University) ;
  • De Leenheer, Marc (Department of Information Technology, Ghent University) ;
  • Develder, Chris (Department of Information Technology, Ghent University) ;
  • De Turck, Filip (Department of Information Technology, Ghent University) ;
  • Dhoedt, Bart (Department of Information Technology, Ghent University) ;
  • Demeester, Piet (Department of Information Technology, Ghent University)
  • Published : 2007.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

Native information provider(IP) anycast suffers from routing scalability issues and the lack of stateful communication support. For this reason, we propose architecture for scalable and transparent anycast services(ASTAS), a proxy-based architecture that provides support for stateful anycast communications, while retaining the transparency offered by native anycast. Dynamic resource assignment for each initiated session guarantees that a connection is established with the most suitable target server, based on network and server conditions. Traffic engineering in the overlay can be realized in an effective way due to the dissemination of aggregated state information in the anycast overlay. To minimize the total deployment cost for ASTAS architectures, we propose optimized proxy placement and path finding heuristics based on look-ahead information gathered in network nodes. Contrary to a regular integer linear program(ILP) formulation, these heuristics allow to optimize proxy placement in large networks. A use case on a European reference network illustrates that lower proxy costs enable proxy deployment closer to the end-users, resulting in a reduced network load.

Keywords

References

  1. C. Partridge, T. Mendez, and W. Milliken, 'RFC 1546: Host Anycasting Service,' Nov. 1993
  2. S. Sarat, V. Pappas, and A. Terzis, 'On the use of anycast in DNS,' SIG-METRICS Performance Evaluation Review, vol. 33, no. 1, pp. 394-395, June 2005 https://doi.org/10.1145/1071690.1064271
  3. D. Katabi and J. Wroclawski, 'A framework for scalable global IPAnycast (GIA),' ACM SIGCOMM Computer Commun. Review, vol. 30, no. 4, pp. 3-15, Oct. 2000 https://doi.org/10.1145/347057.347388
  4. H. Ballani and P. Francis, 'Towards a global IP anycast service,' ACM SIGCOMM Computer Commun. Review, vol. 35, no. 4, pp. 301-312, Oct. 2005 https://doi.org/10.1145/1090191.1080127
  5. E. Zegura, M. Ammar, Z. Fei, and S. Bhattacharjee, 'Application-layer anycasting: A server selection architecture and use in a replicated web service,' IEEE/ACM Trans. Network., vol. 8, no. 4, pp. 455-466, Aug. 2000 https://doi.org/10.1109/90.865074
  6. I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana, 'Internet indirection infrastructure,' IEEE/ACM Trans. Network., vol. 12, no. 2, pp. 205-218, Apr. 2004 https://doi.org/10.1109/TNET.2004.826279
  7. P. Gray, 'Exact solution of the fixed-charge transportation problem,' Operations Research, vol. 19, no. 6, pp. 1529-1538, Oct. 1971 https://doi.org/10.1287/opre.19.6.1529
  8. D. Kim and P. Pardalos, 'A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure,' Operations Research Lett., vol. 24, no. 4, pp. 195-203, May 1999 https://doi.org/10.1016/S0167-6377(99)00004-8
  9. W. Feng, F. Chang, W. Feng, and J. Walpole, 'A traffic characterization of popular on-line games,' IEEE/ACM Trans. Network., vol. 13, no. 3, pp. 488-500, June 2005 https://doi.org/10.1109/TNET.2005.850221
  10. T. Stevens, F. De Turck, B. Dhoedt, and P. Demeester, 'Achieving network efficient stateful anycast communications,' in Proc. ICOIN 2007, Estoril, Portugal, Jan. 2007
  11. G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization, New York, United States: Wiley-Interscience, 1988
  12. D. Kim, X. Pan, and P. Pardalos, 'An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems,' Computational Economics, vol. 27, no. 2-3, pp. 273-293, May 2006 https://doi.org/10.1007/s10614-006-9028-4
  13. A. Barabasi and R. Albert, 'Emergence of scaling in random networks,' Science, vol. 286, pp. 509-512, Oct. 1999 https://doi.org/10.1126/science.286.5439.509
  14. R. Albert and A. Barabasi, 'Statistical mechanics of complex networks,' Reviews of Modern Phy., vol. 74, no. 1, pp. 47-97, Jan. 2002 https://doi.org/10.1103/RevModPhys.74.47
  15. S. De Maesschalck, D. Colle, I. Lievens, M. Pickavet, P. Dcmeester, C. Mauz, M. Jaeger, R. Inkret, B. Mikac, and J. Derkacz, 'Pan-European optical transport networks: An availability-based comparison,' Photonic Network Commun., vol. 5, no. 3, pp. 203-225, May 2003 https://doi.org/10.1023/A:1023088418684