<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>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 <italic>one-to-one-of-many</italic> 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.</p></abstract>

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.

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

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

International Journal of Applied Mathematics and Computer Science

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...

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

Published Online: Mar 25, 2010

Page range: 207 - 220

DOI: https://doi.org/10.2478/v10006-010-0015-5

Keywords
anycasting, connection-oriented networks, optimization, MPLS, survivability

This content is open access.

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

Published Online: Mar 25, 2010

Page range: 207 - 220

DOI: https://doi.org/10.2478/v10006-010-0015-5

Keywordsanycasting, connection-oriented networks, optimization, MPLS, survivability

This content is open access.

Keywords
anycasting, connection-oriented networks, optimization, MPLS, survivability