Sciweavers

Share
INFOCOM
1997
IEEE

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

9 years 2 months ago
Addressing Network Survivability Issues by Finding the K-Best Paths through a Trellis Graph
Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (suchas voice, data, and video)across high speed communication networks, it is becoming importantfor a network to offer survivability, or at least graceful degradation, in the event of networkfailure. In thispaper 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 efSicient methods to find disjoint paths. Use of the knowledge of the K-best disjointpathsfor improving the survivability of ATM networks at the virtual path and virtual circuit level is discussed.
Stavros D. Nikolopoulos, Andreas Pitsillides, Davi
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1997
Where INFOCOM
Authors Stavros D. Nikolopoulos, Andreas Pitsillides, David Tipper
Comments (0)
books