Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 38
Encontrada(s) 1 página(s)

e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publication Contribución de congreso (ConferenceOutput)

Computing at the Edge: But, what Edge?

  • Contreras Murillo, Luis Miguel
  • Baliosian, Javier
  • Martínez-Julia, Pedro
  • Serrat, Serrat
This paper has been presented at 2020 IEEE/IFIP Network Operations and Management Symposium, The traditional telecommunications business is evolving towards offering a richer set of services beyond basic connectivity, leveraging on network programmability and virtualization. A versatile execution environment is required, capable of running different workloads in different locations in the network. Cloud computing is the key paradigm that allows fostering this trending change. One interesting question to solve is to what extent those computing environments have to move towards the network edge. Some services can be enabled by environments with increased capillarity, while others can be implemented in environments with more relaxed constraints (e.g., in terms of latency). This paper explores this topic by differentiating service edge from physical network edge and proposing an architecture based on the ALTO server for assisting orchestration systems in discriminating the suitable environments for each service. We present a network-flow strategy for assigning services to infrastructure elements following those precepts, together with an initial scalability evaluation of the proposed assignment solution to show its feasibility., This work has been partly funded by the European Commission through the projects NECOS (Grant Agreement No 777067) and 5G-DIVE (Grant Agreement No 859881).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publication Artículo científico (JournalArticle)

A Network Service Provider Perspective on Network Slicing

  • Contreras Murillo, Luis Miguel
  • López, Diego R.
This work has been performed in the framework of the H2020 project 5GTRANSFORMER (Grant Agreement no. 761536) and EUB project NECOS (Grant Agreement no. 777067), which are partly funded by the European Commission. This information reflects the consortia views, but neither the consortia nor the European Commission are liable for any use that may be done of the information contained therein
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Computing at the edge: but, what edge?

  • Contreras Murillo, Luis Miguel
  • Baliosian De Lazzari, Javier Ernesto
  • Martínez-Julia, Pedro
  • Serrat Fernández, Juan|||0000-0002-4551-9880
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The traditional telecommunications business is evolving towards offering a richer set of services beyond basic connectivity, leveraging on network programmability and virtualization. A versatile execution environment is required, capable of running different workloads in different locations in the network. Cloud computing is the key paradigm that allows fostering this trending change. One interesting question to solve is to what extent those computing environments have to move towards the network edge. Some services can be enabled by environments with increased capillarity, while others can be implemented in environments with more relaxed constraints (e.g., in terms of latency). This paper explores this topic by differentiating service edge from physical network edge and proposing an architecture based on the ALTO server for assisting orchestration systems in discriminating the suitable environments for each service. We present a network-flow strategy for assigning services to infrastructure elements following those precepts, together with an initial scalability evaluation of the proposed assignment solution to show its feasibility., This work has been partly funded by the European Com-mission through the projects NECOS (Grant Agreement No 777067) and 5G-DIVE (Grant Agreement No 859881)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A novel dynamic programming inspired algorithm for embedding of virtual networks in future networks

  • Kibalya, Godfrey Mirondo|||0000-0002-7053-3756
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
  • Yao, Haipeng
  • Zhang, Peiying
© <2020>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, Network virtualization is envisioned to support flexible, cost effective and on-demand deployment of multiple Virtual Networks (VNs) on a shared underlying infrastructure. A key challenge under the virtualization paradigm is how to effectively and efficiently map the divergent VNs onto the shared infrastructure characterized by exhaustible resources. Given that the future services will be characterized by heterogeneity in terms of topology and QoS requirements, existing algorithms can not be flexibly adapted to deal with such requests with differing constraints and mapping objectives. In this regard, this paper proposes a Dynamic Programming Inspired Algorithm (DyPI-Algo), a generic algorithm for mapping virtual networks on a shared infrastructure. Simulation results reveal that the proposed algorithm is able to maximize acceptance ratio and load balancing. Additionally, the algorithm is able to maximise revenue by admitting requests of large size compared to the benchmark algorithms. Moreover, the algorithm is found to be scalable in terms of time complexity when increasing the size of the substrate network and requests. In addition, the paper proposes an Adjacency List based heuristic and a Brute-force algorithm as additional benchmark algorithms. Simulation results show that the proposed algorithms result into up to more than a 10% improvement in terms of acceptance ratio compared to the state of the art algorithms in some scenarios., This work has received funding from the European Unions Horizon 2020 research and innovation programme under grant agreement No 777067 (NECOSproject).This work is also funded by the national project TEC2015-71329-C2-2-R (MINECO/FEDER), Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A multi-stage graph based algorithm for survivable Service Function Chain orchestration with backup resource sharing

  • Kibalya, Godfrey Mirondo|||0000-0002-7053-3756
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
  • Serugunda, Jonathan
  • Zhang, Peiying
Network softwarisation introduces flexibility in network management by enabling the deployment of network functions as software modules running on virtual machines. However, this creates new concerns for service availability and reliability due to multiple sources of failures at both software and hardware levels, potentially resulting in service degradations and penalties due to Service Level Agreement (SLA) violations. The survivability of critical services can best be guaranteed by pro-actively provisioning dedicated backup resources for these services, but at the cost of a high resource consumption. Aware of the divergent requirements of future services, a promising alternative is envisaged, allowing non-critical users to use the unused backup resources of high priority users. However, this approach poses a stringent challenge if a critical service disruption occurs, requiring the computation of a traffic rerouting solution for the non-critical requests when preempted from their borrowed resources. In this paper we first propose a generic multi-stage graph based algorithm as an alternative algorithm for Service Function Chain (SFC) deployments. Simulation results demonstrate that the proposed algorithm is optimized in terms of resource utilization, resulting in a 10% improvement in terms of acceptance ratio compared to a given state of the art algorithm, and within a 4% margin of the optimal solution. Based on the mentioned algorithm, we propose a new migration-aware algorithm for the mapping of non-critical services, enabling the noncritical services to borrow the unused backup resources from the critical services while minimizing the probability of preemption they could experience. The migration-aware algorithm results in more than an 8% resource saving, in most scenarios, compared to a dedicated backup strategy, and more than a 70% performance improvement in terms of the number of service preemptions, compared to a cost based algorithm. Additionally, whenever low priority users are preempted from their borrowed resources, we propose a new QoS-aware global-rerouting algorithm for remapping those users, reducing the impact of the service interruption thanks to avoiding the migration of surviving VNFs and virtual links when feasible. The proposed algorithm is shown to outperform a service restoration strategy based on local rerouting, in terms of successful service restoration and resource consumption., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Guaranteed bit rate slicing in WiFi networks

  • Richart Gutiérrez, Matías Mario|||0000-0002-9152-3522
  • Baliosian De Lazzari, Javier Ernesto
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
  • Agüero Calvo, Ramón
In forthcoming 5G networks, slicing has been proposed as a means to partition a shared physical network infrastructure into different self-contained logical parts (slices), which are set up to satisfy certain requirements. Although the topic has been thoroughly investigated by the scientific community and the industry, there are not many works addressing the challenges that appear when trying to exploit slicing techniques over WiFi networks. In this paper, we propose a novel method of allocating resources for WiFi networks to satisfy minimum bit rate requirements. We formulate an optimization problem, and we propose a solution based on the theory of Lyapunov drift optimization. The validity of the proposed solution is assessed by means of a simulation-based evaluation in Matlab., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

A reinforcement learning approach for placement of stateful Virtualized Network Functions

  • Kibalya, Godfrey Mirondo|||0000-0002-7053-3756
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
  • Gift Bujjingo, Doreen
  • Sseregunda, Jonathan
  • Zhang, Peiying
Network softwarization increases network flexibility by supporting the implementation of network functions such as firewalls as software modules. However, this creates new concerns on service reliability due to failures at both software and hardware level. The survivability of critical applications is commonly assured by deploying stand-by Virtual Network Functions (VNFs) to which the service is migrated upon failure of the primary VNFs. However, it is challenging to identify the optimal Data Centers (DCs) for hosting the active and stand-by VNF instances, not only to minimize their placement cost, but also the cost of a continuous state transfer between active and stand-by instances, since a number of VNFs are stateful. This paper proposes a reinforcement learning (RL) approach for the placement of stateful VNFs that considers a joint reservation of primary and backup resources with the objective of minimizing the overall placement cost. Simulation results show that the proposed algorithm is optimized in terms of both acceptance ratio and cost, resulting in up to 27% and 30% improvements in terms of accepted requests and placement cost compared to a state-of-the art algorithm.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Self-adaptive online virtual network migration in network virtualization environments

  • Zangiabady, Mahboobeh
  • García Robledo, Alberto
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Rubio Loyola, Javier
This is the peer reviewed version of the following article: Zangiabady, M, Garcia‐Robledo, A, Gorricho, J‐L, Serrat‐Fernandez, J, Rubio‐Loyola, J. Self‐adaptive online virtual network migration in network virtualization environments. Trans Emerging Tel Tech. 2019; 30:e3692. https://doi.org/10.1002/ett.3692, which has been published in final form at https://doi.org/10.1002/ett.3692. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving., In Network Virtualization Environments, the capability of operators to allocate resources in the Substrate Network (SN) to support Virtual Networks (VNs) in an optimal manner is known as Virtual Network Embedding (VNE). In the same context, online VN migration is the process meant to reallocate components of a VN, or even an entire VN among elements of the SN in real time and seamlessly to end-users. Online VNE without VN migration may lead to either over- or under-utilization of the SN resources. However, VN migration is challenging due to its computational cost and the service disruption inherent to VN components reallocation. Online VN migration can reduce migration costs insofar it is triggered proactively, not reactively, at critical times, avoiding the negative effects of both under- and over-triggering. This paper presents a novel online cost-efficient mechanism that self-adaptively learns the exact moments when triggering VN migration is likely to be profitable in the long term. We propose a novel self-adaptive mechanism based on Reinforcement Learning that determines the right trigger online VN migration times, leading to the minimization of migration costs while simultaneously considering the online VNE acceptance ratio., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

End-to-end elasticity control of cloud-network slices

  • Medeiros, Alisson
  • Neto, Augusto
  • Sampaio, Silvio
  • Pasquini, Rafael
  • Baliosian, Javier
The design of efficient elasticity control mechanisms for dynamic resource allocation is crucial to increase the efficiency of future cloud-network slice-defined systems. Current elasticity control mechanisms proposed for cloud- or network-slicing, only consider cloud- or network-type resources respectively. In this paper, we introduce the elaSticity in cLOud-neTwork Slices (SLOTS) which aims to extend the horizontal elasticity control to multi-providers scenarios in an end-to-end fashion, as well as to provide a novel vertical elasticity mechanism to deal with critical insufficiency of resources by harvesting underused resources on other slices. Finally, we present a preliminary assessment of the SLOTS prototype in a real testbed, revealing outcomes that suggest the viability of the proposal., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Resource allocation and management techniques for network slicing in WiFi networks

  • Richart Gutiérrez, Matías Mario|||0000-0002-9152-3522
  • Baliosian, Javier
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Network slicing has recently been proposed as one of the main enablers for 5G networks; it is bound to cope with the increasing and heterogeneous performance requirements of these systems. To "slice" a network is to partition a shared physical network into several self-contained logical pieces (slices) that can be tailored to offer different functional or performance requirements. Moreover, a defining characteristic of the slicing paradigm is to provide resource isolation as well as efficient use of resources. In this context, the thesis described in this paper contributes to the problem of slicing WiFi networks by proposing a solution to the problem of enforcing and controlling slices in WiFi Access Points. The focus of the research is on a variant of network slicing called QoS Slicing, in which slices have specific performance requirements. In this document, we describe the two main contributions of our research, a resource allocation mechanism to assign resources to slices, and a solution to enforce and control slices with performance requirements in WiFi Access Points., This work has been supported by the European Commission and the Spanish Government (Fondo Europeo de Desarrollo Regional, FEDER) by means of the EU H2020 NECOS (777067) and ADVICE (TEC2015-71329) projects., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Inferring cloud-network slice’s requirements from non-structured service description

  • Pasquini, Rafael
  • Baliosian, Javier Ernesto
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
  • Neto, Augusto
  • Verdi, Fábio
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., To support future 5G computing and communication scenarios, cloud-network management tools should deploy cloud-network services adopting uncomplicated ways, reducing not only the time to market but also broadening the community capable of deploying new services. In this paper, we present the support of NECOS Platform, an EU-Brazil jointly funded project, towards slice-as-a-service creation from non-structured service description. We describe how NECOS architecture allows such functionality during the slice creation loop, and we present the initial efforts we took for structuring such a mechanism., This research was supported by the H2020 4th EU-BRCollaborative Call (Grant Agreement no. 777067 – NovelEnablers for Cloud Slicing)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Slicing with guaranteed quality of service in WiFi networks

  • Richart Gutiérrez, Matías Mario|||0000-0002-9152-3522
  • Baliosian, Javier
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
  • Agüero Calvo, Ramón
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Network slicing has recently been proposed as one of the main enablers for 5G networks. The slicing concept consists of the partition of a physical network into several self-contained logical networks (slices) that can be tailored to offer different functional or performance requirements. In the context of 5G networks, we argue that existing ubiquitous WiFi technology can be exploited to cope with new requirements. Therefore, in this paper, we propose a novel mechanism to implement network slicing in WiFi Access Points. We formulate the resource allocation problem to the different slices as a stochastic optimization problem, where each slice can have bit rate, delay, and capacity requirements. We devise a solution to the problem above using the Lyapunov drift optimization theory, and we develop a novel queuing and scheduling algorithm. We have used MATLAB and Simulink to build a prototype of the proposed solution, whose performance has been evaluated in a typical slicing scenario., This work has been supported in part by the European Commission and the Spanish Government (Fondo Europeo de Desarrollo Regional, FEDER) by means of the EU H2020 NECOS (777067) and ADVICE (TEC2015-71329) projects, respectively., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

The NECOS approach to end-to-end cloud-network slicing as a service

  • Clayman, Stuart
  • Neto, Augusto
  • Verdi, Fábio
  • Correa, Sand Luz
  • Sampaio, Silvio
  • Sakelariou, Ilias
  • Mamatas, Lefteris
  • Pasquini, Rafael
  • Cardoso, Kleber Vieira
  • Rothenberg, Christian
  • Tusa, Francesco
  • Serrat Fernández, Juan|||0000-0002-4551-9880
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Cloud-network slicing is a promising approach to serve vertical industries delivering their services over multiple administrative and technological domains. However, there are numerous open challenges to provide end-to-end slices due to complex business and engineering requirements from service and re-source providers. This article presents a reference architecture for the cloud-network slicing concept and the practical realization of the Slice-as-a-Service paradigm, which are key results from the NECOS (Novel Enablers in Cloud Slicing)project. The NECOS platform has been designed to consider modularity, separation of concerns, and multi-domain dynamic operation as prime attributes. The architecture comprises a set of inter-working components to automatically create, manage,and decommission end-to-end Cloud-Network slice instances in a lightweight manner. NECOS orchestrates slices at run-time,spanning across core / edge data centres and wired / wireless net-work infrastructures. The novelties of the multi-domain NECOS platform are validated through three proof-of-concept experiments: (i) a touristic content delivery service slice deployment featuring on-demand virtual infrastructure management across three countries in different continents to meet particular slice requirements; (ii) intelligent slice elasticity driven by machine-learning techniques; and (iii) marketplace-based resource discovery capabilities., Work supported by the H2020 EU-Brazil collaborative call, grant no. 777067 (NECOS), funded by the European Commission and the Brazilian Ministry of Science, Technology, Innovation, and Communication (MCTIC) through CTIC/RNP. The authors would like to thank the Editor and the anonymous reviewers for their valuable comments and suggestions as well as the whole NECOS team and stakeholders., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

An efficient algorithm for fast service edge selection in cloud-based telco networks

  • Baliosian De Lazzari, Javier Ernesto
  • Contreras, Luis Miguel
  • Martínez-Julia, Pedro
  • Serrat Fernández, Juan|||0000-0002-4551-9880
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Telecommunication operators are increasingly integrating computational infrastructure into their networks at different location levels, including the network edge. This makes a highly distributed processing environment a reality, which is expected to enable next-generation services. This article proposes a novel and efficient algorithm to determine the best service execution locations through the “service edge”, a concept that groups services in categories according to their requirements and benefits from the flexibility of distributed cloud resources. The paper is focused on describing the algorithm so that it can be integrated into the telco operators’ management and orchestration systems. Simulation results underpin the practical feasibility of the proposed algorithm., The European Commission has partly funded this work through the projects NECOS (Grant Agreement No 777067) and 5G-DIVE (Grant Agreement No 859881)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

NECOS Project: towards lightweight slicing of cloud federated infrastructures

  • Dantas Silva, Felipe S.
  • Lemos, Maricilio O.O.
  • Medeiros, Alisson
  • Venancio Neto, Augusto
  • Pasquini, Rafael
  • Rothenberg, Christian
  • Mamatas, Lefteris
  • Correa, Sand Luz
  • Cardoso, Kleber Vieira
  • Marcondes, Cesar
  • Abelem, Antonio
  • Nascimiento, Marcelo
  • Galis, Alex
  • Contreras, Luis Miguel
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Papadimitriou, Panagiotis
The Novel Enablers for Cloud Slicing (NECOS) project addresses the limitations of current cloud computing infrastructures to respond to the demand for new services, as presented in two use-cases, that will drive the whole execution of the project. The first use-case is focused on Telco service provider and is oriented towards the adoption of cloud computing in their large networks. The second use-case is targeting the use of edge clouds to support devices with low computation and storage capacity. The envisaged solution is based on a new concept, the Lightweight Slice Defined Cloud (LSDC), as an approach that extends the virtualization to all the resources in the involved networks and data centers and provides uniform management with a high-level of orchestration. In this position paper, we discuss the motivation, objectives, architecture, research challenges (and how to overcome them) and initial efforts for the NECOS project., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Fast and efficient energy-oriented cell assignment in heterogeneous networks

  • Rubio Loyola, Javier
  • Aguilar Fuster, Christian
  • Díez Fernández, Luis Francisco
  • Agüero Calvo, Ramón
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
  • Serrat Fernández, Juan|||0000-0002-4551-9880
This is a post-peer-review, pre-copyedit version of an article published in Wireless Networks. The final authenticated version is available online at: http://dx.doi.org/10.1007/s11276-019-02047-x”, The cell assignment problem is combinatorial, with increased complexity when it is tackled considering resource allocation. This paper models joint cell assignment and resource allocation for cellular heterogeneous networks, and formalizes cell assignment as an optimization problem. Exact algorithms can find optimal solutions to the cell assignment problem, but their execution time increases drastically with realistic network deployments. In turn, heuristics are able to find solutions in reasonable execution times, but they get usually stuck in local optima, thus failing to find optimal solutions. Metaheuristic approaches have been successful in finding solutions closer to the optimum one to combinatorial problems for large instances. In this paper we propose a fast and efficient heuristic that yields very competitive cell assignment solutions compared to those obtained with three of the most widely-used metaheuristics, which are known to find solutions close to the optimum due to the nature of their search space exploration. Our heuristic approach adds energy expenditure reduction in its algorithmic design. Through simulation and formal statistical analysis, the proposed scheme has been proved to produce efficient assignments in terms of the number of served users, resource allocation and energy savings, while being an order of magnitude faster than metaheuritsic-based approaches., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Resource slicing in virtual wireless networks: a survey

  • Richart, Matias
  • Baliosian De Lazzari, Javier Ernesto
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
New architectural and design approaches for radio access networks have appeared with the introduction of network virtualization in the wireless domain. One of these approaches splits the wireless network infrastructure into isolated virtual slices under their own management, requirements, and characteristics. Despite the advances in wireless virtualization, there are still many open issues regarding the resource allocation and isolation of wireless slices. Because of the dynamics and shared nature of the wireless medium, guaranteeing that the traffic on one slice will not affect the traffic on the others has proven to be difficult. In this paper, we focus on the detailed definition of the problem, discussing its challenges. We also provide a review of existing works that deal with the problem, analyzing how new trends such as software defined networking and network function virtualization can assist in the slicing. We will finally describe some research challenges on this topic., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A deep reinforcement learning-based algorithm for reliability-aware multi-domain service deployment in smart ecosystems

  • Kibalya, Godfrey Mirondo|||0000-0002-7053-3756
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
  • Okello, Dorothy
  • Zhang, Peiying
The final publication is available at Springer via http://dx.doi.org/10.1007/s00521-020-05372-x, The transition towards full network virtualization will see services for smart ecosystems including smart metering, healthcare and transportation among others, being deployed as Service Function Chains (SFCs) comprised of an ordered set of virtual network functions. However, since such services are usually deployed in remote cloud networks, the SFCs may transcend multiple domains belonging to different Infrastructure Providers (InPs), possibly with differing policies regarding billing and Quality-of-service (QoS) guarantees. Therefore, efficiently allocating the exhaustible network resources to the different SFCs while meeting the stringent requirements of the services such as delay and QoS among others, remains a complex challenge, especially under limited information disclosure by the InPs. In this work, we formulate the SFC deployment problem across multiple domains focusing on delay constraints, and propose a framework for SFC orchestration which adheres to the privacy requirements of the InPs. Then, we propose a reinforcement learning (RL)-based algorithm for partitioning the SFC request across the different InPs while considering service reliability across the participating InPs. Such RL-based algorithms have the intelligence to infer undisclosed InP information from historical data obtained from past experiences. Simulation results, considering both online and offline scenarios, reveal that the proposed algorithm results in up to 10% improvement in terms of acceptance ratio and provisioning cost compared to the benchmark algorithms, with up to more than 90% saving in execution time for large networks. In addition, the paper proposes an enhancement to a state-of-the-art algorithm which results in up to 5% improvement in terms of provisioning cost., This work has received funding from the European Union's Horizon 2020 research and innovation programme under grant agreement No 777067 (NECOS project) and the national project TEC2015-71329-C2-2-R (MINECO/FEDER). This work is also supported by the " Fundamental Research Funds for the Central Universities " of China University of Petroleum (East China) under Grant 18CX02139A, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A multi-stage graph aided algorithm for distributed Service Function Chain provisioning across multiple domains

  • Kibalya, Godfrey Mirondo|||0000-0002-7053-3756
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
  • Gift Bujjingo, Doreen
  • Serugunda, Jonathan
Network Service Providers (NSPs) envisage to support the divergent and stringent requirements of future services by instantiating these services as service chains, commonly referred to as Service Function Chains (SFCs), that are customized and configured to meet specific service requirements. However, due to the limited footprint of the Infrastructure Providers (InPs), these SFCs may have to transcend multiple InPs/domains. In this regard, determining the optimal set of InPs in which to embed the SFC request emerges as a complex problem for several reasons. First, the large number of possible combinations for selecting the InPs to embed the different sub-chains of the request makes this problem computationally complex, rendering optimal solutions only after long computations, especially in large scale networks, which is unfeasible for delay sensitive applications. Second, the unwillingness of InPs to disclose their internal information, which may be vital for making embedding decisions, usually implies the provisioning of single-domain solutions, which are unsuitable in this working scenario. In this regard, this paper first formulates the multi-domain service deployment problem under multiple request constraints, such as bandwidth or delay, among others. Then, due to the NP-hardness nature of the above problem, this paper proposes an algorithm that is aided by a multi-stage graph for computing a request embedding solution in a distributed manner, solving the problem in acceptable run-times. Results from different simulations reveal that the proposed algorithm is optimized in terms of acceptance ratio and embedding cost, with up to 60.0% and 88.7% improvements in terms of embedding cost and execution time, respectively, for some scenarios, in comparison with a benchmark state-of-the-art algorithm.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Slicing in WiFi networks through airtime-based resource allocation

  • Richart Gutiérrez, Matías Mario|||0000-0002-9152-3522
  • Baliosian De Lazzari, Javier Ernesto
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
  • Agüero Calvo, Ramón
The final publication is available at Springer via http://dx.doi.org/10.1007/s10922-018-9484-x, Network slicing is one of the key enabling technologies for 5G networks. It allows infrastructure owners to assign resources to service providers (tenants), which will afterwards use them to satisfy their end-user demands. This paradigm, which changes the way networks have been traditionally managed, was initially proposed in the wired realm (core networks). More recently, the scientific community has paid attention to the integration of network slicing in wireless cellular technologies (LTE). However, there are not many works addressing the challenges that appear when trying to exploit slicing techniques over WiFi networks, in spite of their growing relevance. In this paper we propose a novel method of proportionally distributing resources in WiFi networks, by means of the airtime. We develop an analytical model, which shed light on how such resources could be split. The validity of the proposed model is assessed by means of simulation-based evaluation over the ns-3 framework, This work has been supported in part by the European Commission and the Spanish Government (Fondo Europeo de desarrollo Regional, FEDER) by means of the EU H2020 NECOS (777067) and ADVICE (TEC2015-71329) projects, respectively., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Resource allocation and management techniques for network slicing in WiFi networks

  • Richart Gutiérrez, Matías Mario
  • Baliosian, Javier
  • Serrat Fernández, Juan
  • Gorricho Moreno, Juan Luis
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Network slicing has recently been proposed as one of the main enablers for 5G networks; it is bound to cope with the increasing and heterogeneous performance requirements of these systems. To "slice" a network is to partition a shared physical network into several self-contained logical pieces (slices) that can be tailored to offer different functional or performance requirements. Moreover, a defining characteristic of the slicing paradigm is to provide resource isolation as well as efficient use of resources. In this context, the thesis described in this paper contributes to the problem of slicing WiFi networks by proposing a solution to the problem of enforcing and controlling slices in WiFi Access Points. The focus of the research is on a variant of network slicing called QoS Slicing, in which slices have specific performance requirements. In this document, we describe the two main contributions of our research, a resource allocation mechanism to assign resources to slices, and a solution to enforce and control slices with performance requirements in WiFi Access Points., This work has been supported by the European Commission and the Spanish Government (Fondo Europeo de Desarrollo Regional, FEDER) by means of the EU H2020 NECOS (777067) and ADVICE (TEC2015-71329) projects., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

An efficient algorithm for fast service edge selection in cloud-based telco networks

  • Baliosian De Lazzari, Javier Ernesto
  • Contreras, Luis Miguel
  • Martínez-Julia, Pedro
  • Serrat Fernández, Juan
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Telecommunication operators are increasingly integrating computational infrastructure into their networks at different location levels, including the network edge. This makes a highly distributed processing environment a reality, which is expected to enable next-generation services. This article proposes a novel and efficient algorithm to determine the best service execution locations through the “service edge”, a concept that groups services in categories according to their requirements and benefits from the flexibility of distributed cloud resources. The paper is focused on describing the algorithm so that it can be integrated into the telco operators’ management and orchestration systems. Simulation results underpin the practical feasibility of the proposed algorithm., The European Commission has partly funded this work through the projects NECOS (Grant Agreement No 777067) and 5G-DIVE (Grant Agreement No 859881)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

NECOS Project: towards lightweight slicing of cloud federated infrastructures

  • Dantas Silva, Felipe S.
  • Lemos, Maricilio O.O.
  • Medeiros, Alisson
  • Venancio Neto, Augusto
  • Pasquini, Rafael
  • Rothenberg, Christian
  • Mamatas, Lefteris
  • Correa, Sand Luz
  • Cardoso, Kleber Vieira
  • Marcondes, Cesar
  • Abelem, Antonio
  • Nascimiento, Marcelo
  • Galis, Alex
  • Contreras, Luis Miguel
  • Serrat Fernández, Juan
  • Papadimitriou, Panagiotis
The Novel Enablers for Cloud Slicing (NECOS) project addresses the limitations of current cloud computing infrastructures to respond to the demand for new services, as presented in two use-cases, that will drive the whole execution of the project. The first use-case is focused on Telco service provider and is oriented towards the adoption of cloud computing in their large networks. The second use-case is targeting the use of edge clouds to support devices with low computation and storage capacity. The envisaged solution is based on a new concept, the Lightweight Slice Defined Cloud (LSDC), as an approach that extends the virtualization to all the resources in the involved networks and data centers and provides uniform management with a high-level of orchestration. In this position paper, we discuss the motivation, objectives, architecture, research challenges (and how to overcome them) and initial efforts for the NECOS project., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Fast and efficient energy-oriented cell assignment in heterogeneous networks

  • Rubio Loyola, Javier
  • Aguilar Fuster, Christian
  • Díez Fernández, Luis Francisco
  • Agüero Calvo, Ramón
  • Gorricho Moreno, Juan Luis
  • Serrat Fernández, Juan
This is a post-peer-review, pre-copyedit version of an article published in Wireless Networks. The final authenticated version is available online at: http://dx.doi.org/10.1007/s11276-019-02047-x”, The cell assignment problem is combinatorial, with increased complexity when it is tackled considering resource allocation. This paper models joint cell assignment and resource allocation for cellular heterogeneous networks, and formalizes cell assignment as an optimization problem. Exact algorithms can find optimal solutions to the cell assignment problem, but their execution time increases drastically with realistic network deployments. In turn, heuristics are able to find solutions in reasonable execution times, but they get usually stuck in local optima, thus failing to find optimal solutions. Metaheuristic approaches have been successful in finding solutions closer to the optimum one to combinatorial problems for large instances. In this paper we propose a fast and efficient heuristic that yields very competitive cell assignment solutions compared to those obtained with three of the most widely-used metaheuristics, which are known to find solutions close to the optimum due to the nature of their search space exploration. Our heuristic approach adds energy expenditure reduction in its algorithmic design. Through simulation and formal statistical analysis, the proposed scheme has been proved to produce efficient assignments in terms of the number of served users, resource allocation and energy savings, while being an order of magnitude faster than metaheuritsic-based approaches., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A novel dynamic programming inspired algorithm for embedding of virtual networks in future networks

  • Kibalya, Godfrey Mirondo
  • Serrat Fernández, Juan
  • Gorricho Moreno, Juan Luis
  • Yao, Haipeng
  • Zhang, Peiying
© <2020>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, Network virtualization is envisioned to support flexible, cost effective and on-demand deployment of multiple Virtual Networks (VNs) on a shared underlying infrastructure. A key challenge under the virtualization paradigm is how to effectively and efficiently map the divergent VNs onto the shared infrastructure characterized by exhaustible resources. Given that the future services will be characterized by heterogeneity in terms of topology and QoS requirements, existing algorithms can not be flexibly adapted to deal with such requests with differing constraints and mapping objectives. In this regard, this paper proposes a Dynamic Programming Inspired Algorithm (DyPI-Algo), a generic algorithm for mapping virtual networks on a shared infrastructure. Simulation results reveal that the proposed algorithm is able to maximize acceptance ratio and load balancing. Additionally, the algorithm is able to maximise revenue by admitting requests of large size compared to the benchmark algorithms. Moreover, the algorithm is found to be scalable in terms of time complexity when increasing the size of the substrate network and requests. In addition, the paper proposes an Adjacency List based heuristic and a Brute-force algorithm as additional benchmark algorithms. Simulation results show that the proposed algorithms result into up to more than a 10% improvement in terms of acceptance ratio compared to the state of the art algorithms in some scenarios., This work has received funding from the European Unions Horizon 2020 research and innovation programme under grant agreement No 777067 (NECOSproject).This work is also funded by the national project TEC2015-71329-C2-2-R (MINECO/FEDER), Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

A reinforcement learning approach for placement of stateful Virtualized Network Functions

  • Kibalya, Godfrey Mirondo
  • Serrat Fernández, Juan
  • Gorricho Moreno, Juan Luis
  • Gift Bujjingo, Doreen
  • Sseregunda, Jonathan
  • Zhang, Peiying
Network softwarization increases network flexibility by supporting the implementation of network functions such as firewalls as software modules. However, this creates new concerns on service reliability due to failures at both software and hardware level. The survivability of critical applications is commonly assured by deploying stand-by Virtual Network Functions (VNFs) to which the service is migrated upon failure of the primary VNFs. However, it is challenging to identify the optimal Data Centers (DCs) for hosting the active and stand-by VNF instances, not only to minimize their placement cost, but also the cost of a continuous state transfer between active and stand-by instances, since a number of VNFs are stateful. This paper proposes a reinforcement learning (RL) approach for the placement of stateful VNFs that considers a joint reservation of primary and backup resources with the objective of minimizing the overall placement cost. Simulation results show that the proposed algorithm is optimized in terms of both acceptance ratio and cost, resulting in up to 27% and 30% improvements in terms of accepted requests and placement cost compared to a state-of-the art algorithm., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

The NECOS approach to end-to-end cloud-network slicing as a service

  • Clayman, Stuart
  • Neto, Augusto
  • Verdi, Fábio
  • Correa, Sand Luz
  • Sampaio, Silvio
  • Sakelariou, Ilias
  • Mamatas, Lefteris
  • Pasquini, Rafael
  • Cardoso, Kleber Vieira
  • Rothenberg, Christian
  • Tusa, Francesco
  • Serrat Fernández, Juan
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Cloud-network slicing is a promising approach to serve vertical industries delivering their services over multiple administrative and technological domains. However, there are numerous open challenges to provide end-to-end slices due to complex business and engineering requirements from service and re-source providers. This article presents a reference architecture for the cloud-network slicing concept and the practical realization of the Slice-as-a-Service paradigm, which are key results from the NECOS (Novel Enablers in Cloud Slicing)project. The NECOS platform has been designed to consider modularity, separation of concerns, and multi-domain dynamic operation as prime attributes. The architecture comprises a set of inter-working components to automatically create, manage,and decommission end-to-end Cloud-Network slice instances in a lightweight manner. NECOS orchestrates slices at run-time,spanning across core / edge data centres and wired / wireless net-work infrastructures. The novelties of the multi-domain NECOS platform are validated through three proof-of-concept experiments: (i) a touristic content delivery service slice deployment featuring on-demand virtual infrastructure management across three countries in different continents to meet particular slice requirements; (ii) intelligent slice elasticity driven by machine-learning techniques; and (iii) marketplace-based resource discovery capabilities., Work supported by the H2020 EU-Brazil collaborative call, grant no. 777067 (NECOS), funded by the European Commission and the Brazilian Ministry of Science, Technology, Innovation, and Communication (MCTIC) through CTIC/RNP. The authors would like to thank the Editor and the anonymous reviewers for their valuable comments and suggestions as well as the whole NECOS team and stakeholders., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A multi-stage graph based algorithm for survivable Service Function Chain orchestration with backup resource sharing

  • Kibalya, Godfrey Mirondo
  • Serrat Fernández, Juan
  • Gorricho Moreno, Juan Luis
  • Serugunda, Jonathan
  • Zhang, Peiying
Network softwarisation introduces flexibility in network management by enabling the deployment of network functions as software modules running on virtual machines. However, this creates new concerns for service availability and reliability due to multiple sources of failures at both software and hardware levels, potentially resulting in service degradations and penalties due to Service Level Agreement (SLA) violations. The survivability of critical services can best be guaranteed by pro-actively provisioning dedicated backup resources for these services, but at the cost of a high resource consumption. Aware of the divergent requirements of future services, a promising alternative is envisaged, allowing non-critical users to use the unused backup resources of high priority users. However, this approach poses a stringent challenge if a critical service disruption occurs, requiring the computation of a traffic rerouting solution for the non-critical requests when preempted from their borrowed resources. In this paper we first propose a generic multi-stage graph based algorithm as an alternative algorithm for Service Function Chain (SFC) deployments. Simulation results demonstrate that the proposed algorithm is optimized in terms of resource utilization, resulting in a 10% improvement in terms of acceptance ratio compared to a given state of the art algorithm, and within a 4% margin of the optimal solution. Based on the mentioned algorithm, we propose a new migration-aware algorithm for the mapping of non-critical services, enabling the noncritical services to borrow the unused backup resources from the critical services while minimizing the probability of preemption they could experience. The migration-aware algorithm results in more than an 8% resource saving, in most scenarios, compared to a dedicated backup strategy, and more than a 70% performance improvement in terms of the number of service preemptions, compared to a cost based algorithm. Additionally, whenever low priority users are preempted from their borrowed resources, we propose a new QoS-aware global-rerouting algorithm for remapping those users, reducing the impact of the service interruption thanks to avoiding the migration of surviving VNFs and virtual links when feasible. The proposed algorithm is shown to outperform a service restoration strategy based on local rerouting, in terms of successful service restoration and resource consumption., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Guaranteed bit rate slicing in WiFi networks

  • Richart Gutiérrez, Matías Mario
  • Baliosian De Lazzari, Javier Ernesto
  • Serrat Fernández, Juan
  • Gorricho Moreno, Juan Luis
  • Agüero Calvo, Ramón
In forthcoming 5G networks, slicing has been proposed as a means to partition a shared physical network infrastructure into different self-contained logical parts (slices), which are set up to satisfy certain requirements. Although the topic has been thoroughly investigated by the scientific community and the industry, there are not many works addressing the challenges that appear when trying to exploit slicing techniques over WiFi networks. In this paper, we propose a novel method of allocating resources for WiFi networks to satisfy minimum bit rate requirements. We formulate an optimization problem, and we propose a solution based on the theory of Lyapunov drift optimization. The validity of the proposed solution is assessed by means of a simulation-based evaluation in Matlab., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Resource slicing in virtual wireless networks: a survey

  • Richart, Matias
  • Baliosian De Lazzari, Javier Ernesto
  • Serrat Fernández, Juan
  • Gorricho Moreno, Juan Luis
New architectural and design approaches for radio access networks have appeared with the introduction of network virtualization in the wireless domain. One of these approaches splits the wireless network infrastructure into isolated virtual slices under their own management, requirements, and characteristics. Despite the advances in wireless virtualization, there are still many open issues regarding the resource allocation and isolation of wireless slices. Because of the dynamics and shared nature of the wireless medium, guaranteeing that the traffic on one slice will not affect the traffic on the others has proven to be difficult. In this paper, we focus on the detailed definition of the problem, discussing its challenges. We also provide a review of existing works that deal with the problem, analyzing how new trends such as software defined networking and network function virtualization can assist in the slicing. We will finally describe some research challenges on this topic., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Computing at the edge: but, what edge?

  • Contreras Murillo, Luis Miguel
  • Baliosian De Lazzari, Javier Ernesto
  • Martínez-Julia, Pedro
  • Serrat Fernández, Juan
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The traditional telecommunications business is evolving towards offering a richer set of services beyond basic connectivity, leveraging on network programmability and virtualization. A versatile execution environment is required, capable of running different workloads in different locations in the network. Cloud computing is the key paradigm that allows fostering this trending change. One interesting question to solve is to what extent those computing environments have to move towards the network edge. Some services can be enabled by environments with increased capillarity, while others can be implemented in environments with more relaxed constraints (e.g., in terms of latency). This paper explores this topic by differentiating service edge from physical network edge and proposing an architecture based on the ALTO server for assisting orchestration systems in discriminating the suitable environments for each service. We present a network-flow strategy for assigning services to infrastructure elements following those precepts, together with an initial scalability evaluation of the proposed assignment solution to show its feasibility., This work has been partly funded by the European Com-mission through the projects NECOS (Grant Agreement No 777067) and 5G-DIVE (Grant Agreement No 859881)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

End-to-end elasticity control of cloud-network slices

  • Medeiros, Alisson
  • Neto, Augusto
  • Sampaio, Silvio
  • Pasquini, Rafael
  • Baliosian, Javier
The design of efficient elasticity control mechanisms for dynamic resource allocation is crucial to increase the efficiency of future cloud-network slice-defined systems. Current elasticity control mechanisms proposed for cloud- or network-slicing, only consider cloud- or network-type resources respectively. In this paper, we introduce the elaSticity in cLOud-neTwork Slices (SLOTS) which aims to extend the horizontal elasticity control to multi-providers scenarios in an end-to-end fashion, as well as to provide a novel vertical elasticity mechanism to deal with critical insufficiency of resources by harvesting underused resources on other slices. Finally, we present a preliminary assessment of the SLOTS prototype in a real testbed, revealing outcomes that suggest the viability of the proposal., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Inferring cloud-network slice’s requirements from non-structured service description

  • Pasquini, Rafael
  • Baliosian, Javier Ernesto
  • Serrat Fernández, Juan
  • Gorricho Moreno, Juan Luis
  • Neto, Augusto
  • Verdi, Fábio
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., To support future 5G computing and communication scenarios, cloud-network management tools should deploy cloud-network services adopting uncomplicated ways, reducing not only the time to market but also broadening the community capable of deploying new services. In this paper, we present the support of NECOS Platform, an EU-Brazil jointly funded project, towards slice-as-a-service creation from non-structured service description. We describe how NECOS architecture allows such functionality during the slice creation loop, and we present the initial efforts we took for structuring such a mechanism., This research was supported by the H2020 4th EU-BRCollaborative Call (Grant Agreement no. 777067 – NovelEnablers for Cloud Slicing)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Slicing with guaranteed quality of service in WiFi networks

  • Richart Gutiérrez, Matías Mario
  • Baliosian, Javier
  • Serrat Fernández, Juan
  • Gorricho Moreno, Juan Luis
  • Agüero Calvo, Ramón
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Network slicing has recently been proposed as one of the main enablers for 5G networks. The slicing concept consists of the partition of a physical network into several self-contained logical networks (slices) that can be tailored to offer different functional or performance requirements. In the context of 5G networks, we argue that existing ubiquitous WiFi technology can be exploited to cope with new requirements. Therefore, in this paper, we propose a novel mechanism to implement network slicing in WiFi Access Points. We formulate the resource allocation problem to the different slices as a stochastic optimization problem, where each slice can have bit rate, delay, and capacity requirements. We devise a solution to the problem above using the Lyapunov drift optimization theory, and we develop a novel queuing and scheduling algorithm. We have used MATLAB and Simulink to build a prototype of the proposed solution, whose performance has been evaluated in a typical slicing scenario., This work has been supported in part by the European Commission and the Spanish Government (Fondo Europeo de Desarrollo Regional, FEDER) by means of the EU H2020 NECOS (777067) and ADVICE (TEC2015-71329) projects, respectively., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Self-adaptive online virtual network migration in network virtualization environments

  • Zangiabady, Mahboobeh
  • García Robledo, Alberto
  • Gorricho Moreno, Juan Luis
  • Serrat Fernández, Juan
  • Rubio Loyola, Javier
This is the peer reviewed version of the following article: Zangiabady, M, Garcia‐Robledo, A, Gorricho, J‐L, Serrat‐Fernandez, J, Rubio‐Loyola, J. Self‐adaptive online virtual network migration in network virtualization environments. Trans Emerging Tel Tech. 2019; 30:e3692. https://doi.org/10.1002/ett.3692, which has been published in final form at https://doi.org/10.1002/ett.3692. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving., In Network Virtualization Environments, the capability of operators to allocate resources in the Substrate Network (SN) to support Virtual Networks (VNs) in an optimal manner is known as Virtual Network Embedding (VNE). In the same context, online VN migration is the process meant to reallocate components of a VN, or even an entire VN among elements of the SN in real time and seamlessly to end-users. Online VNE without VN migration may lead to either over- or under-utilization of the SN resources. However, VN migration is challenging due to its computational cost and the service disruption inherent to VN components reallocation. Online VN migration can reduce migration costs insofar it is triggered proactively, not reactively, at critical times, avoiding the negative effects of both under- and over-triggering. This paper presents a novel online cost-efficient mechanism that self-adaptively learns the exact moments when triggering VN migration is likely to be profitable in the long term. We propose a novel self-adaptive mechanism based on Reinforcement Learning that determines the right trigger online VN migration times, leading to the minimization of migration costs while simultaneously considering the online VNE acceptance ratio., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Slicing in WiFi networks through airtime-based resource allocation

  • Richart Gutiérrez, Matías Mario
  • Baliosian De Lazzari, Javier Ernesto
  • Serrat Fernández, Juan
  • Gorricho Moreno, Juan Luis
  • Agüero Calvo, Ramón
The final publication is available at Springer via http://dx.doi.org/10.1007/s10922-018-9484-x, Network slicing is one of the key enabling technologies for 5G networks. It allows infrastructure owners to assign resources to service providers (tenants), which will afterwards use them to satisfy their end-user demands. This paradigm, which changes the way networks have been traditionally managed, was initially proposed in the wired realm (core networks). More recently, the scientific community has paid attention to the integration of network slicing in wireless cellular technologies (LTE). However, there are not many works addressing the challenges that appear when trying to exploit slicing techniques over WiFi networks, in spite of their growing relevance. In this paper we propose a novel method of proportionally distributing resources in WiFi networks, by means of the airtime. We develop an analytical model, which shed light on how such resources could be split. The validity of the proposed model is assessed by means of simulation-based evaluation over the ns-3 framework, This work has been supported in part by the European Commission and the Spanish Government (Fondo Europeo de desarrollo Regional, FEDER) by means of the EU H2020 NECOS (777067) and ADVICE (TEC2015-71329) projects, respectively., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A multi-stage graph aided algorithm for distributed Service Function Chain provisioning across multiple domains

  • Kibalya, Godfrey Mirondo
  • Serrat Fernández, Juan
  • Gorricho Moreno, Juan Luis
  • Gift Bujjingo, Doreen
  • Serugunda, Jonathan
Network Service Providers (NSPs) envisage to support the divergent and stringent requirements of future services by instantiating these services as service chains, commonly referred to as Service Function Chains (SFCs), that are customized and configured to meet specific service requirements. However, due to the limited footprint of the Infrastructure Providers (InPs), these SFCs may have to transcend multiple InPs/domains. In this regard, determining the optimal set of InPs in which to embed the SFC request emerges as a complex problem for several reasons. First, the large number of possible combinations for selecting the InPs to embed the different sub-chains of the request makes this problem computationally complex, rendering optimal solutions only after long computations, especially in large scale networks, which is unfeasible for delay sensitive applications. Second, the unwillingness of InPs to disclose their internal information, which may be vital for making embedding decisions, usually implies the provisioning of single-domain solutions, which are unsuitable in this working scenario. In this regard, this paper first formulates the multi-domain service deployment problem under multiple request constraints, such as bandwidth or delay, among others. Then, due to the NP-hardness nature of the above problem, this paper proposes an algorithm that is aided by a multi-stage graph for computing a request embedding solution in a distributed manner, solving the problem in acceptable run-times. Results from different simulations reveal that the proposed algorithm is optimized in terms of acceptance ratio and embedding cost, with up to 60.0% and 88.7% improvements in terms of embedding cost and execution time, respectively, for some scenarios, in comparison with a benchmark state-of-the-art algorithm., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A deep reinforcement learning-based algorithm for reliability-aware multi-domain service deployment in smart ecosystems

  • Kibalya, Godfrey Mirondo
  • Serrat Fernández, Juan
  • Gorricho Moreno, Juan Luis
  • Okello, Dorothy
  • Zhang, Peiying
The final publication is available at Springer via http://dx.doi.org/10.1007/s00521-020-05372-x, The transition towards full network virtualization will see services for smart ecosystems including smart metering, healthcare and transportation among others, being deployed as Service Function Chains (SFCs) comprised of an ordered set of virtual network functions. However, since such services are usually deployed in remote cloud networks, the SFCs may transcend multiple domains belonging to different Infrastructure Providers (InPs), possibly with differing policies regarding billing and Quality-of-service (QoS) guarantees. Therefore, efficiently allocating the exhaustible network resources to the different SFCs while meeting the stringent requirements of the services such as delay and QoS among others, remains a complex challenge, especially under limited information disclosure by the InPs. In this work, we formulate the SFC deployment problem across multiple domains focusing on delay constraints, and propose a framework for SFC orchestration which adheres to the privacy requirements of the InPs. Then, we propose a reinforcement learning (RL)-based algorithm for partitioning the SFC request across the different InPs while considering service reliability across the participating InPs. Such RL-based algorithms have the intelligence to infer undisclosed InP information from historical data obtained from past experiences. Simulation results, considering both online and offline scenarios, reveal that the proposed algorithm results in up to 10% improvement in terms of acceptance ratio and provisioning cost compared to the benchmark algorithms, with up to more than 90% saving in execution time for large networks. In addition, the paper proposes an enhancement to a state-of-the-art algorithm which results in up to 5% improvement in terms of provisioning cost., This work has received funding from the European Union's Horizon 2020 research and innovation programme under grant agreement No 777067 (NECOS project) and the national project TEC2015-71329-C2-2-R (MINECO/FEDER). This work is also supported by the " Fundamental Research Funds for the Central Universities " of China University of Petroleum (East China) under Grant 18CX02139A, Peer Reviewed, Postprint (author's final draft)