Advertisement

Anycast Communication—A New Approach to Survivability of Connection-Oriented Networks

  • Krzysztof Walkowiak
Part of the Communications in Computer and Information Science book series (CCIS, volume 1)

Abstract

In this paper, we tackle the question of how anycast communication can improve survivability of connection-oriented networks. The focus on network survivability arises naturally in the context of growing role of computer networks in almost all aspects of human life. We concentrate on connection-oriented networks e.g. MPLS, ATM for the reason that these techniques can provide effective and reliable services in transport network. We take a detailed view on anycast communication from the perspective of network survivability. A new optimization problem is formulated that is equivalent to the problem of joint unicast and anycast flows restoration in connection-oriented networks. Next, we propose a heuristic algorithm solving that problem. Finally, we present results of exhaustive numerical experiments and a comprehensive discussion on the application of anycast communication in the context of network survivability.

Keywords

survivability connection-oriented network anycast 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    Ballani, H., Francis, P.: Towards a Global IP Anycast Service. In: Proc. of SIGCOMM’05, Philadelphia, pp. 301–312 (2005)Google Scholar
  3. 3.
    Crawley, E., Nair, R., Jajagopalan, B., Sandick, H.: A Framework for QoS-based Routing in the Internet. RFC2386 (1998)Google Scholar
  4. 4.
    Grover, W.: Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice Hall PTR, Upper Saddle River, New Jersey (2004)Google Scholar
  5. 5.
    Doi, S., Ata, S., Kitamura, K., Murata, M.: IPv6 anycast for simple and effective service-oriented communications. IEEE Communication Magazine 5, 163–171 (2004)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Kasprzak, A.: Designing of Wide Area Networks. Wroclaw Univ. of Tech. Press (2001)Google Scholar
  9. 9.
    Kleinberg, J.: Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge (1996)Google Scholar
  10. 10.
    Kodialam, M., Lakshman, T.: Minimum Interference Routing with Applications to MPLS Traffic Engineering. In: Proc. of INFOCOM, pp. 884–893 (2000)Google Scholar
  11. 11.
    Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: Proc. of the Symposium on Discrete Algorithms, pp. 184–193 (2002)Google Scholar
  12. 12.
    Lin, C., Lo, J., Kuo, S.: Load-Balanced Anycast Routing. In: Proc, of the Parallel and Distributed Systems, Tenth international Conference on (Icpads’04), Washington (2004)Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Peng, G.: CDN: Content Distribution Network. Technical Report (2003) sunysb.edu/tr/rpel3.ps.gzGoogle Scholar
  15. 15.
    Pióro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman Publishers, San Francisco (2004)zbMATHGoogle Scholar
  16. 16.
    Walkowiak, K.: Designing of survivable web caching. In: Proc. of 8th Polish Teletraffic Symposium, pp. 171–181 (2001)Google Scholar
  17. 17.
    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)CrossRefGoogle Scholar
  18. 18.
    Walkowiak, K.: Unsplittable Anycast Flow Problem Formulation and Algorithms. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J (eds.) ICCS 2006. LNCS, vol. 3991, pp. 626–633. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  19. 19.
    Walkowiak, K.: A New Function for Optimization of Working Paths in Survivable MPLS Networks. In: Levi, A., Savas, E., Yenigün, H., Balcisoy, S., Saygin, Y (eds.) ISCIS 2006. LNCS, vol. 4263, pp. 424–433. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  20. 20.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Krzysztof Walkowiak
    • 1
  1. 1.Chair of Systems and Computer Networks, Faculty of ElectronicsWroclaw University of TechnologyWroclawPoland

Personalised recommendations