Sdn-based wan optimization: pce implementation in multi-domain mpls networks supported by bgp-ls

• Autorzy: Rzym G. , Wajda K. , Chołda P.
• Języki publikacji: EN

Abstrakty

EN

In order to pro vide efficient and flexible resource management and path set-up in high-speed MPLS/GMPLS networks, the PCE (Path Computation Element) architecture was proposed by IETF. Implementation of a central module for the path set-up enables network operators to run path establishment operations for applications with explicitly defined objective functions and QoS requirements. The paper reports on recent research and experimental investigations with PCE-based path computation performed according to the 3-layered traffic engineering(TE)system consisting of: (1) a PCE module equipped with the IBM Cplex LP solver used in the highest layer 3, and (2) a SDN controller in the intermediate layer 2 responsible for transferring path set up request stowards virtual routers In the lowest layer 1. The presented results show usefulness of the PCE-supporting architecture with an SDN controller and applicability of bandwidth-oriented optimization based on real-time focused constraints (path delay limits). We emphasise that even a simple optimization approach shows the power provided by the SDN, i.e., flexibility of flows. This property is in practice not feasible In classical IP o rMPLS networks,that is the usage of flow-based routing provided by network programmability really opens opportunities in network tuning.

Słowa kluczowe

EN

Border Gateway Protocol Link State; Label Switching Path (LSP); multi-protocol label switching (MPLS); multi-domain traffic optimization; Path Computation Element (PCE)

• Wydawca: Instytut Telekomunikacji i Informatyki Uniwersytetu Technologiczno-Przyrodniczego w Bydgoszczy
• Czasopismo: Image Processing & Communications
• Rocznik: 2017
• Tom: Vol. 22, no. 1
• Strony: 35--47
• Opis fizyczny: Bibliogr. 18 poz., rys.

Twórcy

autor

Rzym G.

• AGH University of Science and Technology, Department of Telecommunications, Al. Mickiewicza 30, 30-059 Kraków, Poland

autor

Wajda K.

• AGH University of Science and Technology, Department of Telecommunications, Al. Mickiewicza 30, 30-059 Kraków, Poland

autor

Chołda P.

• AGH University of Science and Technology, Department of Telecommunications, Al. Mickiewicza 30, 30-059 Kraków, Poland

Bibliografia

• [1] Cui L., Kumara S., AlbertR. (2010). Complex Networks: An Engineering View. In IEEE Circuits and Systems Magazine, 10(3):10–25.
• [2] Farrel A., Vasseur J.P., Ash J. (2006). A Path Computation Element (PCE)-Based Architecture. RFC4655.
• [3] Fonoberova M., Lozovanu D.D.(2005).Algorithms for Finding Optimal Flows in Dynamic Networks. In Computer Science Journal of Moldova, Institute of Mathematics and Computer Science.
• [4] Fortz B., Thorup M. (2000). Internet Traffic Engineering by Optimizing OSPF Weights. In Proceedings IEEE INFOCOM, Tel Aviv. pp. 519-528, vol. 2.
• [5] Fortz B., Thorup M. (2002, May). Optimizing OSPF/IS-IS Weights In a Changing World. In IEEE Journal on Selected Areas in Communications. 20(4):756–767.
• [6] Gredler H., Medved J., Previdi S., Farrel A., Ray S. (2016).North-Bound Distribution of Link-State and Traffic Engineering (TE) Information Using BGP. RFC7752.
• [7] King D., Farrel A. (2012). The Application of the Path Computation Element Architecture to the Determination of a Sequence o fDomainsin MPLS and GMPLS. RFC6805.
• [8] MedvedJ.,VargaR.,MineiI.,CrabbeE.(2016,December). PCEP Extensions for Stateful PCE. IETF draft.
• [9] PaolucciF., CuginiF., GiorgettiA., SamboN., Castoldi P. (2013). A Survey on the Path Computation Element (PCE) Architecture. In IEEE Communications Surveys and Tutorials, 5(1):2–13.
• [10] Pioro M., Medhi D. (2004). Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
• [11] Le Roux J.L., Vasseur J.P., Lee Y. (2009). Path Computation Element (PCE) Communication Protocol (PCEP). RFC5440.
• [12] Le Roux J.L., Vasseur J.P. (2009). Encoding of Objective Functions in the Path Computation Element Communication Protocol (PCEP). RFC5541.
• [13] Varga R., Minei I., Sivabalan S., Varga R. (2017, January). PCEP Extensions for PCE-initiated LSP Setup in a Stateful PCE Model. IETF draft.
• [14] Vasseur J.P., Zhang R., Bitar N., Le Roux J.L. (2009). A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths. RFC5441.
• [15] Xia W., Wen Y., Foh C.H., Niyato D., Xie H. (2015). Survey on Software-Defined Networking. In IEEE Communications Surveys and Tutorials, 17(1).
• [16] Open Networking Foundation: Software-Defined Networking: The New Norm for Networks. ONF White Paper, 2012.
• [17] http://www.cisco.com/en/US/docs/ios_xr_sw/ios_xrv/install_config/b_xrvr_432_chapter_ 01.html (2017, February).
• [18] https://wiki.opendaylight.org/view/BGP_LS_ PCEP:Lithium_Operations_Guide#Creating_LSP (2017, February).

Uwagi

PL

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).