Reliable routing with QoS guarantees for multi-domain IP/MPLS networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 1820-1828

  Sprintson, A ^a   Yannuzzi, M ^b   Orda, A ^c   Masip Bruin, X ^b  

^a Texas A and M University

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED OPTIMIZATION; INTERNET PROTOCOLS; INTERNET SERVICE PROVIDERS; ROUTING ALGORITHMS; TELECOMMUNICATION NETWORKS;

MULTI-DOMAIN IP/MPLS NETWORKS; MULTIPLE DOMAINS; PATH COMPUTATION ELEMENT (PCE);

QUALITY OF SERVICE;

EID: 34548297849     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.212     Document Type: Conference Paper

References (14)

1. http://www.ietf.org/html.charters/pce-charter.html.
2. A. Parrel, J. P. Vasseur, and J. Ash. A Path Computation Element (PCE)Based Architecture. IETF RFC 4655, August 2006.
3. A. Farrel, A. Satyanarayana, A. Iwata, N. Fujita, and G. Ash. Crankback Signaling Extensions for MPLS and GMPLS RSVP-TE (draft-ietf-ccamp-crankback-05. txt). Internet Draft, work in progress, May 2005.
4. F. Ricciato, U. Monaco, and D. Ali. Distributed Schemes for Diverse Path Computation in Multi-domain MPLS Networks. IEEE Communications Magazine, Feature Topic on Challenges in Enabling Inter-Provider Service Quality on the Internet, 43(6):138-146, June 2005.
5. Y. R. Yang, H. Xie, H. Wang, A. Silberschatz, A. Krishnamurthy, and L. E. Li. On Route Selection for Interdomain Traffic Engineering. IEEE Network, 19(6):20-27, November-December 2005.
6. J. Suurballe. Disjoint Paths in a Network. Networks, 4:125-145, 1974.
7. S. Uludag, K.S. Lui, K. Nahrstedt, and G. Brewster. Comparative Analysis of Topology Aggregation Techniques and Approaches for the Scalability of QoS Routing. In Technical Report TR05-010, DePaul University, Chicago, USA, May 2005.
8. M. Yannuzzi, X. Masip-Bruin, S. Sanchez-Lopez, J. Domingo-Pascual, A. Orda, and A. Sprintson. On the Challenges of Establishing Disjoint QoS IP/MPLS Paths across Multiple Domains. IEEE Communications Magazine, 44(12):60-66, December 2006.
9. M. Yannuzzi, X. Masip-Bruin, and O. Bonaventure. Open Issues in Interdomain Routing: A Survey. IEEE Network, 19(6):49-56, November-December 2005.
10. C. L. Li, T. McCormick, and D. Simchi-Levi. The Complexity of Finding Two Disjoint Paths with Min-Max Objective Function. Discrete Applied Mathematics, 26:105-115, 1990.
11. J. Suurballe and R. Tarjan. A Quick Method for Finding Shortest Pairs of Disjoint Paths. Networks, 14:325-336, 1984.
12. C. Pelsser and O. Bonaventure. Path Selection Techniques to Establish Constrained Interdomain MPLS LSPs. In Proceedings of IFIP Networking'06, Coimbra, Portugal, May 2006.
13. R. Bhandari. Survivable Networks: Algorithms for Diverse Routing. Kluwer Academic Publishers, Norwell, MA, USA, 1999.
14. http://www.cidr-report.org/.