Skip to content

Search results

56 items matching your search terms. . Sort by relevance · date (newest first) · alphabetically
Filter the results.
A Distributed Algorithm for Topology Discovery in Software-Defined Networks
Authors: L. Ochoa-Aday, C. Cervelló-Pastor, A. Fernández-Fernández. Title: “A Distributed Algorithm for Topology Discovery in Software-Defined Networks,” BookTitle: Trends in Practical Applications of Scalable Multi-Agent Systems, the PAAMS Collection, vol. 473 of the series Advances in Intelligent Systems and Computing, Springer International Publishing, ISBN 978-3-319-40159-1, pp. 363-367, June 2016.
Located in Publications / Journals & Books
General Project Objectives
Located in Objectives
A proposal for a SDN-based SIEPON achitecture
Authors: Hamzeh Khalili , Sebastià Sallent , Jose Ramon Piney , David Rincón “A proposal for an SDN-based SIEPON architecture,” Optics Communications, vol. 403, pp. 9-21, 2017. Impact Factor JCR (2016): 1.588, Q3
Located in Publications / Journals & Books
Objective 3: Implementation of the software agent to virtualize the OLT operation by the SDN controller
Located in Objectives
eSDNProject.png
Located in About
UPCSIMBOLpositiup3005interiorblanc.png
Located in Partners
ICTON 2015
Title: Modelling the NFV forwarding graph for an optimal network service deployment Authors: Jordi Ferrer Riera, Xavier Hesselbach, Mateusz Zotkiewicz, Maciej Szostak and Juan-Felipe Botero ABSTRACT The NFV is focused at virtualizing network functions such as gateways, path computing devices, resource allocation mechanisms, proxies, firewalls and transcoders, traditionally carried out by specialized hardware devices, and migrating these functions to software-based appliances. In this paper, an analytic model for the NFV forwarding graph is proposed with the aim to optimize the execution time of the network services deployed.
Located in Publications / Conferences & Workshops
Jitel 2015
Title: Multi constraint network virtualization strategy based on Paths Algebra for non-linear parameters Authors: Xavier Hesselbach, José-Roberto Amazonas, Alejandro Gutiérrez-Anato Abstract- One of the main challenges in network virtualization is the virtual network embedding problem (VNE). The objective of the VNE is to map a set of Virtual Network Requests (VNR) to physical nodes and links. VNR is composed by a set of virtual nodes and links with several demands (traditionally CPU and bandwidth) to be assigned into a set of paths in the substrate network with sufficient resources. Embedding can be optimized with regard to specific metrics. To help solving the VNE problem a mathematical tool has been proposed, called Paths Algebra, to deal with the VNE multi-constraint problem using linear metrics. Most of the existing VNE proposals treat the single-path virtual link-mapping problem as a mono-constraint. This paper studies, analyses and validates the mathematical framework of Path Algebra under selected linear (CPU, bandwidth and energy consumption) and non-linear metrics (availability and packet loss ratio), providing promising performance results.
Located in Publications / Conferences & Workshops
Alejandro Gutierrez Master MINT Thesis
Author: Alejandro Gutierrez Anato Tutor: Xavier Hesselbach Title: Network Virtualization strategy based on Paths Algebra to implement the concept of Infrastructure as a Service. Presented: December 2014.
Located in Publications / Master's Thesis & Bachelor's Degree Final Projects
Santiago Villanueva PFC
Author: Santiago Villanueva Puig Tutor: Xavier Hesselbach Title: Contribution to the Virtual Network Embedding problem using a new Paths Algebra strategy.
Located in Publications / Master's Thesis & Bachelor's Degree Final Projects