Skip to main content

EVOLUCION HACIA REDES Y SERVICIOS AUTO-GESTIONADOS PARA EL 5G DEL FUTURO

PID2019-108713RB-C51

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2019
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

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

UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

SDN-based gateway architecture for electromagnetic nano-networks

  • Galal Mahmoud Ibrahim, Akram|||0000-0002-3852-7436
  • Hesselbach Serra, Xavier|||0000-0002-7888-3603
  • Tavernier, Wouter
  • Colle, Didier
Electromagnetic nano-communication has increasing attention in recent years. Several developments have been achieved in the fabrication, communication and management of various nano-network devices serving potential applications ranging from softwaredefined metamaterials, wireless robotic materials and body-centric communication. Such applications need uplink and downlink communication between the deployed nano-network and the external macro-world or the Internet through nano-interfaces. As a result, heterogeneous nano-network devices and their interoperability in different Internet of nano-things applications become new challenges for nano-network communication. In this regard, dynamic, flexible and distributed micro/nano-gateways can accommodate such sustainable issues and make the nano-network fully operational, regardless of the adopted application domain or the protocols used in communication. Network functions virtualization and software-defined networking technologies altogether can overcome these challenges. This article proposes SDN-based architecture and software module for the micro/nano-gateway. The proposed software module converts data formats and protocols between nano-network and traditional network domains allowing the nano-devices to be linked to the Internet. A prototype of the module is built, and the performance of the proposed algorithm is evaluated based on two communication scenarios; single tenant and multitenant. The result shows the effect of the total number of connected nano-devices and the number of packets sent by each device on the total average round-trip processing delay and the overall throughput of the micro/nano-gateway., This work has been supported by the ”Agencia Estatal de Investigacion” of Spain under project PID2019-108713RB-C51 ´ / AEI/10.13039/501100011033 and ”Agencia de Gesti ` o d’Ajuts ´ Universitaris i de Recerca” (AGAUR) of the ”Generalitat de Catalunya” under FI-AGAUR grant.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

An SDN-based solution for horizontal auto-scaling and load balancing of transparent VNF clusters

  • Llorens Carrodeguas, Alejandro|||0000-0002-4329-7962
  • Leyva Pupo, Irian|||0000-0001-6356-5840
  • Cervelló Pastor, Cristina|||0000-0002-8056-0774
  • Piñeiro, Luis
  • Siddiqui, Muhammad Shuaib
© 2021 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), This paper studies the problem of the dynamic scaling and load balancing of transparent virtualized network functions (VNFs). It analyzes different particularities of this problem, such as loop avoidance when performing scaling-out actions, and bidirectional flow affinity. To address this problem, a software-defined networking (SDN)-based solution is implemented consisting of two SDN controllers and two OpenFlow switches (OFSs). In this approach, the SDN controllers run the solution logic (i.e., monitoring, scaling, and load-balancing modules). According to the SDN controllers instructions, the OFSs are responsible for redirecting traffic to and from the VNF clusters (i.e., load-balancing strategy). Several experiments were conducted to validate the feasibility of this proposed solution on a real testbed. Through connectivity tests, not only could end-to-end (E2E) traffic be successfully achieved through the VNF cluster, but the bidirectional flow affinity strategy was also found to perform well because it could simultaneously create flow rules in both switches. Moreover, the selected CPU-based load-balancing method guaranteed an average imbalance below 10% while ensuring that new incoming traffic was redirected to the least loaded instance without requiring packet modification. Additionally, the designed monitoring function was able to detect failures in the set of active members in near real-time and active new instances in less than a minute. Likewise, the proposed auto-scaling module had a quick response to traffic changes. Our solution showed that the use of SDN controllers along with OFS provides great flexibility to implement different load-balancing, scaling, and monitoring strategies.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Static placement and dynamic assignment of SDN controllers in LEO satellite networks

  • Guo, Jianming
  • Yang, Lei
  • Rincón Rivera, David|||0000-0003-1294-3842
  • Sallent Ribes, Sebastián|||0000-0002-8232-6180
  • Chen, Quan
  • Liu, Xianfeng
​© 2022 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., Software-defined networking (SDN) logically separates the control and data planes, thus opening the way to more flexible configurations and management of low-Earth orbit (LEO) satellite networks. Since one or, more generally, multiple distributed controllers are needed, a significant challenge in SDN is the controller placement problem (CPP). Due to characteristics such as the dynamic network topology, limited bandwidth and traffic variations, the CPP is quite complex in SDN-based satellite networks. In this paper, we propose solving the CPP by means of a static placement with dynamic assignment (SPDA) method for LEO satellite networks. The SPDA method has two parts: the first is to incorporate SDN controllers into some fixed satellites by formulating a mixed integer programming model; the second is to dynamically assign switches to existing controllers according to the switch-controller latency and the traffic load of controllers. The SPDA method takes the topological dynamics into account by effectively dividing time snapshots, and it has a lower bandwidth consumption compared with methods involving controller migrations. Real satellite constellations are used to evaluate the performance of our controller placement solution. The results show that SPDA outperforms existing methods in terms of reducing the switch-controller latency, and it also has good load balancing performance.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Heuristic strategies for NFV-enabled renewable and non-renewable energy management in the future IoT world

  • Tipantuña Tenelema, Christian José
  • Hesselbach Serra, Xavier|||0000-0002-7888-3603
  • Unger, Walter
© 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., The ever-growing energy demand and the CO2 emissions caused by energy production and consumption have become critical concerns worldwide and drive new energy management and consumption schemes. In this regard, energy systems that promote green energy, customer-side participation enabled by the Internet of Things (IoT) technologies, and adaptive consumption mechanisms implemented on advanced communications technologies such as the Network Function Virtualization (NFV) emerge as sustainable and de-carbonized alternatives. On these modern schemes, diverse management algorithmic solutions can be deployed to promote the interaction between generation and consumption sides and optimize the use of available energy either from renewable or non-renewable sources. However, existing literature shows that management solutions considering features such as the dynamic nature of renewable energy generation, prioritization in energy provisioning if needed, and time-shifting capabilities to adapt the workloads to energy availability present a complexity NP-Hard. This condition imposes limits on applicability to a small number of energy demands or time-shifting values. Therefore, faster and less complex adaptive energy management approaches are needed. To meet these requirements, this paper proposes three heuristic strategies: a greedy strategy (GreedyTs), a genetic-algorithm-based solution (GATs), and a dynamic programming approach (DPTs) that, when deployed at the NFV domain, seeks the best possible scheduling of demands that lead to efficient energy utilization. The performance of the algorithmic strategies is validated through extensive simulations in several scenarios, demonstrating improvements in energy consumption and processing of demands. Additionally, simulation results reveal that the heuristic approaches produce high-quality solutions close to the optimal while executing among two and seven orders of magnitude faster and with applicability to scenarios with thousands and hundreds of thousands of energy demands., This work was supported by the Ministerio de Ciencia e Innovación of the Spanish Government under Project PID2019-108713RB-C51. The work of Christian Tipantuña was supported in part by the Escuela Politécnica Nacional and in part by Secretaría de Educación Superior, Ciencia, Tecnología e Innovación (SENESCYT)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Gateway placement optimization in LEO satellite networks based on traffic estimation

  • Guo, Jianming
  • Rincón Rivera, David|||0000-0003-1294-3842
  • Sallent Ribes, Sebastián|||0000-0002-8232-6180
  • Yang, Lei
  • Chen, Xiaoqian
  • Chen, Xianqi
​© 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., Adopting satellite constellations to provide global Internet access services has recently drawn increasing attention. A Low Earth Orbit (LEO) satellite network with multiple satellites has global coverage ability, low latency and independent operation, so it can be an effective complement to terrestrial IP networks. Satellite gateways are placed on the ground and can serve as data exchange points between satellite networks and the Internet. As the placement scheme can affect the network performance, it is a fundamental problem to find appropriate sites for gateways. In this paper, a Gateway Placement Optimization (GPO) method in LEO satellite networks is proposed to solve the problem, which is modeled as a combination optimization problem. Our aim is to select the best places for gateways that can balance the traffic loads with as few gateways as possible. The constraints come from the physical links between gateways and satellites including the link interference, the satellite bandwidth and the number of satellite antennas. The gravity model is used to estimate the traffic matrix from/to gateways and satellites, and then the discrete Particle Swarm Optimization (PSO) algorithm is adopted and modified to solve this problem. Finally, the GPO method is applied to numerical tests involving real satellite constellation networks. Results indicate that our method has good performance and effectiveness., Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura::9.1 - Desenvolupar infraestructures fiables, sostenibles, resilients i de qualitat, incloent infraestructures regionals i transfrontereres, per tal de donar suport al desenvolupament econòmic i al benestar humà, amb especial atenció a l’accés assequible i equitatiu per a totes les persones, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura::9.c - Augmentar de forma significativa l’accés a les tecnologies de la informació i la comunicació i esforçar-se a proporcionar accés universal i assequible a Internet als països menys avançats a tot tardar el 2020
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Adaptive energy management in 5G network slicing: Requirements, architecture, and strategies

  • Tipantuña Tenelema, Christian José
  • Hesselbach Serra, Xavier|||0000-0002-7888-3603
Energy consumption is a critical issue for the communications network operators, impacting deeply the cost of the services, as well as the ecological footprint. Network slicing architecture for 5G mobile communications enables multiple independent virtual networks to be created on top of a common shared physical infrastructure. Each network slice needs different types of resources, including energy, to fulfill the demands requested by each application, operator, or vertical market. The existing literature on network slicing is mainly targeted at the partition of network resources; however, the corresponding management of energy consumption is an unconsidered critical concern. This paper analyzes the requirements for an energy-aware 5G network slicing provisioning according to the 3GPP specifications, proposes an architecture, and studies the strategies to provide efficient energy consumption in terms of renewable and non-renewable sources. NFV and SDN technologies are the essential enablers and leverage the Internet of Things (IoT) connectivity provided by 5G networks. This paper also presents the technical 5G technology documentation related to the proposal, the requirements for adaptive energy management, and the Integer Linear Programming (ILP) formulation of the energy management model. To validate the improvements, an exact optimal algorithmic solution is presented and some heuristic strategies, This work was supported by the Ministerio de Economía y Competitividad of the Spanish Government under project PID2019-108713RB-C51, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Machine learning models for traffic classification in electromagnetic nano-networks

  • Galal Mahmoud Ibrahim, Akram|||0000-0002-3852-7436
  • Hesselbach Serra, Xavier|||0000-0002-7888-3603
The number of nano-sensors connected to wireless electromagnetic nano-network generates different traffic volumes that have increased dramatically, enabling various applications of the Internet of nano-things. Nano-network traffic classification is more challenging nowadays to analyze different types of flows and study the overall performance of a nano-network that connects to the Internet through micro/nanogateways. There are traditional techniques to classify traffic, such as port-based technique and load-based technique, however the most promising technique used recently is machine learning. As machine learning models have a great impact on traffic classification and network performance evaluation in general, it is difficult to declare which is the best or the most suitable model to address the analysis of large volumes of traffic collected in operational nano-networks. In this paper, we study the classification problem of nano-network traffic captured by micro/nano-gateway, and then five supervised machine learning algorithms are used to analyze and classify the nano-network traffic from traditional traffic. Experimental analysis of the proposed models is evaluated and compared to show the most adequate classifier for nano-network traffic that gives very good accuracy and performance score to other classifiers., This work was supported in part by the ‘‘Agencia Estatal de Investigación’’ of ‘‘Ministerio de Ciencia e Innovación’’ of Spain under Project PID2019-108713RB-C51/MCIN/AEI/10.13039/501100011033, and in part by the ‘‘Agència de Gestió d’Ajuts Universitaris i de Recerca’’ (AGAUR) of the ‘‘Generalitat de Catalunya’’ under Grant 2021FI_B2 00091.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Deep learning and Internet of Things for tourist attraction recommendations in smart cities

  • Cepeda Pacheco, Juan Carlos
  • Domingo Aladrén, Mari Carmen|||0000-0002-6901-3817
The version of record is available online at: http://dx.doi.org/10.1007/s00521-021-06872-0, We propose a tourist attraction IoT-enabled deep learning-based recommendation system to enhance tourist experience in a smart city. Travelers will enter details about their travels (traveling alone or with a companion, type of companion such as partner or family with kids, traveling for business or leisure, etc.) as well as user side information (age of the traveler/s, hobbies, etc.) into the smart city app/website. Our proposed deep learning-based recommendation system will process this personal set of input features to recommend the tourist activities/attractions that best fit his/her profile. Furthermore, when the tourists are in the smart city, content-based information (already visited attractions) and context-related information (location, weather, time of day, etc.) are obtained in real time using IoT devices; this information will allow our proposed deep learning-based tourist attraction recommendation system to suggest additional activities and/or attractions in real time. Our proposed multi-label deep learning classifier outperforms other models (decision tree, extra tree, k-nearest neighbor and random forest) and can successfully recommend tourist attractions for the first case [(a) searching for and planning activities before traveling] with the loss, accuracy, precision, recall and F1-score of 0.5%, 99.7%, 99.9%, 99.9% and 99.8%, respectively. It can also successfully recommend tourist attractions for the second case [(b) looking for activities within the smart city] with the loss, accuracy, precision, recall and F1-score of 3.7%, 99.5%, 99.8%, 99.7% and 99.8%, respectively., This work has been supported by the Agencia Estatal de Investigación of Spain under project PID2019-108713RB-C51/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Dynamic UPF placement and chaining reconfiguration in 5G networks

  • Leyva Pupo, Irian|||0000-0001-6356-5840
  • Cervelló Pastor, Cristina|||0000-0002-8056-0774
  • Anagnostopoulos, Christos
  • Pezaros, Dimitrios P.
Network function virtualization (NFV) and multi-access edge computing (MEC) have become two crucial pillars in developing 5G and beyond networks. NFV promises cost-saving and fast revenue generation through dynamic instantiation and the scaling of virtual network functions (VNFs) according to time-varying service demands. Additionally, MEC provides considerable reductions in network response time and backhaul traffic since network functions and server applications can be deployed close to users. Nevertheless, the placement and chaining of VNFs at the network edge is challenging due to numerous aspects and attendant trade-offs. This paper addresses the problem of dynamic user plane function placement and chaining reconfiguration (UPCR) in a MEC environment to cope with user mobility while guaranteeing cost reductions and acceptable quality of service (QoS). The problem is formalized as a multi-objective integer linear programming model to minimize multiple cost components involved in the UPCR procedure. We propose a heuristic algorithm called dynamic priority and cautious UPCR (DPC-UPCR) to reduce the solution time complexity. Additionally, we devise a scheduler mechanism based on optimal stopping theory to determine the best reconfiguration time according to instantaneous values of latency violations and a pre-established QoS threshold. Our detailed simulation results evidence the efficiency of the proposed approaches. Specifically, the DPC-UPCR provides near-optimal solutions, within 15% of the optimum in the worst case, in significantly shorter times than the mathematical model. Moreover, the proposed scheduling method outperforms two scheduler baseline solutions regarding the number of reconfiguration events and QoS levels., This work has been supported by the Agencia Estatal de Investigación of Ministerio de Ciencia e Innovación of Spain under project PID2019-108713RB-C51/ MCIN/ AEI/ 10.13039/501100011033 and through a predoctoral FPI scholarship. Additionally, this work was supported in part by the PETRAS National Centre of Excellence for IoT Systems Cybersecurity, which has been funded by the UK EPSRC under grant number EP/S035362/1
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A QoS-Aware Dynamic Bandwidth Allocation algorithm for passive optical networks with non-zero laser tuning time

  • Zehri, Mohammad Habib|||0000-0002-8436-0163
  • Haastrup, Adebanjo
  • Rincón Rivera, David|||0000-0003-1294-3842
  • Piney da Silva, José Ramón|||0000-0003-2563-7836
  • Sallent Ribes, Sebastián|||0000-0002-8232-6180
  • Bazzi, Ali
The deployment of new 5G services and future demands for 6G make it necessary to increase the performance of access networks. This challenge has prompted the development of new standardization proposals for Passive Optical access Networks (PONs) that offer greater bandwidth, greater reach and a higher rate of aggregation of users per fiber, being Time- and Wavelength-Division Multiplexing (TWDM) a promising technological solution for increasing the capacity by up to 40 Gbps by using several wavelengths. This solution introduces tunable transceivers into the Optical Network Units (ONUs) for switching from one wavelength to the other, thus addressing the ever-increasing bandwidth demands in residential broadband and mobile fronthaul networks based on Fiber to the Home (FTTH) technology. This adds complexity and sources of inefficiency, such as the laser tuning time (LTT) delay, which is often ignored when evaluating the performance of Dynamic Bandwidth Allocation (DBA) mechanisms. We present a novel DBA algorithm that dynamically handles the allocation of bandwidth and switches the ONUs’ lasers from one wavelength to the other while taking LTT into consideration. To optimize the packet delay, we introduce a scheduling mechanism that follows the Longest Processing Time first (LPT) scheduling discipline, which is implemented over the Interleaved Polling with Adaptive Cycle Time (IPACT) DBA. We also provide quality of service (QoS) differentiation by introducing the Max-Min Weighted Fair Share Queuing principle (WFQ) into the algorithm. The performance of our algorithm is evaluated through simulations against the original IPACT algorithm, which we have extended to support multi-wavelengths. With the introduction of LPT, we obtain an improved performance of up to 73% reduction in queue delay over IPACT while achieving QoS differentiation with WFQ., This work has been supported by the Agencia Estatal de Investigación of Spain under project PID2019‐108713RB‐C51/AEI/10.13039/501100011033., Peer Reviewed, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura::9.1 - Desenvolupar infraestructures fiables, sostenibles, resilients i de qualitat, incloent infraestructures regionals i transfrontereres, per tal de donar suport al desenvolupament econòmic i al benestar humà, amb especial atenció a l’accés assequible i equitatiu per a totes les persones, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura::9.4 - Per a 2030, modernitzar les infraestructures i reconvertir les indústries perquè siguin sostenibles, usant els recursos amb més eficàcia i promovent l’adopció de tecnologies i processos industrials nets i racionals ambiental­ment, i aconseguint que tots els països adoptin mesures d’acord amb les capacitats respectives
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A distance-weighted dynamic bandwidth allocation algorithm for improved performance in long-reach passive optical networks for next generation networks

  • Haastrup, Adebanjo
  • Zehri, Mohammad Habib|||0000-0002-8436-0163
  • Rincón Rivera, David|||0000-0003-1294-3842
  • Piney da Silva, José Ramón|||0000-0003-2563-7836
  • Bazzi, Ali
In recent years, there has been an increasing trend towards extending the coverage of passive optical networks (PONs) over large geographical areas. Long-reach PONs (LRPONs) are capable of extending the distance covered by PONs from 20 km to 100 km, leading to cost savings in the network operation by reducing the number of central offices. They have become widely deployed due to their ability to provide high-speed, long-distance data transmission over optical fibers. In addition, the next generation of optical access networks are expected to provide high-capacity mobile and wireless backhauling over a wide coverage area. However, this extended reach also requires the design of efficient dynamic bandwidth allocation (DBA) schemes to address the performance degradation caused by the increased propagation delay in LRPONs. The DBA schemes commonly used for upstream traffic transmission in traditional PONs are not well-suited for use in LRPONs due to their inefficiency in bandwidth utilization due to the increased round-trip time (RTT) between the optical line terminal (OLT) and the optical network unit (ONU). In this study, we present an efficient DBA algorithm, the Distance-Weighted Bandwidth Allocation DWDBA Algorithm, specifically enhanced for multi-wavelength LRPONs. Our DBA algorithm utilizes a scheduling policy that assigns weight vectors to Optical Network Units (ONUs) based on their distance from the Optical Line Terminal (OLT), sorting them accordingly without penalizing any ONU due to their distance. The DWDBA takes the laser tuning time into consideration. We conducted extensive simulations to evaluate the performance of the proposed algorithm under various scenarios and compared it to the IPACT algorithm. The results of the simulations show that the proposed algorithm outperformed the IPACT algorithm in terms of bandwidth utilization and queue delay., This work has been supported by the Agencia Estatal de Investigación of Ministerio de Ciencia e Innovación of Spain under project PID2019-108713RB-C51 MCIN/AEI/10.13039/501100011033., Peer Reviewed, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

IoT-enabled proposal for adaptive self-powered renewable energy management in home systems

  • Tipantuña Tenelema, Christian José
  • Hesselbach Serra, Xavier|||0000-0002-7888-3603
© 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., The new generation of communication networks can provide massive connectivity of devices, extremely low latency, higher capacity, and increased bandwidth. These features enable the deployment of management systems in different sectors such as energy and in a wide variety of environments such as agriculture, surveillance or home systems. In this regard, this paper proposes a self-powered adaptive and automated home energy control system enabled by the Internet of Things (IoT) technologies. The system aims to adapt the consumption patterns to the availability of self-generated renewable energy (produced from solar panels, wind-mills, etc.). Therefore, the renewable and non-renewable supply from the power grid is considered a secondary power source. As part of the proposal, this paper presents the consumption negotiation scheme for IoT devices, the management mechanisms to optimize the use of the available energy, and the related model. Given the complexity of the adaptive management process, the proposal also presents a heuristic strategy based on a prepartitioning method to obtain feasible solutions in a reasonable running time. The simulation results for offline and online scenarios validate the advantages of the proposed strategy, and the numerical improvements are presented., This work was supported by the Agencia Estatal de Investigación of Spain under the project PID2019-108713RB-C51/AEI/10.12039/501100011033. ChristianTipantuña acknowledges the support from Escuela Politécnica Nacional (EPN) and from Secretaría de Educación Superior, Ciencia, Tecnología e Innovación(SENESCYT) for his doctoral studies at Universitat Politécnica de Catalunya (UPC)., Award-winning
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

DQN-based intelligent controller for multiple edge domains

  • Llorens Carrodeguas, Alejandro|||0000-0002-4329-7962
  • Cervelló Pastor, Cristina|||0000-0002-8056-0774
  • Valera Pintor, Francisco
Advanced technologies like network function virtualization (NFV) and multi-access edge computing (MEC) have been used to build flexible, highly programmable, and autonomously manageable infrastructures close to the end-users, at the edge of the network. In this vein, the use of single-board computers (SBCs) in commodity clusters has gained attention to deploy virtual network functions (VNFs) due to their low cost, low energy consumption, and easy programmability. This paper deals with the problem of deploying VNFs in a multi-cluster system formed by this kind of node which is characterized by limited computational and battery capacities. Additionally, existing platforms to orchestrate and manage VNFs do not consider energy levels during their placement decisions, and therefore, they are not optimized for energy-constrained environments. In this regard, this study proposes an intelligent controller as a global allocation mechanism based on deep reinforcement learning (DRL), specifically on deep Q-network (DQN). The conceived mechanism optimizes energy consumption in SBCs by selecting the most suitable nodes across several clusters to deploy event requests in terms of nodes’ resources and events’ demands. A comparison with available allocation algorithms revealed that our solution required 28% fewer resource costs and reduced 35% the energy consumption in the clusters’ computing nodes while maintaining high levels of acceptance ratio., This work has been supported in part (50%) by the Agencia Estatal de Investigación of Ministerio de Ciencia e Innovación of Spain under projects PID2019-108713RB-C51 & PID2019-108713RB-C52 MCIN/ AEI/10.13039/501100011033; and in part (50%) by AI@EDGE H2020ICT-52-2020 under grant agreement No. 10101592.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Machine learning requirements for energy-efficient virtual network embedding

  • Hesselbach Serra, Xavier|||0000-0002-7888-3603
  • Escobar Pérez, David
Network virtualization is a technology proven to be a key enabling a family of strategies in different targets, such as energy efficiency, economic revenue, network usage, adaptability or failure protection. Network virtualization allows us to adapt the needs of a network to new circumstances, resulting in greater flexibility. The allocation decisions of the demands onto the physical network resources impact the costs and the benefits. Therefore it is one of the major current problems, called virtual network embedding (VNE). Many algorithms have been proposed recently in the literature to solve the VNE problem for different targets. Due to the current successful rise of artificial intelligence, it has been widely used recently to solve technological problems. In this context, this paper investigates the requirements and analyses the use of the Q-learning algorithm for energy-efficient VNE. The results achieved validate the strategy and show clear improvements in terms of cost/revenue and energy savings, compared to traditional algorithms., This work has been supported by the Agencia Estatal de Investigación of Ministerio de Ciencia e Innovación of Spain under project PID2019-108713RB-C51 MCIN/AEI/10.13039/501100011033., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Efficient solutions to the placement and chaining problem of User Plane Functions in 5G Networks

  • Leyva Pupo, Irian|||0000-0001-6356-5840
  • Cervelló Pastor, Cristina|||0000-0002-8056-0774
This study attempts to solve the placement and chaining problem of 5G User Plane Functions (UPFs) in a Multi-access Edge Computing (MEC) ecosystem. The problem is formalized as a multi-objective Integer Linear Programming (ILP) model targeted at optimizing provisioning costs and quality of service. Our model takes into account several aspects of the system such as UPF-specific considerations, the Service Function Chain (SFC) requests topology (single and multiple branches), Virtual Network Function (VNF) order constraints, service demands, and physical network capacities. Since the formulated problem is NP-hard, two heuristic solutions are devised to enhance solution efficiency. Specifically, an algorithm called Priority and Cautious-UPF Placement and Chaining (PC-UPC) and a simulated annealing (SA) meta-heuristic are proposed. Through extensive simulation experiments, we evaluated the performance of the proposed solutions. The results revealed that our solutions outperformed the baselines (i.e., two greedy-based heuristics and a variant of the classical SA) and that we had obtained nearly optimal solutions with significant reductions in running time. Moreover, the PC-UPC algorithm can effectively avoid SFC rejections and improve provisioning costs by considering session requirements, current network conditions, and the effects of VNF mapping decisions. Additionally, the proposed SA approach incorporates several mechanisms (e.g., variable Markov chain length and restart–stop) that allow the improvement of not only the quality of the solutions but also their computation time.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Novel NFV aware network service for intelligent network slicing based on squatting-kicking model

  • Hamouda, Ahmed Mohamed Abdelaty Elmekkawi|||0000-0002-1374-0601
  • Hesselbach Serra, Xavier|||0000-0002-7888-3603
  • Piney da Silva, José Ramón|||0000-0003-2563-7836
© 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., Future networks starting from 5G will depend on network slicing to meet a wide range of network services (NSs) with various quality of service (QoS) requirements. With the powerful Network Function Virtualization (NFV) technology available, network slices can be rapidly deployed and centrally managed, giving rise to simplified management, high resource utilization, and cost-efficiency. This is achieved by realizing NSs on general-purpose hardware, hence, replacing traditional middleboxes. However, realizing fast deployment of end-to-end network slices still requires intelligent resource allocation algorithms to efficiently use the network resources and ensure QoS among different slice categories during congestion cases. This is especially important at the links of the network because of the scarcity of their resources. Consequently, this paper proposes a paradigm based on NFV architecture aimed at providing the massive computational capacity required in the NSs and supporting the resource allocation strategy proposed for multiple slice networks based on resources utilization optimization using a proposed and analyzed Squatting-Kicking model (SKM). SKM is a suitable algorithm for dynamically allocating network resources to different priority slices along paths and improving resource utilization under congested scenarios. Simulation results show that the proposed service deployment algorithm achieves 100% in terms of both overall resource utilization and admission for higher priority slices in some scenarios in bandwidth-constrained contexts, which cannot be achieved by other existing schemes due to priority constraints., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

An intelligent scheduling for 5G user plane function placement and chaining reconfiguration

  • Leyva Pupo, Irian|||0000-0001-6356-5840
  • Cervelló Pastor, Cristina|||0000-0002-8056-0774
Services and use cases in 5G and beyond networks are characterized by strict requirements such as ultra-low latency, increased capacity, and high user mobility. Moreover, these networks must be capable of satisfying these ambitious demands as well as anticipating and adapting to dynamically changing conditions in a quick and feasible manner. This study deals with the problem of determining the best time to readjust the user plane function (UPF) placement and session mapping configuration to avoid quality of service (QoS) degradation in the system due to user mobility. To this aim, we rely on machine learning (ML) techniques to anticipate poor QoS events and decide whether a reconfiguration procedure is required based on a pre-established QoS tolerance threshold. Specifically, an ML-based framework, called intelligent scheduling of the reconfiguration (ISR), is proposed to automate the reconfiguration process. This framework applies supervised ML methods, either regressors or classifiers, to predict the QoS values/status at a given time horizon. The simulation experiments revealed the proposed mechanism’s superiority compared to the established scheduling baseline. The ISR solution could not only keep the system QoS under desired values most of the time but also reduce the number of readjustment events by at least 50% compared to the baselines., This work has been supported by the Agencia Estatal de Investigación of Ministerio de Ciencia e Innovación of Spain underproject PID2019-108713RB-C51/MCIN/AEI/10.13039/501100011033 and through a predoctoral FPI scholarship.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Toward hyper-realistic and interactive social VR experiences in live TV scenarios

  • Fernández Langa, Sergi
  • Montagud, Mario
  • Cernigliaro, Gianluca
  • Rincón Rivera, David|||0000-0003-1294-3842
© 2022 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., Social Virtual Reality (VR) allows multiple distributed users getting together in shared virtual environments to socially interact and/or collaborate. This article explores the applicability and potential of Social VR in the broadcast sector, focusing on a live TV show use case. For such a purpose, a novel and lightweight Social VR platform is introduced. The platform provides three key outstanding features compared to state-of-the-art solutions. First, it allows a real-time integration of remote users in shared virtual environments, using realistic volumetric representations and affordable capturing systems, thus not relying on the use of synthetic avatars. Second, it supports a seamless and rich integration of heterogeneous media formats, including 3D scenarios, dynamic volumetric representation of users and (live/stored) stereoscopic 2D and 180º/360º videos. Third, it enables low-latency interaction between the volumetric users and a video-based presenter (Chroma keying), and a dynamic control of the media playout to adapt to the session’s evolution. The production process of an immersive TV show to be able to evaluate the experience is also described. On the one hand, the results from objective tests show the satisfactory performance of the platform. On the other hand, the promising results from user tests support the potential impact of the presented platform, opening up new opportunities in the broadcast sector, among others., This work has been partially funded by the European Union’s Horizon 2020 program, under agreement nº 762111 (VRTogether project), and partially by ACCIÓ, under agreement COMRDI18-1-0008 (ViVIM project). Work by Mario Montagud has been additionally funded by the Spanish Ministry of Science, Innovation and Universities with a Juan de la Cierva – Incorporación grant (reference IJCI-2017-34611). The authors would also like to thank the EU H2020 VRTogether project consortium for their relevant and valuable contributions., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

An energy-friendly scheduler for edge computing systems

  • Llorens Carrodeguas, Alejandro|||0000-0002-4329-7962
  • G. Sagkriotis, Stefanos
  • Cervelló Pastor, Cristina|||0000-0002-8056-0774
  • Pezaros, Dimitrios P.
© 2021 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), The deployment of modern applications, like massive Internet of Things (IoT), poses a combination of challenges that service providers need to overcome: high availability of the offered services, low latency, and low energy consumption. To overcome these challenges, service providers have been placing computing infrastructure close to the end users, at the edge of the network. In this vein, single board computer (SBC) clusters have gained attention due to their low cost, low energy consumption, and easy programmability. A subset of IoT applications requires the deployment of battery-powered SBCs, or clusters thereof. More recently, the deployment of services on SBC clusters has been automated through the use of containers. The management of these containers is performed by orchestration platforms, like Kubernetes. However, orchestration platforms do not consider remaining energy levels for their placement decisions and therefore are not optimized for energy-constrained environments. In this study, we propose a scheduler that is optimised for energy-constrained SBC clusters and operates within Kubernetes. Through comparison with the available schedulers we achieved 23% fewer event rejections, 83% less deadline violations, and approximately a 59% reduction of the consumed energy throughout the cluster.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Nfv-enabled efficient renewable and non-renewable energy management: requirements and algorithms

  • Tipantuña Tenelema, Christian José
  • Hesselbach Serra, Xavier|||0000-0002-7888-3603
The increasing worldwide energy demand, the CO2 emissions generated due to the production and use of energy, climate change, and the depletion of natural resources are important concerns that require new solutions for energy generation and management. In order to ensure energy sustainability, measures, including the use of renewable energy sources, the deployment of adaptive energy consumption schemes, and consumer participation, are currently envisioned as feasible alternatives. Accordingly, this paper presents the requirements and algorithmic solutions for efficient management of energy consumption, which aims to optimize the use of available energy, whether or not it is 100% renewable, by minimizing the waste of energy. The proposal works within a Demand-Response environment, uses Network Functions Virtualization as an enabling technology, and leverages the massive connectivity of the Internet of Things provided by modern communications technologies. The energy consumption optimization problem is formulated as an Integer Linear Program. It is optimally solved while using a brute-force search strategy, defined as OPTTS, to detect all concerns that are related to the problem. Given the N P-hard nature of the problem and the non-polynomial complexity of OPTTS, some heuristic solutions are analyzed. Subsequently, a heuristic strategy, described as FASTTS based on a pre-partitioning method, is implemented. The simulation results validate our proposed energy management solution. Exact and heuristic strategies, when deployed in the Network Functions Virtualization domain, demonstrate improvements in the way that energy is consumed, thereby offering an increase in service processing. The evaluation results also show that FASTTS produces high-quality solutions that are close to those of OPTTS while executing 230×–5000× faster., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Deep learning and internet of things for beach monitoring: An experimental study of beach attendance prediction at Castelldefels beach

  • Domingo Aladrén, Mari Carmen|||0000-0002-6901-3817
Smart seaside cities can fully exploit the capabilities brought by Internet of Things (IoT) and artificial intelligence to improve the efficiency of city services in traditional smart city applications: smart home, smart healthcare, smart transportation, smart surveillance, smart environment, cyber security, etc. However, smart coastal cities are characterized by their specific application domain, namely, beach monitoring. Beach attendance prediction is a beach monitoring application of particular importance for coastal managers to successfully plan beach services in terms of security, rescue, health and environmental assistance. In this paper, an experimental study that uses IoT data and deep learning to predict the number of beach visitors at Castelldefels beach (Barcelona, Spain) was developed. Images of Castelldefels beach were captured by a video monitoring system. An image recognition software was used to estimate beach attendance. A deep learning algorithm (deep neural network) to predict beach attendance was developed. The experimental results prove the feasibility of Deep Neural Networks (DNNs) for beach attendance prediction. For each beach, a classification of occupancy was estimated, depending on the number of beach visitors. The proposed model outperforms other machine learning models (decision tree, k-nearest neighbors, and random forest) and can successfully classify seven beach occupancy levels with the Mean Absolute Error (MAE), accuracy, precision, recall and F1-score of 0.03, 92.7%, 92.9%, 92.7%, and 92.7%, respectively.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Deep learning at the mobile edge: Opportunities for 5G networks

  • McClellan, Miranda
  • Cervelló Pastor, Cristina|||0000-0002-8056-0774
  • Sallent Ribes, Sebastián|||0000-0002-8232-6180
Mobile edge computing (MEC) within 5G networks brings the power of cloud computing, storage, and analysis closer to the end-user. The increased speeds and reduced delay enable novel applications such as connected vehicles, large-scale IoT, video streaming, and industry robotics. Machine Learning (ML) is leveraged within mobile edge computing to predict changes in demand based on cultural events, natural disasters, or daily commute patterns, and it prepares the network by automatically scaling up network resources as needed. Together, mobile edge computing andML enable seamless automation of network management to reduce operational costs and enhance user experience. In this paper, we discuss the state of the art for ML within mobile edge computing and the advances needed in automating adaptive resource allocation, mobility modeling, security, and energy efficiency for 5G networks
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Heuristic strategies for NFV-enabled renewable and non-renewable energy management in the future IoT world

  • Tipantuña Tenelema, Christian José
  • Hesselbach Serra, Xavier
  • Unger, Walter
© 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., The ever-growing energy demand and the CO2 emissions caused by energy production and consumption have become critical concerns worldwide and drive new energy management and consumption schemes. In this regard, energy systems that promote green energy, customer-side participation enabled by the Internet of Things (IoT) technologies, and adaptive consumption mechanisms implemented on advanced communications technologies such as the Network Function Virtualization (NFV) emerge as sustainable and de-carbonized alternatives. On these modern schemes, diverse management algorithmic solutions can be deployed to promote the interaction between generation and consumption sides and optimize the use of available energy either from renewable or non-renewable sources. However, existing literature shows that management solutions considering features such as the dynamic nature of renewable energy generation, prioritization in energy provisioning if needed, and time-shifting capabilities to adapt the workloads to energy availability present a complexity NP-Hard. This condition imposes limits on applicability to a small number of energy demands or time-shifting values. Therefore, faster and less complex adaptive energy management approaches are needed. To meet these requirements, this paper proposes three heuristic strategies: a greedy strategy (GreedyTs), a genetic-algorithm-based solution (GATs), and a dynamic programming approach (DPTs) that, when deployed at the NFV domain, seeks the best possible scheduling of demands that lead to efficient energy utilization. The performance of the algorithmic strategies is validated through extensive simulations in several scenarios, demonstrating improvements in energy consumption and processing of demands. Additionally, simulation results reveal that the heuristic approaches produce high-quality solutions close to the optimal while executing among two and seven orders of magnitude faster and with applicability to scenarios with thousands and hundreds of thousands of energy demands., This work was supported by the Ministerio de Ciencia e Innovación of the Spanish Government under Project PID2019-108713RB-C51. The work of Christian Tipantuña was supported in part by the Escuela Politécnica Nacional and in part by Secretaría de Educación Superior, Ciencia, Tecnología e Innovación (SENESCYT)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Gateway placement optimization in LEO satellite networks based on traffic estimation

  • Guo, Jianming
  • Rincón Rivera, David
  • Sallent Ribes, Sebastián
  • Yang, Lei
  • Chen, Xiaoqian
  • Chen, Xianqi
​© 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., Adopting satellite constellations to provide global Internet access services has recently drawn increasing attention. A Low Earth Orbit (LEO) satellite network with multiple satellites has global coverage ability, low latency and independent operation, so it can be an effective complement to terrestrial IP networks. Satellite gateways are placed on the ground and can serve as data exchange points between satellite networks and the Internet. As the placement scheme can affect the network performance, it is a fundamental problem to find appropriate sites for gateways. In this paper, a Gateway Placement Optimization (GPO) method in LEO satellite networks is proposed to solve the problem, which is modeled as a combination optimization problem. Our aim is to select the best places for gateways that can balance the traffic loads with as few gateways as possible. The constraints come from the physical links between gateways and satellites including the link interference, the satellite bandwidth and the number of satellite antennas. The gravity model is used to estimate the traffic matrix from/to gateways and satellites, and then the discrete Particle Swarm Optimization (PSO) algorithm is adopted and modified to solve this problem. Finally, the GPO method is applied to numerical tests involving real satellite constellation networks. Results indicate that our method has good performance and effectiveness., Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura::9.1 - Desenvolupar infraestructures fiables, sostenibles, resilients i de qualitat, incloent infraestructures regionals i transfrontereres, per tal de donar suport al desenvolupament econòmic i al benestar humà, amb especial atenció a l’accés assequible i equitatiu per a totes les persones, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura::9.c - Augmentar de forma significativa l’accés a les tecnologies de la informació i la comunicació i esforçar-se a proporcionar accés universal i assequible a Internet als països menys avançats a tot tardar el 2020, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Novel NFV aware network service for intelligent network slicing based on squatting-kicking model

  • Hamouda, Ahmed Mohamed Abdelaty Elmekkawi
  • Hesselbach Serra, Xavier
  • Piney da Silva, José 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., Future networks starting from 5G will depend on network slicing to meet a wide range of network services (NSs) with various quality of service (QoS) requirements. With the powerful Network Function Virtualization (NFV) technology available, network slices can be rapidly deployed and centrally managed, giving rise to simplified management, high resource utilization, and cost-efficiency. This is achieved by realizing NSs on general-purpose hardware, hence, replacing traditional middleboxes. However, realizing fast deployment of end-to-end network slices still requires intelligent resource allocation algorithms to efficiently use the network resources and ensure QoS among different slice categories during congestion cases. This is especially important at the links of the network because of the scarcity of their resources. Consequently, this paper proposes a paradigm based on NFV architecture aimed at providing the massive computational capacity required in the NSs and supporting the resource allocation strategy proposed for multiple slice networks based on resources utilization optimization using a proposed and analyzed Squatting-Kicking model (SKM). SKM is a suitable algorithm for dynamically allocating network resources to different priority slices along paths and improving resource utilization under congested scenarios. Simulation results show that the proposed service deployment algorithm achieves 100% in terms of both overall resource utilization and admission for higher priority slices in some scenarios in bandwidth-constrained contexts, which cannot be achieved by other existing schemes due to priority constraints., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A QoS-Aware Dynamic Bandwidth Allocation algorithm for passive optical networks with non-zero laser tuning time

  • Zehri, Mohammad Habib
  • Haastrup, Adebanjo
  • Rincón Rivera, David
  • Piney da Silva, José Ramón
  • Sallent Ribes, Sebastián
  • Bazzi, Ali
The deployment of new 5G services and future demands for 6G make it necessary to increase the performance of access networks. This challenge has prompted the development of new standardization proposals for Passive Optical access Networks (PONs) that offer greater bandwidth, greater reach and a higher rate of aggregation of users per fiber, being Time- and Wavelength-Division Multiplexing (TWDM) a promising technological solution for increasing the capacity by up to 40 Gbps by using several wavelengths. This solution introduces tunable transceivers into the Optical Network Units (ONUs) for switching from one wavelength to the other, thus addressing the ever-increasing bandwidth demands in residential broadband and mobile fronthaul networks based on Fiber to the Home (FTTH) technology. This adds complexity and sources of inefficiency, such as the laser tuning time (LTT) delay, which is often ignored when evaluating the performance of Dynamic Bandwidth Allocation (DBA) mechanisms. We present a novel DBA algorithm that dynamically handles the allocation of bandwidth and switches the ONUs’ lasers from one wavelength to the other while taking LTT into consideration. To optimize the packet delay, we introduce a scheduling mechanism that follows the Longest Processing Time first (LPT) scheduling discipline, which is implemented over the Interleaved Polling with Adaptive Cycle Time (IPACT) DBA. We also provide quality of service (QoS) differentiation by introducing the Max-Min Weighted Fair Share Queuing principle (WFQ) into the algorithm. The performance of our algorithm is evaluated through simulations against the original IPACT algorithm, which we have extended to support multi-wavelengths. With the introduction of LPT, we obtain an improved performance of up to 73% reduction in queue delay over IPACT while achieving QoS differentiation with WFQ., This work has been supported by the Agencia Estatal de Investigación of Spain under project PID2019‐108713RB‐C51/AEI/10.13039/501100011033., Peer Reviewed, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura::9.1 - Desenvolupar infraestructures fiables, sostenibles, resilients i de qualitat, incloent infraestructures regionals i transfrontereres, per tal de donar suport al desenvolupament econòmic i al benestar humà, amb especial atenció a l’accés assequible i equitatiu per a totes les persones, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura::9.4 - Per a 2030, modernitzar les infraestructures i reconvertir les indústries perquè siguin sostenibles, usant els recursos amb més eficàcia i promovent l’adopció de tecnologies i processos industrials nets i racionals ambiental­ment, i aconseguint que tots els països adoptin mesures d’acord amb les capacitats respectives, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A distance-weighted dynamic bandwidth allocation algorithm for improved performance in long-reach passive optical networks for next generation networks

  • Haastrup, Adebanjo
  • Zehri, Mohammad Habib
  • Rincón Rivera, David
  • Piney da Silva, José Ramón
  • Bazzi, Ali
In recent years, there has been an increasing trend towards extending the coverage of passive optical networks (PONs) over large geographical areas. Long-reach PONs (LRPONs) are capable of extending the distance covered by PONs from 20 km to 100 km, leading to cost savings in the network operation by reducing the number of central offices. They have become widely deployed due to their ability to provide high-speed, long-distance data transmission over optical fibers. In addition, the next generation of optical access networks are expected to provide high-capacity mobile and wireless backhauling over a wide coverage area. However, this extended reach also requires the design of efficient dynamic bandwidth allocation (DBA) schemes to address the performance degradation caused by the increased propagation delay in LRPONs. The DBA schemes commonly used for upstream traffic transmission in traditional PONs are not well-suited for use in LRPONs due to their inefficiency in bandwidth utilization due to the increased round-trip time (RTT) between the optical line terminal (OLT) and the optical network unit (ONU). In this study, we present an efficient DBA algorithm, the Distance-Weighted Bandwidth Allocation DWDBA Algorithm, specifically enhanced for multi-wavelength LRPONs. Our DBA algorithm utilizes a scheduling policy that assigns weight vectors to Optical Network Units (ONUs) based on their distance from the Optical Line Terminal (OLT), sorting them accordingly without penalizing any ONU due to their distance. The DWDBA takes the laser tuning time into consideration. We conducted extensive simulations to evaluate the performance of the proposed algorithm under various scenarios and compared it to the IPACT algorithm. The results of the simulations show that the proposed algorithm outperformed the IPACT algorithm in terms of bandwidth utilization and queue delay., This work has been supported by the Agencia Estatal de Investigación of Ministerio de Ciencia e Innovación of Spain under project PID2019-108713RB-C51 MCIN/AEI/10.13039/501100011033., Peer Reviewed, Objectius de Desenvolupament Sostenible::9 - Indústria, Innovació i Infraestructura, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Adaptive energy management in 5G network slicing: Requirements, architecture, and strategies

  • Tipantuña Tenelema, Christian José
  • Hesselbach Serra, Xavier
Energy consumption is a critical issue for the communications network operators, impacting deeply the cost of the services, as well as the ecological footprint. Network slicing architecture for 5G mobile communications enables multiple independent virtual networks to be created on top of a common shared physical infrastructure. Each network slice needs different types of resources, including energy, to fulfill the demands requested by each application, operator, or vertical market. The existing literature on network slicing is mainly targeted at the partition of network resources; however, the corresponding management of energy consumption is an unconsidered critical concern. This paper analyzes the requirements for an energy-aware 5G network slicing provisioning according to the 3GPP specifications, proposes an architecture, and studies the strategies to provide efficient energy consumption in terms of renewable and non-renewable sources. NFV and SDN technologies are the essential enablers and leverage the Internet of Things (IoT) connectivity provided by 5G networks. This paper also presents the technical 5G technology documentation related to the proposal, the requirements for adaptive energy management, and the Integer Linear Programming (ILP) formulation of the energy management model. To validate the improvements, an exact optimal algorithmic solution is presented and some heuristic strategies, This work was supported by the Ministerio de Economía y Competitividad of the Spanish Government under project PID2019-108713RB-C51, Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Machine learning requirements for energy-efficient virtual network embedding

  • Hesselbach Serra, Xavier
  • Escobar Pérez, David
Network virtualization is a technology proven to be a key enabling a family of strategies in different targets, such as energy efficiency, economic revenue, network usage, adaptability or failure protection. Network virtualization allows us to adapt the needs of a network to new circumstances, resulting in greater flexibility. The allocation decisions of the demands onto the physical network resources impact the costs and the benefits. Therefore it is one of the major current problems, called virtual network embedding (VNE). Many algorithms have been proposed recently in the literature to solve the VNE problem for different targets. Due to the current successful rise of artificial intelligence, it has been widely used recently to solve technological problems. In this context, this paper investigates the requirements and analyses the use of the Q-learning algorithm for energy-efficient VNE. The results achieved validate the strategy and show clear improvements in terms of cost/revenue and energy savings, compared to traditional algorithms., This work has been supported by the Agencia Estatal de Investigación of Ministerio de Ciencia e Innovación of Spain under project PID2019-108713RB-C51 MCIN/AEI/10.13039/501100011033., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Deep learning and Internet of Things for tourist attraction recommendations in smart cities

  • Cepeda Pacheco, Juan Carlos
  • Domingo Aladrén, Mari Carmen
The version of record is available online at: http://dx.doi.org/10.1007/s00521-021-06872-0, We propose a tourist attraction IoT-enabled deep learning-based recommendation system to enhance tourist experience in a smart city. Travelers will enter details about their travels (traveling alone or with a companion, type of companion such as partner or family with kids, traveling for business or leisure, etc.) as well as user side information (age of the traveler/s, hobbies, etc.) into the smart city app/website. Our proposed deep learning-based recommendation system will process this personal set of input features to recommend the tourist activities/attractions that best fit his/her profile. Furthermore, when the tourists are in the smart city, content-based information (already visited attractions) and context-related information (location, weather, time of day, etc.) are obtained in real time using IoT devices; this information will allow our proposed deep learning-based tourist attraction recommendation system to suggest additional activities and/or attractions in real time. Our proposed multi-label deep learning classifier outperforms other models (decision tree, extra tree, k-nearest neighbor and random forest) and can successfully recommend tourist attractions for the first case [(a) searching for and planning activities before traveling] with the loss, accuracy, precision, recall and F1-score of 0.5%, 99.7%, 99.9%, 99.9% and 99.8%, respectively. It can also successfully recommend tourist attractions for the second case [(b) looking for activities within the smart city] with the loss, accuracy, precision, recall and F1-score of 3.7%, 99.5%, 99.8%, 99.7% and 99.8%, respectively., This work has been supported by the Agencia Estatal de Investigación of Spain under project PID2019-108713RB-C51/AEI/10.13039/501100011033., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

An energy-friendly scheduler for edge computing systems

  • Llorens Carrodeguas, Alejandro
  • G. Sagkriotis, Stefanos
  • Cervelló Pastor, Cristina
  • Pezaros, Dimitrios P.
© 2021 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), The deployment of modern applications, like massive Internet of Things (IoT), poses a combination of challenges that service providers need to overcome: high availability of the offered services, low latency, and low energy consumption. To overcome these challenges, service providers have been placing computing infrastructure close to the end users, at the edge of the network. In this vein, single board computer (SBC) clusters have gained attention due to their low cost, low energy consumption, and easy programmability. A subset of IoT applications requires the deployment of battery-powered SBCs, or clusters thereof. More recently, the deployment of services on SBC clusters has been automated through the use of containers. The management of these containers is performed by orchestration platforms, like Kubernetes. However, orchestration platforms do not consider remaining energy levels for their placement decisions and therefore are not optimized for energy-constrained environments. In this study, we propose a scheduler that is optimised for energy-constrained SBC clusters and operates within Kubernetes. Through comparison with the available schedulers we achieved 23% fewer event rejections, 83% less deadline violations, and approximately a 59% reduction of the consumed energy throughout the cluster., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Nfv-enabled efficient renewable and non-renewable energy management: requirements and algorithms

  • Tipantuña Tenelema, Christian José
  • Hesselbach Serra, Xavier
The increasing worldwide energy demand, the CO2 emissions generated due to the production and use of energy, climate change, and the depletion of natural resources are important concerns that require new solutions for energy generation and management. In order to ensure energy sustainability, measures, including the use of renewable energy sources, the deployment of adaptive energy consumption schemes, and consumer participation, are currently envisioned as feasible alternatives. Accordingly, this paper presents the requirements and algorithmic solutions for efficient management of energy consumption, which aims to optimize the use of available energy, whether or not it is 100% renewable, by minimizing the waste of energy. The proposal works within a Demand-Response environment, uses Network Functions Virtualization as an enabling technology, and leverages the massive connectivity of the Internet of Things provided by modern communications technologies. The energy consumption optimization problem is formulated as an Integer Linear Program. It is optimally solved while using a brute-force search strategy, defined as OPTTS, to detect all concerns that are related to the problem. Given the N P-hard nature of the problem and the non-polynomial complexity of OPTTS, some heuristic solutions are analyzed. Subsequently, a heuristic strategy, described as FASTTS based on a pre-partitioning method, is implemented. The simulation results validate our proposed energy management solution. Exact and heuristic strategies, when deployed in the Network Functions Virtualization domain, demonstrate improvements in the way that energy is consumed, thereby offering an increase in service processing. The evaluation results also show that FASTTS produces high-quality solutions that are close to those of OPTTS while executing 230×–5000× faster., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Multi-party holomeetings: toward a new era of low-cost volumetric holographic meetings in virtual reality

  • Fernández Langa, Sergi
  • Montagud Climent, Mario
  • Cernigliaro, Gianluca
  • Rincón Rivera, David
© 2022 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., Fueled by advances in multi-party communications, increasingly mature immersive technologies being adopted, and the COVID-19 pandemic, a new wave of social virtual reality (VR) platforms have emerged to support socialization, interaction, and collaboration among multiple remote users who are integrated into shared virtual environments. Social VR aims to increase levels of (co-)presence and interaction quality by overcoming the limitations of 2D windowed representations in traditional multi-party video conferencing tools, although most existing solutions rely on 3D avatars to represent users. This article presents a social VR platform that supports real-time volumetric holographic representations of users that are based on point clouds captured by off-the-shelf RGB-D sensors, and it analyzes the platform’s potential for conducting interactive holomeetings (i.e., holoconferencing scenarios). This work evaluates such a platform’s performance and readiness for conducting meetings with up to four users, and it provides insights into aspects of the user experience when using single-camera and low-cost capture systems in scenarios with both frontal and side viewpoints. Overall, the obtained results confirm the platform’s maturity and the potential of holographic communications for conducting interactive multi-party meetings, even when using low-cost systems and single-camera capture systems in scenarios where users are sitting or have a limited translational movement along the X, Y, and Z axes within the 3D virtual environment (commonly known as 3 Degrees of Freedom plus, 3DoF+)., The authors would like to thank the members of the EU H2020 VR-Together consortium for their valuable contributions, especially Marc Martos and Mohamad Hjeij for their support in developing and evaluating tasks. This work has been partially funded by: the EU’s Horizon 2020 program, under agreement nº 762111 (VR-Together project); by ACCIÓ (Generalitat de Catalunya), under agreement COMRDI18-1-0008 (ViVIM project); and by Cisco Research and the Silicon Valley Community Foundation, under the grant Extended Reality Multipoint Control Unit (ID: 1779376). The work by Mario Montagud has been additionally funded by Spain’s Agencia Estatal de Investigación under grant RYC2020-030679-I (AEI / 10.13039/501100011033) and by Fondo Social Europeo. The work of David Rincón was supported by Spain’s Agencia Estatal de Investigación within the Ministerio de Ciencia e Innovación under Project PID2019-108713RB-C51 MCIN/AEI/10.13039/501100011033., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Low complexity nano-networks routing scenarios and strategies

  • Almeida Amazonas, José Roberto de
  • Hesselbach Serra, Xavier
  • Ferreira Giozza, William
© 2021 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, One of the big challenges in nano-networks is the capacity to route packets using simple strategies, in inhospitable and stimulating environments. The strict physical limitations coming from the nano-devices are constraining the design of communication protocols and strategies. Considering the current fabrication processes, existing published strategies require devices at least in micrometer dimensions, what is far yet from what is expected. In this paper, the proposal is on the road to nanometers devices, while considering extremely low energy consumption. The major contributions of this paper are the formulation of the nano-networks routing problem, the proposal of a low complexity Finite State Machine (FSM)-based paradigm to implement routes generation and routing algorithms and the evaluation of the proposed nano-networks routing and strategy., This work has been supported in part by the Ministerio de Ciencia e Innovación of the Spanish Government under project PID2019-108713RB-C51, and also in part by FAP-DF – Brazilian Federal District Research Support Foundation, under Grant SEI 00193.0000248/2019-32 and in part by the Institutional Security Office of the Presidency of Brazil under Grant ABIN/UNB 002/2017, SEI 23106.034057/2017-86, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Machine learning models for traffic classification in electromagnetic nano-networks

  • Galal Mahmoud Ibrahim, Akram
  • Hesselbach Serra, Xavier
The number of nano-sensors connected to wireless electromagnetic nano-network generates different traffic volumes that have increased dramatically, enabling various applications of the Internet of nano-things. Nano-network traffic classification is more challenging nowadays to analyze different types of flows and study the overall performance of a nano-network that connects to the Internet through micro/nanogateways. There are traditional techniques to classify traffic, such as port-based technique and load-based technique, however the most promising technique used recently is machine learning. As machine learning models have a great impact on traffic classification and network performance evaluation in general, it is difficult to declare which is the best or the most suitable model to address the analysis of large volumes of traffic collected in operational nano-networks. In this paper, we study the classification problem of nano-network traffic captured by micro/nano-gateway, and then five supervised machine learning algorithms are used to analyze and classify the nano-network traffic from traditional traffic. Experimental analysis of the proposed models is evaluated and compared to show the most adequate classifier for nano-network traffic that gives very good accuracy and performance score to other classifiers., This work was supported in part by the ‘‘Agencia Estatal de Investigación’’ of ‘‘Ministerio de Ciencia e Innovación’’ of Spain under Project PID2019-108713RB-C51/MCIN/AEI/10.13039/501100011033, and in part by the ‘‘Agència de Gestió d’Ajuts Universitaris i de Recerca’’ (AGAUR) of the ‘‘Generalitat de Catalunya’’ under Grant 2021FI_B2 00091., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Dynamic UPF placement and chaining reconfiguration in 5G networks

  • Leyva Pupo, Irian
  • Cervelló Pastor, Cristina
  • Anagnostopoulos, Christos
  • Pezaros, Dimitrios P.
Network function virtualization (NFV) and multi-access edge computing (MEC) have become two crucial pillars in developing 5G and beyond networks. NFV promises cost-saving and fast revenue generation through dynamic instantiation and the scaling of virtual network functions (VNFs) according to time-varying service demands. Additionally, MEC provides considerable reductions in network response time and backhaul traffic since network functions and server applications can be deployed close to users. Nevertheless, the placement and chaining of VNFs at the network edge is challenging due to numerous aspects and attendant trade-offs. This paper addresses the problem of dynamic user plane function placement and chaining reconfiguration (UPCR) in a MEC environment to cope with user mobility while guaranteeing cost reductions and acceptable quality of service (QoS). The problem is formalized as a multi-objective integer linear programming model to minimize multiple cost components involved in the UPCR procedure. We propose a heuristic algorithm called dynamic priority and cautious UPCR (DPC-UPCR) to reduce the solution time complexity. Additionally, we devise a scheduler mechanism based on optimal stopping theory to determine the best reconfiguration time according to instantaneous values of latency violations and a pre-established QoS threshold. Our detailed simulation results evidence the efficiency of the proposed approaches. Specifically, the DPC-UPCR provides near-optimal solutions, within 15% of the optimum in the worst case, in significantly shorter times than the mathematical model. Moreover, the proposed scheduling method outperforms two scheduler baseline solutions regarding the number of reconfiguration events and QoS levels., This work has been supported by the Agencia Estatal de Investigación of Ministerio de Ciencia e Innovación of Spain under project PID2019-108713RB-C51/ MCIN/ AEI/ 10.13039/501100011033 and through a predoctoral FPI scholarship. Additionally, this work was supported in part by the PETRAS National Centre of Excellence for IoT Systems Cybersecurity, which has been funded by the UK EPSRC under grant number EP/S035362/1, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Efficient solutions to the placement and chaining problem of User Plane Functions in 5G Networks

  • Leyva Pupo, Irian
  • Cervelló Pastor, Cristina
This study attempts to solve the placement and chaining problem of 5G User Plane Functions (UPFs) in a Multi-access Edge Computing (MEC) ecosystem. The problem is formalized as a multi-objective Integer Linear Programming (ILP) model targeted at optimizing provisioning costs and quality of service. Our model takes into account several aspects of the system such as UPF-specific considerations, the Service Function Chain (SFC) requests topology (single and multiple branches), Virtual Network Function (VNF) order constraints, service demands, and physical network capacities. Since the formulated problem is NP-hard, two heuristic solutions are devised to enhance solution efficiency. Specifically, an algorithm called Priority and Cautious-UPF Placement and Chaining (PC-UPC) and a simulated annealing (SA) meta-heuristic are proposed. Through extensive simulation experiments, we evaluated the performance of the proposed solutions. The results revealed that our solutions outperformed the baselines (i.e., two greedy-based heuristics and a variant of the classical SA) and that we had obtained nearly optimal solutions with significant reductions in running time. Moreover, the PC-UPC algorithm can effectively avoid SFC rejections and improve provisioning costs by considering session requirements, current network conditions, and the effects of VNF mapping decisions. Additionally, the proposed SA approach incorporates several mechanisms (e.g., variable Markov chain length and restart–stop) that allow the improvement of not only the quality of the solutions but also their computation time., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

DQN-based intelligent controller for multiple edge domains

  • Llorens Carrodeguas, Alejandro
  • Cervelló Pastor, Cristina
  • Valera Pintor, Francisco
Advanced technologies like network function virtualization (NFV) and multi-access edge computing (MEC) have been used to build flexible, highly programmable, and autonomously manageable infrastructures close to the end-users, at the edge of the network. In this vein, the use of single-board computers (SBCs) in commodity clusters has gained attention to deploy virtual network functions (VNFs) due to their low cost, low energy consumption, and easy programmability. This paper deals with the problem of deploying VNFs in a multi-cluster system formed by this kind of node which is characterized by limited computational and battery capacities. Additionally, existing platforms to orchestrate and manage VNFs do not consider energy levels during their placement decisions, and therefore, they are not optimized for energy-constrained environments. In this regard, this study proposes an intelligent controller as a global allocation mechanism based on deep reinforcement learning (DRL), specifically on deep Q-network (DQN). The conceived mechanism optimizes energy consumption in SBCs by selecting the most suitable nodes across several clusters to deploy event requests in terms of nodes’ resources and events’ demands. A comparison with available allocation algorithms revealed that our solution required 28% fewer resource costs and reduced 35% the energy consumption in the clusters’ computing nodes while maintaining high levels of acceptance ratio., This work has been supported in part (50%) by the Agencia Estatal de Investigación of Ministerio de Ciencia e Innovación of Spain under projects PID2019-108713RB-C51 & PID2019-108713RB-C52 MCIN/ AEI/10.13039/501100011033; and in part (50%) by AI@EDGE H2020ICT-52-2020 under grant agreement No. 10101592., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

IoT-enabled proposal for adaptive self-powered renewable energy management in home systems

  • Tipantuña Tenelema, Christian José
  • Hesselbach Serra, Xavier
© 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., The new generation of communication networks can provide massive connectivity of devices, extremely low latency, higher capacity, and increased bandwidth. These features enable the deployment of management systems in different sectors such as energy and in a wide variety of environments such as agriculture, surveillance or home systems. In this regard, this paper proposes a self-powered adaptive and automated home energy control system enabled by the Internet of Things (IoT) technologies. The system aims to adapt the consumption patterns to the availability of self-generated renewable energy (produced from solar panels, wind-mills, etc.). Therefore, the renewable and non-renewable supply from the power grid is considered a secondary power source. As part of the proposal, this paper presents the consumption negotiation scheme for IoT devices, the management mechanisms to optimize the use of the available energy, and the related model. Given the complexity of the adaptive management process, the proposal also presents a heuristic strategy based on a prepartitioning method to obtain feasible solutions in a reasonable running time. The simulation results for offline and online scenarios validate the advantages of the proposed strategy, and the numerical improvements are presented., This work was supported by the Agencia Estatal de Investigación of Spain under the project PID2019-108713RB-C51/AEI/10.12039/501100011033. ChristianTipantuña acknowledges the support from Escuela Politécnica Nacional (EPN) and from Secretaría de Educación Superior, Ciencia, Tecnología e Innovación(SENESCYT) for his doctoral studies at Universitat Politécnica de Catalunya (UPC)., Award-winning, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Deep learning at the mobile edge: Opportunities for 5G networks

  • McClellan, Miranda
  • Cervelló Pastor, Cristina
  • Sallent Ribes, Sebastián
Mobile edge computing (MEC) within 5G networks brings the power of cloud computing, storage, and analysis closer to the end-user. The increased speeds and reduced delay enable novel applications such as connected vehicles, large-scale IoT, video streaming, and industry robotics. Machine Learning (ML) is leveraged within mobile edge computing to predict changes in demand based on cultural events, natural disasters, or daily commute patterns, and it prepares the network by automatically scaling up network resources as needed. Together, mobile edge computing andML enable seamless automation of network management to reduce operational costs and enhance user experience. In this paper, we discuss the state of the art for ML within mobile edge computing and the advances needed in automating adaptive resource allocation, mobility modeling, security, and energy efficiency for 5G networks, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Deep learning and internet of things for beach monitoring: An experimental study of beach attendance prediction at Castelldefels beach

  • Domingo Aladrén, Mari Carmen
Smart seaside cities can fully exploit the capabilities brought by Internet of Things (IoT) and artificial intelligence to improve the efficiency of city services in traditional smart city applications: smart home, smart healthcare, smart transportation, smart surveillance, smart environment, cyber security, etc. However, smart coastal cities are characterized by their specific application domain, namely, beach monitoring. Beach attendance prediction is a beach monitoring application of particular importance for coastal managers to successfully plan beach services in terms of security, rescue, health and environmental assistance. In this paper, an experimental study that uses IoT data and deep learning to predict the number of beach visitors at Castelldefels beach (Barcelona, Spain) was developed. Images of Castelldefels beach were captured by a video monitoring system. An image recognition software was used to estimate beach attendance. A deep learning algorithm (deep neural network) to predict beach attendance was developed. The experimental results prove the feasibility of Deep Neural Networks (DNNs) for beach attendance prediction. For each beach, a classification of occupancy was estimated, depending on the number of beach visitors. The proposed model outperforms other machine learning models (decision tree, k-nearest neighbors, and random forest) and can successfully classify seven beach occupancy levels with the Mean Absolute Error (MAE), accuracy, precision, recall and F1-score of 0.03, 92.7%, 92.9%, 92.7%, and 92.7%, respectively., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Toward hyper-realistic and interactive social VR experiences in live TV scenarios

  • Fernández Langa, Sergi
  • Montagud, Mario
  • Cernigliaro, Gianluca
  • Rincón Rivera, David
© 2022 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., Social Virtual Reality (VR) allows multiple distributed users getting together in shared virtual environments to socially interact and/or collaborate. This article explores the applicability and potential of Social VR in the broadcast sector, focusing on a live TV show use case. For such a purpose, a novel and lightweight Social VR platform is introduced. The platform provides three key outstanding features compared to state-of-the-art solutions. First, it allows a real-time integration of remote users in shared virtual environments, using realistic volumetric representations and affordable capturing systems, thus not relying on the use of synthetic avatars. Second, it supports a seamless and rich integration of heterogeneous media formats, including 3D scenarios, dynamic volumetric representation of users and (live/stored) stereoscopic 2D and 180º/360º videos. Third, it enables low-latency interaction between the volumetric users and a video-based presenter (Chroma keying), and a dynamic control of the media playout to adapt to the session’s evolution. The production process of an immersive TV show to be able to evaluate the experience is also described. On the one hand, the results from objective tests show the satisfactory performance of the platform. On the other hand, the promising results from user tests support the potential impact of the presented platform, opening up new opportunities in the broadcast sector, among others., This work has been partially funded by the European Union’s Horizon 2020 program, under agreement nº 762111 (VRTogether project), and partially by ACCIÓ, under agreement COMRDI18-1-0008 (ViVIM project). Work by Mario Montagud has been additionally funded by the Spanish Ministry of Science, Innovation and Universities with a Juan de la Cierva – Incorporación grant (reference IJCI-2017-34611). The authors would also like to thank the EU H2020 VRTogether project consortium for their relevant and valuable contributions., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

An SDN-based solution for horizontal auto-scaling and load balancing of transparent VNF clusters

  • Llorens Carrodeguas, Alejandro
  • Leyva Pupo, Irian
  • Cervelló Pastor, Cristina
  • Piñeiro, Luis
  • Siddiqui, Muhammad Shuaib
© 2021 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), This paper studies the problem of the dynamic scaling and load balancing of transparent virtualized network functions (VNFs). It analyzes different particularities of this problem, such as loop avoidance when performing scaling-out actions, and bidirectional flow affinity. To address this problem, a software-defined networking (SDN)-based solution is implemented consisting of two SDN controllers and two OpenFlow switches (OFSs). In this approach, the SDN controllers run the solution logic (i.e., monitoring, scaling, and load-balancing modules). According to the SDN controllers instructions, the OFSs are responsible for redirecting traffic to and from the VNF clusters (i.e., load-balancing strategy). Several experiments were conducted to validate the feasibility of this proposed solution on a real testbed. Through connectivity tests, not only could end-to-end (E2E) traffic be successfully achieved through the VNF cluster, but the bidirectional flow affinity strategy was also found to perform well because it could simultaneously create flow rules in both switches. Moreover, the selected CPU-based load-balancing method guaranteed an average imbalance below 10% while ensuring that new incoming traffic was redirected to the least loaded instance without requiring packet modification. Additionally, the designed monitoring function was able to detect failures in the set of active members in near real-time and active new instances in less than a minute. Likewise, the proposed auto-scaling module had a quick response to traffic changes. Our solution showed that the use of SDN controllers along with OFS provides great flexibility to implement different load-balancing, scaling, and monitoring strategies., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

An intelligent scheduling for 5G user plane function placement and chaining reconfiguration

  • Leyva Pupo, Irian
  • Cervelló Pastor, Cristina
Services and use cases in 5G and beyond networks are characterized by strict requirements such as ultra-low latency, increased capacity, and high user mobility. Moreover, these networks must be capable of satisfying these ambitious demands as well as anticipating and adapting to dynamically changing conditions in a quick and feasible manner. This study deals with the problem of determining the best time to readjust the user plane function (UPF) placement and session mapping configuration to avoid quality of service (QoS) degradation in the system due to user mobility. To this aim, we rely on machine learning (ML) techniques to anticipate poor QoS events and decide whether a reconfiguration procedure is required based on a pre-established QoS tolerance threshold. Specifically, an ML-based framework, called intelligent scheduling of the reconfiguration (ISR), is proposed to automate the reconfiguration process. This framework applies supervised ML methods, either regressors or classifiers, to predict the QoS values/status at a given time horizon. The simulation experiments revealed the proposed mechanism’s superiority compared to the established scheduling baseline. The ISR solution could not only keep the system QoS under desired values most of the time but also reduce the number of readjustment events by at least 50% compared to the baselines., This work has been supported by the Agencia Estatal de Investigación of Ministerio de Ciencia e Innovación of Spain underproject PID2019-108713RB-C51/MCIN/AEI/10.13039/501100011033 and through a predoctoral FPI scholarship., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

SDN-based gateway architecture for electromagnetic nano-networks

  • Galal Mahmoud Ibrahim, Akram
  • Hesselbach Serra, Xavier
  • Tavernier, Wouter
  • Colle, Didier
Electromagnetic nano-communication has increasing attention in recent years. Several developments have been achieved in the fabrication, communication and management of various nano-network devices serving potential applications ranging from softwaredefined metamaterials, wireless robotic materials and body-centric communication. Such applications need uplink and downlink communication between the deployed nano-network and the external macro-world or the Internet through nano-interfaces. As a result, heterogeneous nano-network devices and their interoperability in different Internet of nano-things applications become new challenges for nano-network communication. In this regard, dynamic, flexible and distributed micro/nano-gateways can accommodate such sustainable issues and make the nano-network fully operational, regardless of the adopted application domain or the protocols used in communication. Network functions virtualization and software-defined networking technologies altogether can overcome these challenges. This article proposes SDN-based architecture and software module for the micro/nano-gateway. The proposed software module converts data formats and protocols between nano-network and traditional network domains allowing the nano-devices to be linked to the Internet. A prototype of the module is built, and the performance of the proposed algorithm is evaluated based on two communication scenarios; single tenant and multitenant. The result shows the effect of the total number of connected nano-devices and the number of packets sent by each device on the total average round-trip processing delay and the overall throughput of the micro/nano-gateway., This work has been supported by the ”Agencia Estatal de Investigacion” of Spain under project PID2019-108713RB-C51 ´ / AEI/10.13039/501100011033 and ”Agencia de Gesti ` o d’Ajuts ´ Universitaris i de Recerca” (AGAUR) of the ”Generalitat de Catalunya” under FI-AGAUR grant., Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Static placement and dynamic assignment of SDN controllers in LEO satellite networks

  • Guo, Jianming
  • Yang, Lei
  • Rincón Rivera, David
  • Sallent Ribes, Sebastián
  • Chen, Quan
  • Liu, Xianfeng
​© 2022 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., Software-defined networking (SDN) logically separates the control and data planes, thus opening the way to more flexible configurations and management of low-Earth orbit (LEO) satellite networks. Since one or, more generally, multiple distributed controllers are needed, a significant challenge in SDN is the controller placement problem (CPP). Due to characteristics such as the dynamic network topology, limited bandwidth and traffic variations, the CPP is quite complex in SDN-based satellite networks. In this paper, we propose solving the CPP by means of a static placement with dynamic assignment (SPDA) method for LEO satellite networks. The SPDA method has two parts: the first is to incorporate SDN controllers into some fixed satellites by formulating a mixed integer programming model; the second is to dynamically assign switches to existing controllers according to the switch-controller latency and the traffic load of controllers. The SPDA method takes the topological dynamics into account by effectively dividing time snapshots, and it has a lower bandwidth consumption compared with methods involving controller migrations. Real satellite constellations are used to evaluate the performance of our controller placement solution. The results show that SPDA outperforms existing methods in terms of reducing the switch-controller latency, and it also has good load balancing performance., Postprint (published version)