Addressing Network Survivability Issues by Finding the K-best Paths through a Trellis Graph

Authors:
Stavros D. Nikolopoulos;Andreas Pitsillides;David Tipper
Affiliations:
-;-;-
Venue:
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Year:
1997

Citing 1
Cited 11

Span-disjoint paths for physical diversity in networks

ISCC '95 Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95)

A connection-oriented network architecture with guaranteed QoS for future real-time applications over the internet

Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
A Network Architecture with High Availability for Real-time Premium Traffic over the Internet

Journal of Network and Systems Management
A connection-oriented network architecture with guaranteed QoS for future real-time applications over the Internet

Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
Minimum-cost multiple paths subject to minimum link and node sharing in a network

IEEE/ACM Transactions on Networking (TON)
Finding paths with minimum shared edges

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A survivability model for cluster system

ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
A survivability model for cluster system under dos attacks

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Implementation of virtual path hopping (VPH) as a solution for control plane failures in connection oriented networks and an analysis of traffic distribution of VPH

QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Trellis-Based virtual regular addressing structures in self-organized 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
A model of ITS using cold standby cluster

ICADL'05 Proceedings of the 8th international conference on Asian Digital Libraries: implementing strategies and sharing experiences
Finding paths with minimum shared edges

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (such as voice, data, and video) across high speed communication networks, it is becoming important for a network to offer survivability, or at least graceful degradation, in the event of network failure. In this paper we aim to offer a solution in the selection of the K-best disjoint paths through a network by using graph theoretic techniques. The basic approach is to map an arbitrary network graph into a trellis graph which allows the application of computationally efficient methods to find disjoint paths. Use of the knowledge of the K-best disjoint paths for improving the survivability of ATM networks at the virtual path and virtual circuit level is discussed.