The hop-limit approach for spare-capacity assignment in survivable networks
IEEE/ACM Transactions on Networking (TON)
Virtual path routing for survivable ATM networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Improved algorithms for fault tolerant facility location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Peer to Peer: Collaboration and Sharing over the Internet
Peer to Peer: Collaboration and Sharing over the Internet
BGP routing stability of popular destinations
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Dynamic Online Routing Algorithm for MPLS Traffic Engineering
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Path selection and bandwidth allocation in MPLS networks
Performance Evaluation - Special issue: Internet performance and control of network systems
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
Connection-oriented Networks: SONET/SDH, ATM, MPLS and Optical Networks
Connection-oriented Networks: SONET/SDH, ATM, MPLS and Optical Networks
Towards a global IP anycast service
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Peer-to-Peer Systems and Applications (Lecture Notes in Computer Science)
Peer-to-Peer Systems and Applications (Lecture Notes in Computer Science)
End-to-end routing behavior in the internet
ACM SIGCOMM Computer Communication Review
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Content Networking: Architecture, Protocols, and Practice (The Morgan Kaufmann Series in Networking)
Content Networking: Architecture, Protocols, and Practice (The Morgan Kaufmann Series in Networking)
Minimum DVS gateway deployment in DVS-based overlay streaming
Computer Communications
Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks
Computational Optimization and Applications
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Anycasting in adversarial systems: routing and admission control
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A new function for optimization of working paths in survivable MPLS networks
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
QoS dynamic routing in content delivery networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
World Wide Web caching: the application-level view of the Internet
IEEE Communications Magazine
QoS routing for anycast communications: motivation and an architecture for DiffServ networks
IEEE Communications Magazine
IPv6 anycast for simple and effective service-oriented communications
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
A survey of multiple classifier systems as hybrid systems
Information Fusion
Hi-index | 0.00 |
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.