Addressing network survivability issues by finding the K-best paths through a trellis graph
Authors:
- S.D. NikolopoulosSNS.D. Nikolopoulos
- A. PitsillidesAPA. Pitsillides
- D. TipperDTD. Tipper
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 370-377
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Optimal diverse routing in telecommunication fiber networks2002
- Span-disjoint paths for physical diversity in networks2002
- PARALLEL BLOCK-FINDING USING DISTANCE MATRICESParallel Algorithms and Applications, 1996
- Comparison of k-shortest paths and maximum flow routing for network facility restorationIEEE Journal on Selected Areas in Communications, 1994
- Efficient algorithms for finding the K best paths through a trellisIEEE Transactions on Aerospace and Electronic Systems, 1990
- Finding the best set of K paths through a trellis with application to multitarget trackingIEEE Transactions on Aerospace and Electronic Systems, 1989
- A quick method for finding shortest pairs of disjoint pathsNetworks, 1984
- Disjoint paths in a networkNetworks, 1974
- GRAPH THEORY1969
- Applied Dynamic Programming1962