Fast reroute with pre-established bypass tunnel in MPLS

Computer Communications

Volumn 31, Issue 9, 2008, Pages 1660-1671

  Lai, Wei Kuang ^a   Zheng, Zhen Chang ^a   Tsai, Chen Da ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

LSR; MPLS; QoS

Indexed keywords

BANDWIDTH; QUALITY OF SERVICE; ROUTERS; TELECOMMUNICATION NETWORKS; THEOREM PROVING;

LABEL SWITCHED PATH (LSP); LABEL SWITCHING ROUTER (LSR); MAX-FLOW MIN-CUT THEOREM;

COMPUTER NETWORKS;

EID: 43449112365     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2007.11.008     Document Type: Article

References (28)

1. E. Rosen, A. Viswanathan, R. Callon, Multiprotocol Label Switching Architecture, RFC3031, January 2001.
2. F. Le Faucheur, IETF Multiprotocol Label Switching (MPLS) Architecture, 1st IEEE International Conference on ATM, 1998, pp. 6-15
3. V. Ed. Sharma, F. Ed Hellstrand, Framework for Multi-Protocol Label Switching (MPLS)-based Recovery, RFC 3649, 2003.
4. Huang C.C., Sharma V., Owens K., and Makam S. Building reliable MPLS networks using a path protection mechanism. IEEE Communications Magazine 40 3 (2002)
5. Yang G.L.Y., and Lin X. Performance evaluation of K shortest path algorithms in MPLS traffic engineering. IEICE Transactions on Communications E87-B 4 (2004) 1007-1011
6. S.H. Shin, H.J. Shin, Y.T. Kim, Packet lossless fast rerouting scheme with minimized buffer delay, Network Operations and Management Symposium, 2004. NOMS 2004. IEEE/IFIP, vol. 1, April 2004, pp. 19-23.
7. Karasan E., and Yetginer E. Robust path design algorithms for traffic engineering with restoration in MPLS networks. IEICE Transactions on Communications E86-B 5 (2003) 1632-1640
8. P. Pan, D.H. Gan, George Swallow, Alia Atlas Fast Reroute Extensions to RSVP-TE for LSP, RFC 4090, May 2005.
9. P.H. Ho, H.T. Mouftah, Capacity-balanced alternate routing for MPLS traffic engineering, Seventh International Symposium on Computers and Communications, 2002, pp. 927-932.
10. Bartos R., and Raman M. A heuristic approach to service restoration in MPLS networks. IEEE International Conference on Communications 1 (2001) 117-121
11. M. Amin, K.H. Ho, G. Pavlou, M. Howarth, Improving survivability through traffic engineering in MPLS networks, 10th IEEE Symposium on Computers and Communications, ISCC 2005, 27-30 June 2005, pp. 758-763.
12. M. Kodialam, T.V. Lakshman, Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information, Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, 2001.
13. Li L., Buddhikot M.M., Chekuri C., and Guo K. Routing bandwidth guaranteed paths with local restoration in label switched networks. IEEE Journal on Selected Areas in Communications 23 2 (2005) 437-449
14. S. Yoon, H. Lee, D. Choi, Y. Kim, G. Lee, M. Lee, An efficient recovery mechanism for MPLS-based protection LSP, Joint 4th IEEE International Conference on ATM and High Speed Intelligent Internet Symposium, 2001, pp. 75-79.
15. Luisa Jorge, Teresa Gomes, Survey of Recovery Scheme in MPLS Networks, 2006 International Conference on Dependability of Computer systems, May 2006, pp. 110-118.
16. Sohn K.-S., Nam S.Y., and Sung D.K. A distributed LSP scheme to reduce spare bandwidth demand in MPLS network. IEEE Transactions on Communications 54 7 (2006) 1277-1288
17. Alicherry M., and Bhatia R. Simple pre-provisioning scheme to enable fast restoration. IEEE/ACM Transactions on Networking 15 2 (2007) 400-412
18. L. Hundessa, J.D. Pascual, Reliable and fast rerouting mechanism for a protected label switched path, Global Telecommunications Conference, 2002. GLOBECOM'02. IEEE, vol.2 (17-21), November 2002, pp. 1608-1612.
19. Hundessa L., and Pascual J.D. Fast rerouting mechanism for protected label switched path. Tenth International Conference on IEEE Computer Communications and Networks (2001) 527-530
20. S.K. Das, P. Venkataram, A method of Designing a path restoration scheme for MPLS based network, 5th IEEE International Conference on High Speed Networks and Multimedia Communications, 2002, pp. 218-222.
21. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows, Theory, algorithm, and applications (1993), Prentice Hall
22. Suurballe J.W., and Tarjan R.E. A quick method for finding shortest pairs of disjoint paths. Networks 14 (1984) 325-336
23. G. Ahn, W. Chun, Simulator for MPLS path restoration and performance evaluation, Joint 4th IEEE International Conference on ATM and High Speed Intelligent Internet System Symposium, 2001, pp. 32-36.
24. G. Ahn, W. Chun, Design and implementation of MPLS network simulator (MNS) supporting QoS, 15th International Conference on Information Networking, 2001 Proceedings, 2001, pp. 694-699.
25. Matsuura H., Imanaka H., and Takami K. A hierarchically distributed network management system for multi-layered IP/photonic GMPLS networks. IEICE Transactions on Communications E87-B 7 (2004) 1844-1853
26. Kodialam M., and Lakshman T.V. Minimum interference routing with applications to MPLS traffic engineering. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies 2 (2000) 884-893
27. Kar K., Kodialam M., and Lakshman T.V. Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications. IEEE Journal on Selected Areas in Communications 18 12 (2000) 2566-2579
28. Sangkyu Park, Yetik Serbest, San-qi Li, Minimum congestion traffic engineering with multi-resource constraint, Computer Communications and Networks, 2001 Proceedings, Tenth International Conference on, October 2001, pp. 130-137.