Network virtualization and traffic engineering in Software-Defined Networks
[ANGLÈS]Lately, the emerging paradigm of Software-Defined Networking has grown in presence and claims to simplify future networking. The decoupling of network control and forwarding plane proposed by this architecture allows the control of the entire network behavior by means of a logically centrali...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis de maestría |
| Fecha de publicación: | 2014 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2099.1/21361 |
| Acceso en línea: | https://hdl.handle.net/2099.1/21361 |
| Access Level: | acceso abierto |
| Palabra clave: | Software defined network Broadband communication systems Routers (Computer networks) SDN Openflow Optimization Traffic engineering Paths algebra Virtual networks Embedding Comunicacions mòbils, Sistemes de Network Function Virtualization Software-Defined Networking Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Radiocomunicació i exploració electromagnètica::Comunicacions mòbils |
| Sumario: | [ANGLÈS]Lately, the emerging paradigm of Software-Defined Networking has grown in presence and claims to simplify future networking. The decoupling of network control and forwarding plane proposed by this architecture allows the control of the entire network behavior by means of a logically centralized software program (controller). Such separation of planes opens the way to Network Virtualization, which provides users a logical abstraction of underlying network resources. However, network virtualization requires a mapping phase of the virtual resources over the physical resources, which is not trivial, formally known as the virtual network embedding problem. The present document focuses in the development of a variant of one of the proposed strategies to solve this critical step, prioritizing the real-time response. The proposed algorithm uses the properties offered by the Paths Algebra mathematical framework to provide a flexible environment where it is possible to combine any number of both linear and non-linear metrics. In addition, it is also used the multi-lexical ordination, a criterion to better distinguish paths that may be considered equal by other approaches. Such algorithm has been implemented as a software application that provides a simulation environment where the virtual network embedding process can be tested for any given topology. Subsequently, all the algorithm features have been checked in a set of performance tests, focusing on those oriented to the commitment among the real-time response and the quality of the embedding solutions. In general, testing results are very promising even in densely populated backbone topologies, where the number of alternative paths among each possible pair of origin and destination nodes grows exponentially. |
|---|