A novel path protection scheme for MPLS networks using multi-path routing

Computer Networks

Volumn 53, Issue 9, 2009, Pages 1530-1545

  Alouneh, Sahel ^a   Agarwal, Anjali ^b   En Nouaary, Abdeslam ^c  

^a GERMAN JORDANIAN UNIVERSITY   (Jordan)

^b Gina Cody School of Engineering and Computer Science   (Canada)

^c National Institute of Posts and Telecommunications Morocco   (Morocco)

Author keywords

Failure recovery; Fault tolerance; MPLS; Packet loss; Path protection

Indexed keywords

EVOLVING NETWORKS; FAILURE RECOVERY; FAULT TOLERANCE TECHNIQUES; HIGH QUALITIES; HIGH-SPEED NETWORKINGS; INTERNET SERVICES; IP PACKETS; K-OUT-OF-N; MPLS; MPLS NETWORKS; MPLS PACKETS; MULTI-PATH ROUTING; MULTI-PROTOCOL LABEL SWITCHING; MULTIPLE PATHS; NETWORK RESOURCES; PATH PROTECTION; RECOVERY DELAYS; SHARING SCHEMES; TRAFFIC ENGINEERINGS;

CELLULAR RADIO SYSTEMS; COMPUTER SYSTEM RECOVERY; INTERNET; INTERNET PROTOCOLS; INTERNET SERVICE PROVIDERS; MULTIPATH PROPAGATION; PACKET LOSS; QUALITY ASSURANCE; QUALITY OF SERVICE; SAFETY ENGINEERING; TELECOMMUNICATION TRAFFIC;

FAULT TOLERANCE;

EID: 65249117698     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2009.02.001     Document Type: Article

References (32)

1. E. Rosen et al., Multiprotocol Label Switching Architecture, IETF, RFC 3031, 2001.
2. L. Andersson et al., LDP Specification, IETF, RFC 3036, 2001.
3. D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, G. Swallow, RSVP-TE: Extensions to RSVP for LSP Tunnels, IETF, RFC 3209, 2001.
4. Bhandari R. Survivable networks. Algorithms for Diverse Routing (1999), Kluwer Academic Publishers
5. Makam K., Huang C., and Sharma V. Building reliable MPLS networks using a path protection mechanism. IEEE Communication Magazine (2002) 156-162
6. D. Wang, G. Li, Efficient distributed solution for MPLS fast reroute, in: Proceeding of the Fourth International IFIP-TC6 Networking Conference, Waterloo, Canada, May 2005.
7. Sohn K.-S., Seung Y.N., and Sung D.K. A distributed LSP scheme to reduce spare bandwidth demand in MPLS networks. IEEE Transactions on Communications 54 7 (2006) 1277-1288
8. Doverspike R., and Wilson B. Comparison of capacity efficiency of DCS network restoration routing techniques. Journal of Network and System Management 2 2 (1994) 95-123
9. A. Autenrieh, Recovery time analysis of differentiated resilience in MPLS, in: Proceeding of DRCN/IEEE, Alberta, Canada, 2003, pp. 333-340.
10. V. Rajeev, C.R. Muthukrishnan, Reliable backup routing in fault tolerant real-time networks, in: Proceeding of the Nineth IEEE International Conference on Networks, 2001, pp. 184-189.
11. Haskin D. A method for setting an alternative label switched paths to handle fast reroute. Internet Draft (2001)
12. Li L., Buddhikot M., Chekuri C., and Guo K. Routing bandwidth guaranteed paths with local restoration in label switched networks. IEEE Journal on Selected Areas in Communications (2005) 437-449
13. Virk A., and Boutaba R. Economical protection in MPLS networks. Computer Communications 29 3 (2006) 402-408
14. Lui Y., Tipper D., and Siripongwutikorn P. Approximating optimal spare capacity allocation by successive survivable routing. IEEE/ACM Transactions on Networking 13 1 (2005)
15. Y. Seok, Y. Lee, N. Choi, Fault-tolerant multi-path traffic engineering for MPLS networks, IASTED International Conference on Communications, Internat, and Information Technology, USA, November 2003, pp. 91-101.
16. N. Maxemchuk, N. Murray, Dispersity Routing on ATM Networks, INFOCOM'93, San Francisco, USA, 1993, pp. 347-357.
17. Shamir A. How to share a secret. Communications of ACM 24 (1979)
18. Schneier B. Applied Cryptography. second ed. (1996), John Wiley and Sons (Chapters 3 and 23)
19. G.R. Blakley, Safeguarding cryptographic keys, in: Proceedings of the National Computer Conference, 1979, American Federation of Information Processing Societies 48, 1979.
20. D. Sidhu, R. Nair, S. Abdallah, Finding disjoint paths in networks, in: Proceeding ACM-SIGCOMM'91 Symposium, 1991, pp. 43-51.
21. M. Blesa, C. Blum, Ant colony optimization for the - maximum edge-disjoint paths problem, in: Raidl et al. (Ed.), 1st (EvoCOMNET'04), vol. 3005 of Lecture Notes in Computer Science, Coimbra, April 2004, pp. 160-169.
22. W. Lou, Y. Fang, A multi-path routing approach for secure data delivery, MILCOM IEEE, vol. 2, 2001, pp. 1467-1473.
23. Shiloach Y. A Polynomial Solution to the Undirected Two Paths Problem 27 3 (1980) 445-456
24. J. Park, H. Kim, H. Lim, Many-to-Many Disjoint Path Covers in a Graph with Faulty Elements, Book Chapter, Lecture Notes in Computer Science, vol. 3341, Springer, Berlin/Heidelberg, 2004, pp. 742-753.
25. Shenai R., and Sivalingam K. Hybrid survivability approaches for optical WDM mesh networks. Journal of Lightwave Technology 15 10 (2005)
26. Henning M. Graphs with large paired-domination number. Journal of Combinatorial Optimization vol. 13 (2007), Springer, Netherlands
27. Alouneh S., Agarwal A., and En-nouaary A. A novel approach for fault tolerance in MPLS networks. Innovations in Information Technology, IEEE (2006) 1-5
28. S. Bryant, G. Swallow, L. Martini, D. McPherson, Pseudowire Emulation Edge-to-Edge (PWE3) Control Word for Use over an MPLS PSN, RFC4385, IETF, February 2006.
29. M. Iwaki, K. Toraichi, R. Ishii, Fast Polynomial Interpolation for Remez exchange Method, in: IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, 1993, 411-414.
30. Alouneh S., En-nouaary A., and Agarwal A. A multiple LSPs approach to secure data in MPLS networks. Journal of Networks. 2 4 (2007) 51-58
31. Iraschko R., MacGregor M., and Grover W. Optimal capacity placement for path restoration in STM or ATM mesh survivable networks. IEEE/ACM Transactions on Networking 6 3 (1998)
32. Lei G., Jin C., Hongfang Y., and Lemin L. Path-based routing provisioning with mixed shared protection in WDM mesh networks. Journal of Lightwave Technology 24 3 (2006) 1129