K-penalty: A novel approach to find -Disjoint paths with differentiated path costs

IEEE Communications Letters

Volumn 14, Issue 4, 2010, Pages 354-356

  Rak, Jacek ^a  

^a GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

End to end protection; Multi cost networks; Multiple failures; Survivable routing; Trap problem; WDM networks

Indexed keywords

END-TO-END PROTECTION; MULTIPLE FAILURES; SURVIVABLE ROUTING; TRAP PROBLEM; WDM NETWORKS;

ALGORITHMS; CAVITY RESONATORS; WAVELENGTH DIVISION MULTIPLEXING;

COSTS;

EID: 77950639748     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2010.04.091597     Document Type: Article

References (9)

1. A. Somani, Survivability and Traffic Grooming in WDM Optical Networks. Cambridge University Press, 2006.
2. M. Pióro and D. Medhi, Routing, Flow and Capacity Design in Communication and Computer Networks. Morgan Kaufmann, 2004.
3. A. Sen, B. Hao, B. Shen, and S. Bandyopadhyay, "Survivability of lightwave networks-path lengths in path protection scheme," J. High Speed Networks, vol.10, no.4, pp. 303-315, 2001.
4. D. Xu, et al., "On the complexity of and algorithms for finding the shortest path with a disjoint counterpart," IEEE/ACM Trans. Networking, vol.14, no.1, pp. 147-158, 2006.
5. J. W. Suurballe, "Disjoint paths in a network," Networks, vol.4, no.2, pp. 125-145, 1974.
6. R. Bhandari, Survivable Networks: Algorithms for Diverse Routing. Kluwer Academic Publishers, 1999.
7. J. Tapolcai, et al., "A new shared segment protection method for survivable networks with guaranteed recovery time," IEEE Trans. Reliability, vol.57, no.2, pp. 272-282, 2008.
8. J. Rak, "Algorithms of fast service restoration in survivable multilayer networks," Ph.D. dissertation, Gdansk Univ. of Technology, Poland, 2009.
9. P Laborczi, et al., "Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks," in Proc. DRCN, pp. 220-227, 2001.