LSP and back up path setup in MPLS networks based on path criticality index

IEEE International Conference on Communications

Volumn , Issue , 2007, Pages 441-448

  Tizghadam, Ali ^a   Leon Garcia, Alberto ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Flow assignment; Graph theory; MPLS; Quality of Service (QoS); Routing; Traffic engineering

Indexed keywords

GRAPH THEORY; INDEXING (OF INFORMATION); INTERNET PROTOCOLS; QUALITY OF SERVICE; ROUTING PROTOCOLS;

FLOW ASSIGNMENT; MULTI PROTOCOL LABEL SWITCHING (MPLS); TRAFFIC ENGINEERING;

SWITCHING NETWORKS;

EID: 38549127084     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2007.79     Document Type: Conference Paper

References (12)

1. K. Kar, M. Kodialam, and T. V. Lakshman, "Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications," IEEE Journal on Selected Areas in Communications, Vol. 18, No. 12, Dec. 2000, pp. 2566-2579.
2. D. O. Awduche, L. Berger, D. Gan, T. Li, G. Swallow, and V. Srinivasan, "Extensions to RSVP for LSP tunnels," Internet Draft drafietf-mpls-rsvp-lsp-tunnel-04.txt, Sep. 1999.
3. S. Suri, M. Waldvogel, and P. R. Warkhede, "Profile-Based Routing: A New Framework for MPLS Traffic Engineering," In Quality of Future Internet Services, Lecture Notes in Computer Science 2156, Springle Verlag, Sep. 2001.
4. L. C. Freeman, "Centrality in Networks: I. Conceptual Clarification," Social Netwoks, No. 1, 1978/79, pp. 215-239.
5. S. P. Borgatti, "Centrality and Network Flow," Social Networks, Vol. 27, No. 1, 2005, pp. 55-71.
6. J. L. Sobrino, "An Algebraic Theory of Dynamic Network Routing," in IEEE/ACM Transactions on Networks, Vol. 13, No. 5, October 2005, pp. 1160-1173
7. nd Global Internet Miniconference, Nov. 1997.
8. S. Yilmaz, I Matta, "On the Scalability-Performance Tradeoffs in MPLS and IP Routing," Proceedings of SPIE ITCOM May 2002.
9. T. Ott, T. Bogovic, T. Carpenter, K. R. Krishnan, and D. Shallcross, "Algorithms for Flow Allocation for Multi Protocol Label Switching," MPLS International Conference, Oct. 2000.
10. th Australasian Computer Science Conference, Vol. 26, Jan 2004, pp. 359-368.
11. D. Eppstein, "Finding the k Shortest Paths," Society for Industrial and Applied Mathematics (SIAM) Journal of Computing, Vol. 28, No. 2, 1998, pp. 652-673.
12. R. K. Ahuja, T. L. Magnanti, J. B. Orlin "Network Flows: Theory, Algorithms, and Applications", Prentice Hall, 1993.