Anycasting in connection-oriented computer networks: Models, algorithms and results

• Autorzy: Walkowiak K.
• Języki publikacji: EN

Abstrakty

EN

Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content Delivery Networks (CDNs), Domain Name Service (DNS), Peer-to-Peer (P2P) systems. The role of anycasting is growing concurrently with the popularity of electronic music, movies, and other content required by Internet users. In this work we focus on the optimization of anycast flows in connection-oriented networks. We formulate a model of anycast connections and next propose a heuristic algorithm based on the Lagrangean relaxation aimed to optimize jointly routes for anycast and unicast connections. Results of numerical experiments are presented and evaluated. Finally, we analyze briefly problems related to anycasting in dynamic routing and multi-layer networks.

Słowa kluczowe

EN

anycasting; connection-oriented networks; optimization; MPLS; survivability

PL

sieć połączeniowa; optymalizacja; MPLS; odporność

• Wydawca: Oficyna Wydawnicza Uniwersytetu Zielonogórskiego
• Czasopismo: International Journal of Applied Mathematics and Computer Science
• Rocznik: 2010
• Tom: Vol. 20, no 1
• Strony: 207--220
• Opis fizyczny: Bibliogr. 48 poz., rys., tab., wykr.

Twórcy

autor

Walkowiak K.

• Chair of Systems and Computer Networks Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, Poland

Bibliografia

• [1] Awerbuch, B., Brinkmann, A. and Scheideler, C. (2003). Any casting in adversarial systems: Routing and admission control, in J.C.M. Baeten, J.K. Lenstra, J. Parrow and G.J. Woeginger (Eds), Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 2719, Springer-Verlag, Berlin, pp. 1153-1168.
• [2] Baentsch, M., Baum, L., Molter, G., Rothkugel, S. and Sturm, P. (1997). World wide web caching: The application level view of the internet, IEEE Communications Magazine 35(6): 170-178.
• [3] Bagula, B., Botha, M. and Krzesinski, A. (2004). Online traffic engineering: The least interference optimization algorithm, Proceedings of the IEEE International Conference on Communications, ICC 2004, Paris, France, pp. 1232-1236.
• [4] Ballani, H. and Francis, P. (2005). Towards a global IP anycast service, Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, ACM SIGCOMM 2004, Philadelphia, PA, USA, pp. 301-312.
• [5] Burns, J., Ott, T., Krzesinski, A. and Muller, K. (2003). Path selection and bandwidth allocation in MPLS networks, Performance Evaluation 52(2): 133-152.
• [6] Byun, S. and Yoo, C. (2008). Minimum DVS gateway deployment in DVS-based overlay streaming, Computer Communications 31(3): 537-550.
• [7] Doi, S., Ata, S., Kitamura, K. and Murata, M. (2004). IPv6 anycast for simple and effective service-oriented communications, IEEE Communications Magazine 42(5): 166-171.
• [8] Fratta, L., Gerla, M. and Kleinrock, L. (1973). The flow deviation method: An approach to store-and-forward communication network design, Networks 3(2): 97-133.
• [9] Gavish, B. and Huntler, S. (1983). An algorithm for optimal route selection in SNA networks, IEEE Transactions on Communications 31(10): 1154-1160.
• [10] Grover, W. (2004). Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking, Prentice-Hall PTR, Upper Saddle River, NJ.
• [11] Guha, S., Meyerson, A. and Munagala, K. (2001). Improved approximation algorithms for fault tolerant facility location, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2001, Washington, DC, USA, pp. 636-641.
• [12] Hao, F., Zegura, E. and Ammar, M. (2002). QoS routing for anycast communications: Motivation and an architecture for DiffServ networks, IEEE Communications Magazine 40(6): 48-56.
• [13] Herzberg, M., Bye, S. and A.Utano (1995). The hoplimit approach for spare-capacity assignment in survivable networks, IEEE/ACM Transactions on Networking 3(6): 775-784.
• [14] Hofmann, M. and Beaumont, L. (2005). Content Networking: Architecture, Protocols, and Practice, Morgan Kaufmann, San Francisco, CA.
• [15] Holmberg, K. (1995). Lagrangean heuristics for linear cost multicommodity network flow problems, Technical Report LiTH-MAT-OPT/WP-1995-01, Department of Mathematics, Linköping Institute of Technology, Linköping.
• [16] Holmberg, K. and Yuan, D. (1998). A Lagrangean approach to network design problems, International Transactions in Operational Research 5(6): 529-539.
• [17] Holmberg, K. and Yuan, D. (2000). A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem, Operations Research 48(3): 461-481.
• [18] Hou, Y., Yi, S. and Sherali, H. (2006). Optimal base station selection for anycast routing in wireless sensor networks, IEEE Transactions on Vehicular Technology 55(3): 813-821.
• [19] Hyytia, E. (2004). Heuristic algorithms for the generalized routing and wavelength assignment problem, Proceedings of the 17th Nordic Teletraffic Seminar, NTS-17, Fornebu, Norway, pp. 373-386.
• [20] Jain, K., Mahdin, M. and Saberi, A. (2002). A new greedy approach for facility location problems, Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC 2002, Montreal, Canada, pp. 731-740.
• [21] Kar, K., Kodialam, M. and Lakshman, T. (2000). Minimum interference routing of bandwidth guaranteed tunnels with mpls traffic engineering applications, IEEE Journal on Selected Areas in Communications 18(12): 2566-2579.
• [22] Kasprzak, A. (2001). Designing of Wide Area Networks, Wrocław University of Technology Press, Wrocław.
• [23] Kleinrock, L. (1964). Communication Nets: Stochastic Message Flow and Delay, McGraw-Hill, New York, NY.
• [24] Krishnan, P., Raz, D. and Shavitt, Y. (2000). The cache location problem, IEEE/ACM Transactions on Networking 8(5): 568-582.
• [25] Leuf, B. (2002). Peer to Peer: Collaboration and Sharing over the Internet, Addison Wesley, Boston, MA.
• [26] Li, B., Golin, M., B., Italiano, Deng, X. and Sohraby, K. (1999). On the optimal placement of web proxies in the internet, Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 1999, New York, NY, USA, pp. 1282-1290.
• [27] Markowski, M. and Kasprzak, A. (2005). An approximate algorithm for web replica allocation and topology assignment problem in WAN, Proceedings of the 17th IMACS World Congress, Paris, France.
• [28] Murakami, K. and Kim, H. (1996). Virtual path routing for survivable ATM networks, IEEE/ACM Transactions on Networking 4(2): 22-39.
• [29] Paxson, V. (2006). End-to-end routing behavior in the Internet, SIGCOMM Computer Communication Review 36(5): 41-46.
• [30] Peng, G. (2004). CDN: Content distribution network, Technical Report cs-NI-0411069, Computing Research Repository, http://arxiv.org/abs/cs.NI/0411069.
• [31] Perros, H. (2005). Connection-oriented Networks, SONET/SDH, ATM, MPLS and Optical Networks, John Wiley and Sons, Ltd, Chichester.
• [32] Piro,M. and Medhi, D. (2004). Routing, Flow, and Capacity Design in Communication and Computer Networks, Morgan Kaufman Publishers, San Francisco, CA.
• [33] Qiu, L., Padmanabhan, V. and Voelker, G. (2001). On the placement of web server replicas, Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2001, Anchorage, AK, USA, pp. 1587-1596.
• [34] Rabinovich, M. (1998). Issues in web content replication, Data Engineering Bulletin 24(4): 21-29.
• [35] Rexford, J., Wang, J., Xiao, Z. and Hang, Y. (2002). BGP routing stability of popular destinations, Proceedings of the 2nd ACM SIGCOMM Workshop on Internet Measurement, Marseille, France, pp. 197-202.
• [36] Rosen, E., Viswanathan, A. and Callon, R. (2001). Multiprotocol label switching architecture, Technical Report RFC 3031, Internet Engineering Task Force, http://www.ietf.org/.
• [37] Ryba, P. and Kasprzak, A. (2006). The gateways location and capacity assignment problem in hierarchical WANs: An approximate algorithm and computational results, Proceedings of the 18th European Meetings on Cybernetics and Systems Research, Vienna, Austria, pp. 46-51.
• [38] Steinmetz, R. and Wehrle, K. (2005). Peer-to-Peer Systems and Applications, Lecture Notes in Computer Science, Vol. 3485, Springer-Verlag, Berlin.
• [39] Szeto, W., Boutaba, R. and Iraqi, Y. (2002). Dynamic online routing algorithm for MPLS traffic engineering, in E. Gregori, M. Conti, A.T. Cambell, G. Omidyar and M. Zukerman, Networking 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications, Lecture Notes in Computer Science, Vol. 2345, Springer-Verlag, Berlin, pp. 936-946.
• [40] Tang, M., Jia, W., Wang, H. and Wang, J. (2003). Routing and wavelength assignment for anycast inWDMnetworks, Proceedings of the 3rd International Conference on Wireless and Optical Communication WOC, Banff, Canada, pp. 301-306.
• [41] Walkowiak, K. (2004). A new method of primary routes selection for local restoration, in N. Mitrou, K. Kontovasilis, G. Rouskas, I. Iliadis and L. Merakos, (Eds), Networking 2004: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications, Lecture Notes in Computer Science, Vol. 3042, Springer-Verlag, Berlin, pp. 1024-1035.
• [42] Walkowiak, K. (2005). QoS dynamic routing in content delivery network, in R. Boutaba, K. Almeroth, R. Puigjaner, S. Shen and J.P. Black (Eds), Networking 2005: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems, Lecture Notes in Computer Science, Vol. 3462, Springer-Verlag, Berlin, pp. 1120-1132.
• [43] Walkowiak, K. (2006). A new function for optimization of working paths in survivable MPLS networks, in A. Levi, E. Savas, H. Yenign, S. Balcisoy and Y. Saygin (Eds), Computer and Information Sciences-ISCIS 2006, Lecture Notes in Computer Science, Vol. 4263, Springer-Verlag, Berlin, pp. 424-433.
• [44] Walkowiak, K. (2007a). Anycast communication-A new approach to survivability of connection-oriented networks, in V. Gorodetsky, I. Kotenko and V. Skormin (Eds), Computer Network Security, Communications in Computer and Information Science, Vol. 4236, Springer-Verlag, Berlin, pp. 378-389.
• [45] Walkowiak, K. (2007b). Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks, Computational Optimization and Applications 40(2): 119-141.
• [46] Walkowiak, K. (2007c). Survivable routing of unicast and anycast flows in MPLS networks, Proceedings of the 3rd EURO-NGI Conference on Next Generation Internet Networks, Trondheim, Norway, pp. 72-79.
• [47] , K. (2008). A flow deviation algorithm for joint optimization of unicast and anycast flows in connection oriented networks, in O. Gervasi, B. Murgante, A. Laganà, D. Taniar, Y. Mun and M. Gavrilova, Computational Science and Its Applications-ICCSA 2008, Lecture Notes in Computer Science, Vol. 5073, Springer-Verlag, Berlin, pp. 797-807.
• [48] Woźniak, M., Kurzyński, M. and Puchała, E. (1999). Intelligent internet databases for family doctor practise, Medical and Biological Engineering and Computing 37(2): 1410-1411.