An exact optimum paths-finding algorithm for α+1 path protection

International Conference on Information Networking

Volumn , Issue , 2012, Pages 210-215

  Liew, Soung Yue ^a   Gan, Ming Lee ^a  

^a UNIVERSITI TUNKU ABDUL RAHMAN   (Malaysia)

Author keywords

Link disjoint paths; Partial bandwidth path protection; QOS; Reliable routing

Indexed keywords

BACKUP PATH; DEDICATED PATH PROTECTION; EXHAUSTIVE SEARCH; FAST RECOVERY; K SHORTEST PATH; K-SHORTEST PATH ALGORITHMS; LINK FAILURES; LINK-DISJOINT PATHS; LOW COMPLEXITY; MISSION CRITICAL; NETWORK SERVICES; OPTIMAL PAIRS; OPTIMUM SOLUTION; PATH PROTECTION; PATH-FINDING ALGORITHMS; POLYNOMIAL-TIME; PRIMARY PATH; REAL TIME SERVICE; RELIABLE ROUTING; RESOURCE UTILIZATIONS; SECONDARY PATHS; SHARED PATH PROTECTION;

ALGORITHMS; INFORMATION SERVICES; NOISE ABATEMENT; POLYNOMIAL APPROXIMATION; QUALITY OF SERVICE;

BANDWIDTH;

EID: 84860653790     PISSN: 19767684     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICOIN.2012.6164379     Document Type: Conference Paper

References (12)

1. S. Chen and K. Nahrstedt, "An Overview of Quality of Service Routing for Next-Generation High-Speed Networks: Problems and Solutions," IEEE Network, vol. 12, no. 6, pp.64-79, November/December 1998
2. A. Haider and R. Harris, "Recovery Techniques in Next Generation Networks," IEEE Communications Surveys & Tutorials, vol. 9, no. 3, pp. 2-17, 3rd quarter 2007
3. J. Fang, M. Sivakumar, A. K. Somani and M. Sivalingam, "On Partial Protection in Groomed Optical WDM Mesh Networks," in Proc. IEEE DSN 2005, Yokohama, Japan, pp. 228-237, June 2005.
4. M.L. Gan and S. Y. Liew, "An Optimum Paths-Finding Algorithm for α+1 Paths Protection," Ultra Modern Telecommunications and Control Systems and Workshops, Moscow, Russia, pp. 531-537, December 2010
5. P. Laborczi, et al., "Algorithms for Asymmetrically Weighted Pair of Disjoint Paths in Survivable Networks," in Proc. DRCN 2001, Budapest. pp.220-227
6. B. Yang, S. Q. Zheng and E. Lu, "Finding Two Disjoint Paths in a Network with Normalized α+ Min Sum Objective Function," Lecture Notes in Computer Science, vol. 3827, pp. 954-963, 2005.
7. P.H. Ho and H.T. Mouftah, "Issues onDiverse Routing for WDM Mesh Network with Survivability," in Proc. Computer Communications and Networks 2001, pp. 61-66, 2001.
8. T. Gomes, J. Craveirinha and L. Jorge, "An Effective Algorithm for Obtaining the Minimal Cost Pair of Disjoint Paths with Dual Arc," Computers & Operations Research, vol. 36, no. 5, pp. 1670-1682, April 2008.
9. R. Bhandari, Survivable Networks: Algorithms for Diverse Routing. Massachusetts: Kluwer Academic Publishers, 1999
10. J.W. Suurballe and R.E. Tarjan, "A Quick Method for Finding Shortest Pairs of Disjoint Paths," Networks, vol. 14, no. 2, pp. 325-336, 1984.
11. J.Y. Yen, "Finding the K Shortest Loopless Paths In A Network," Management Science, vol. 17, no. 11, pp. 712-716, July 1971
12. E. Martins and M. Pascoal, "A New Implementation of Yen's Ranking Loopless Paths Algorithm," 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, vol. 1, no. 2, pp. 121-133, June 2003