Compact node-link formulations for the optimal single path MPLS Fast Reroute layout

• Autorzy: Żukowski C. , Tomaszewski A. , Pióro M. , Hock D. , Hartmann M. , Menth M.
• Języki publikacji: EN

Abstrakty

EN

This paper discusses compact node-link formulations for MPLS fast reroute optimal single path layout. We propose mathematical formulations for MPLS fast reroute local protection echanisms. In fact, we compare one-to-one (also called detour) local protection and many-to-one (also called facility backup) local protection mechanisms with respect to minimized maximum link utilization. The optimal results provided by the node-links are compared with the suboptimal results provided by algorithms based on non-compact linear programming (path generation) approach and IP-based approach.

Słowa kluczowe

EN

MPLS; Compact node-link formulations

• Wydawca: Publishing House of Poznan University of Technology
• Czasopismo: Advances in Electronics and Telecommunications
• Rocznik: 2011
• Tom: Vol. 2, no. 3
• Strony: 55--60
• Opis fizyczny: Bibliogr. 8 poz., rys.

Twórcy

autor

Żukowski C.

• Institute of Telecommunications, Warsaw University of Technology, 00-665 Warsaw, Poland

autor

Tomaszewski A.

• Institute of Telecommunications, Warsaw University of Technology, 00-665 Warsaw, Poland

autor

Pióro M.

• Institute of Telecommunications, Warsaw University of Technology, 00-665 Warsaw, Poland
• Department of Electrical and Information Technology, Lund University, 221-00 Lund, Sweden

autor

Hock D.

• Institute of Computer Science, University of Würzburg, D-97074 Würzburg, Germany

autor

Hartmann M.

• Institute of Computer Science, University of Würzburg, D-97074 Würzburg, Germany

autor

Menth M.

• Computer Science, University of Tübingen, D-72076 Tübingen, Germany

Bibliografia

• [1] M. Pióro, A. Tomaszewski, C. Żukowski, D. Hock, M. Hartmann, and M. Menth, “Optimized IP-Based vs. Explicit Paths for One-to-One Backup in MPLS Fast Reroute,” in 14th International Telecommunications Network Strategy and Planning Symposium, Warsaw, Poland, Sep. 2010.
• [2] R. Martin, M. Menth, and K. Canbolat, “Capacity Requirements for the Facility Backup Option in MPLS Fast Reroute,” in IEEE Workshop on High Performance Switching and Routing (HPSR), Poznan, Poland, Jun. 2006, pp. 329 – 338.
• [3] A. Raj and O. C. Ibe, “A survey of ip and multiprotocol label switching fast reroute schemes,” Comput. Netw., vol. 51, pp. 1882–1907, June 2007.
• [4] D. Hock, M. Hartmann, M. Menth, and C. Schwartz, “Optimizing Unique Shortest Paths for Resilient Routing and Fast Reroute in IP-Based Networks,” Osaka, Japan, Apr. 2010.
• [5] R. Martin, M. Menth, and K. Canbolat, “Capacity Requirements for the One-to-One Backup Option in MPLS Fast Reroute,” in IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS), San Jose, CA, USA, Oct. 2006.
• [6] S. Orlowski and M. Pióro, “On the complexity of column generation in survivable network design with path-based survivability mechanisms,” in International Network Optimization Conference (INOC), 2009.
• [7] M. Pióro, Á. Szentesi, J. Harmatos, A. Jüttner, P. Gajowniczek, and S. Kozdrowski, “On Open Shortest Path First Related Network Optimisation Problems,” Performance Evaluation, vol. 48, pp. 201 – 223, 2002.
• [8] M. Pióro and D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman, 2004.