A unified approach to survivability of connection-oriented networks

Authors:
Krzysztof Walkowiak
Affiliations:
Chair of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wroclaw, Poland
Venue:
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Year:
2005

Citing 5
Cited 2

On the use and performance of content distribution networks

IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
The web replica allocation and topology assignment problem in wide area networks: algorithms and computational results

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
QoS routing for anycast communications: motivation and an architecture for DiffServ networks

IEEE Communications Magazine
A survey of anycast in IPv6 networks

IEEE Communications Magazine

A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks

ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Branch-and-bound algorithm for anycast flow assignment in connection-oriented networks

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with problems of computer networks survivability. We present and discuss survivability aspects of Content Delivery Networks (CDNs) and other services based on the anycast paradigm. After that, we propose a new unified approach to network survivability. This approach assumes using jointly survivability mechanisms for both kinds of traffic: anycast (one-to-one-of-many access to content servers) and unicast (one-to-one exchanging of data between individual users). We formulate a new optimization model for this scenario that can be used for development of algorithms. The optimization problem is NP-complete. The objective function is function of lost flow due to a failure of any single link. To our knowledge this problem have not received much attention in the literature. We provide also a numerical example to illustrate the proposed approach.