Decentralized local backup LSP calculation with efficient bandwidth sharing

10th International Conference on Telecommunications, ICT 2003

Volumn 2, Issue , 2003, Pages 929-937

  Mélon, Laurent ^a   Blanchy, Fraçois ^a   Leduc, Guy ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

Backup LSP; Fast recovery; MPLS; Resource sharing

Indexed keywords

ALGORITHMS; BANDWIDTH; NETWORKS (CIRCUITS); RECOVERY; RESTORATION;

BACKUP LSP; FAST RECOVERY; LABEL SWITCHED PATHS; MPLS; MULTI PROTOCOL LABEL SWITCHING; PATH SELECTION ALGORITHMS; RESOURCE RESERVATIONS; RESOURCE SHARING;

QUALITY OF SERVICE;

EID: 24944568512     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTEL.2003.1191564     Document Type: Conference Paper

References (14)

1. Eric C. Rosen, Arun Viswanathan, and Ross Callon. Multiprotocol label switching architecture, rfc3031. www.ietf.org.January 2001.
2. Guangzhi Li, Dongmei Wang. Charles Kalmanek, and Robert Doverspike. Efficient distributed path selection for shared restoration connections. In Proceeding of IEEE INFOCOM 2002, volume 1, 2002.
3. D. Awduche and al. Applicability Statement for extensions to RSVP for LSP-tunnels, rfc3210. December 2001.
4. B. Jamoussi and al. Constraint-based LSP setup using LDP, rfc3212, January 2002.
5. Vishal Sharma, Ben-Mack Crane, Srinivas Makam, Ken Owens, Changcheng Huang, Fiffi Hellstrand, Jon Weil, Loa Anderson, Bilel Jamoussi, Brad Cain, Seyhan Civanlar, and Angela Chiu. Framework for MPLS-based recovery, draft-ietf-mpls-recovery-frmwrk-06.txt. Internet-Draft, July 2002.
6. Koushik Kar, Murali Kodialam, and T.V. Lakshman. Routing restorable bandwidth guaranteed connections using maximum 2-route flows. In Proceeding of IEEE INFOCOM 2002, volume 1, 2002.
7. Murali Kodialam and T.V. Lakshman. Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information. In Proceeding of IEEE INFOCOM 2001, volume 1, 2001.
8. F. Blanchy, L. Mélon, and G. Leduc. An efficient decentralized on-line traffic engineering algorithm for MPLS networks. Submitted paper available on http://www.run.montefiore.ulg.ac.be/∼blanchy, July 2002.
9. Murali S. Kodialam and T. V. Lakshman. Minimum interference routing with applications to MPLS traffic engineering. In INFOCOM (2), pages 884-893, 2000.
10. Richard Rabbat, Kenneth P. Laberteaux, Nirav Modi, and John Kenny. Traffic engineering algorithms using MPLS far service differentiation. In ICC (2), pages 791-795, 2000.
11. F. Le Faucheur and al. Multi-protocol label switching (MPLS) support of differentiated services, rfc3270. www.ietf.org, May 2002.
12. Dijkstra E. W. A note on two problems in connection with graphs. Numerische Mathematik, 1959.
13. Yu Liu, David Tipper, and Peerapon Siripongwutikorn. Approximating optimal spare capacity allocation by successive survivable routing. In Proceeding of IEEE INFOCOM 2001, pages 699-708. Anchorage, AL, April 24-28 2001.
14. Yu Liu and David Tipper. Spare capacity allocation for non-linear cost and failure-dependent path restoration. In Proceeding of the Third International Workshop on Design of Reliable Communication Networks, DRCN 2001, Budapest, Hungary, October 7-10 2001.