Skip to main content

APROVISIONAMIENTO DINAMICO DE CONECTIVIDAD EN ESCENARIOS INALAMBRICOS 5G DE ALTA DENSIDAD

TEC2015-71329-C2-2-R

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos I+D+i Retos de Investigación
Call year 2015
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Dirección General de Investigación Científica y Técnica
Beneficiary centre UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

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

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

An alternative procedure to obtain the mortality rate with non-linear functions: Application to the case of the Spanish population

  • Postigo Boix, Marcos|||0000-0002-4182-7376
  • Agüero Calvo, Ramón
  • Melus Moreno, José Luis|||0000-0001-7557-2255
This paper presents an alternative calculation procedure to calculate the mortality rate, exploiting the data available in the Eurostat demography database for Spain. This methodology has been devised based on two of the most widely known and widespread models to establish the mortality rate: The Gompertz-Makeham (GM) and Lee-Carter (LC) models. Our main goal is to obtain a model yielding a similar accuracy than LC or GM, but able to capture the variation of their parameters over time and ages. The method proposed herewith works by applying simple or double fitting, with non-linear functions, to the values of the parameters considered by each one of such models. One of the main advantages of our approach is that we considerably reduce the amount of data that is required to establish the mortality rate, with respect to what would be needed if the traditional models were used. On the other hand, it also allows analyzing the evolution of the mortality rate, even if no real data was available for a particular year. The results evince that, besides fulfilling the two aforementioned goals, the proposed scheme yields an estimation error that is comparable with that offered by the traditional approach., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

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

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

Guaranteed bit rate slicing in WiFi networks

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

A reinforcement learning approach for placement of stateful Virtualized Network Functions

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

Self-adaptive online virtual network migration in network virtualization environments

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

Resource allocation and management techniques for network slicing in WiFi networks

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

Slicing with guaranteed quality of service in WiFi networks

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

A social model based on customers’ profiles for analyzing the churning process in the mobile market of data plans

  • Postigo Boix, Marcos|||0000-0002-4182-7376
  • Melus Moreno, José Luis|||0000-0001-7557-2255
Mobile Network Operators (MNOs) present wireless services of the same kind in identical zones, clients select the service taking into account any element they consider relevant. Churning hits on the design of the network and the method to assign prices by MNOs, and of course their earnings. Therefore, MNOs try to reduce churn detecting potential churners before they leave the service. Our approach to churn prediction considers each customer individually. Previous research shows that members of the social circle of a subscriber may influence churn. Thus, many scenarios that describe social relations, and in which churning processes could be expected, set an emerging challenge with practical implications. This paper uses the Agent-Based Modelling (ABM) technique to model customers. The model’s parameters include demographic and psychographic features as well as usage profiles according to their social behavior considering their customers’ profiles. Our model modifies and extends an existing real social network generator algorithm that considers customer’s profiles and homophily considerations to create connections. We show that using our approach, groups of customers with greater tendency to churn due to the influence of their social networks can be identified better., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Feasibility study to evaluate the potential entry of a new F-MVNO into the Spanish mobile market

  • Tomas, Joaquin
  • Melus Moreno, José Luis|||0000-0001-7557-2255
The mobile market until a decade ago had been composed mainly of Mobile Network Operators (MNOs). To promote greater competition in this market the European Commission (EC) has promoted various actions in the regulatory and policy environment in Europe. This has significantly facilitated the appearance of new players in this market, such as Mobile Virtual Network Operators (MVNOs), which in the case of the Spanish mobile market grew from 4 MNOs to 38 non-homogeneous operators by early 2017. This paper presents an assessment of the economic feasibility of the entry of a new Full-Mobile Virtual Network Operator (F-MVNO) in the Spanish mobile market. This operator does not own band rights and therefore has to negotiate with a host operator (HO) for use of spectrum and has to provide the suitable and necessary devices that route and switch calls. Moreover, it has to ensure the interoperability of its own services with other operators and has to manage the services and traffic generated by its own subscribers. The examples of evaluation analyzed in this work consider six different scenarios over five years. The evaluation for each scenario calculates the average return per user (ARPU) or the income per subscriber and the fixed and variable costs needed to provide the proposed services. The data used in this evaluation are provided by the National Commission for Markets and Competition, NCMC or “la Comisión Nacional de los Mercados y la Competencia, CNMC” in Spain [1], which is in charge of publishing quarterly the available data about the Spanish mobile market. The results show for each scenario the minimum number of subscribers that a new F-MVNO needs to ensure its economic feasibility (break-even point) and the time necessary to reach it. The methodology used in this work may also serve as a guide to assess the economic feasibility of new F-MVNOs entering in other European countries., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Fast and efficient energy-oriented cell assignment in heterogeneous networks

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

Resource slicing in virtual wireless networks: a survey

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

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

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

Extent prediction of the information and influence propagation in online social networks

  • Ortiz Gaona, Raúl Marcelo|||0000-0001-7641-331X
  • Postigo Boix, Marcos|||0000-0002-4182-7376
  • Melus Moreno, José Luis|||0000-0001-7557-2255
“The final publication is available at Springer via http://dx.doi.org/10.1007/s10588-013-9156-z, We present a new mathematical model that predicts the number of users informed and influenced by messages that are propagated in an online social network. Our model is based on a new way of quantifying the tie-strength, which in turn considers the affinity and relevance between nodes. We could verify that the messages to inform and influence, as well as their importance, produce different propagation behaviors in an online social network. We carried out laboratory tests with our model and with the baseline models Linear Threshold and Independent Cascade, which are currently used in many scientific works. The results were evaluated by comparing them with empirical data. The tests show conclusively that the predictions of our model are notably more accurate and precise than the predictions of the baseline models. Our model can contribute to the development of models that maximize the propagation of messages; to predict the spread of viruses in computer networks, mobile telephony and online social networks., This work was carried out by the financing of the Ecuadorian government of President Rafael Correa D. and by FLAMINGO, a Network of Excellence project (318488) supported by the European Commission under the Seventh Framework Program and the project TEC2015-71329-C2-2-R (MINECO/FEDER) from Ministerio de Economía y Competitividad. R.M.O-G. thanks Dr. Joan Serrat Fernández, Dr. Xavier Muñoz and Dr. Josep Fàbrega, professors at the University Polytechnic of Catalonia. Similarly, Dr. Esteban Samaniego Alvarado and PhD student Vladimiro Tobar Solano, professors at Universidad de Cuenca, and the PhD student Lucía Mendez Tapia for the accomplishment of this work., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Resource allocation for network slicing in WiFi access points

  • Richart Gutiérrez, Matías Mario|||0000-0002-9152-3522
  • Baliosian, Javier
  • Serrat Fernández, Juan|||0000-0002-4551-9880
  • Gorricho Moreno, Juan Luis|||0000-0002-6280-1546
  • Agüero Calvo, Ramón
  • Agoulmine, Nazim
Network slicing has recently appeared as one of the most important features that will be provided by 5G networks and is attracting considerable interest from industry and academia. At the wireless edge of these networks, most of the contributions in this area are related to cellular technologies leaving behind WiFi networks. In this work, we present a resource allocation mechanism based on airtime assignment to achieve infrastructure sharing and slicing in WiFi Access Points. The approach is simple and has the potential to be straightforwardly used within scenarios of wireless access infrastructure sharing., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Centrality metrics and line-graph to measure the importance of links in online social networks

  • Ortiz Gaona, Raúl
  • Postigo Boix, Marcos|||0000-0002-4182-7376
  • Melus Moreno, José Luis|||0000-0001-7557-2255
Importance of nodes and tie strength are necessary elements to characterize and analyze networks, as well as to study the processes that occur in their interior. We believe that it is also necessary to know the importance of links to have a better characterization of the networks in the study of those processes. In response to this situation, we propose a method to measure the importance of the links.The method is based on applying the line-graph mathematical concept to the graph representing the network, thus we create a new graph in which we apply centrality metrics to find the importance of network links.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

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

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

Slicing in WiFi networks through airtime-based resource allocation

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

Generating demand functions for data plans from mobile network operators based on users’ profiles

  • Postigo Boix, Marcos|||0000-0002-4182-7376
  • Melus Moreno, José Luis|||0000-0001-7557-2255
The final publication is available at Springer via http://dx.doi.org/10.1007/s10922-018-9448-1, The evaluation of pricing approaches for mobile data services proposed in the literature can rarely be done in practice. Evaluation by simulation is the most common practice. In these proposals demand and utility functions that describe the reaction of users to offered service prices, use traditional and arbitrary functions (linear, exponential, logit, etc.). In this paper, we present a new approach to construct a simulation model whose output can be used as an alternative method to create demand functions avoiding to use arbitrary and predefined demand functions. However, it is out of the scope of this paper to utilize them to propose pricing approaches, since the main objective of this article is to show the difference between the arbitrary demand functions used and our approach that come from users’ data. The starting point in this paper is to consider data offered from Eurostat, although other data sources could be used for the same purposes with the aim to offer more realistic values that could characterize more appropriately, what users are demanding. In this sense, some demographic and psychographic characteristics of the users are included and others such as the utilization of application usage profiles, as parameters that are included in the user`s profiles. These characteristics and usage profiles make up the user profile that will influence users’ behavior in the model. Using the same procedure, Mobile Network Operators could feed their customers’ data into the model and use it to validate their pricing approaches more accurately before their real implementation or simulate future or hypothetical scenarios. It also makes possible to segment users and make insights for decision-making. Results presented in this paper refer to a simple study case, since the purpose of the paper is to show how the proposal model works and to reveal its differences with arbitrary demand functions used. Of course, results depend on the set of parameters assigned to characterize each user’s profile., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Resource allocation and management techniques for network slicing in WiFi networks

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

Generating demand functions for data plans from mobile network operators based on users’ profiles

  • Postigo Boix, Marcos
  • Melus Moreno, José Luis
The final publication is available at Springer via http://dx.doi.org/10.1007/s10922-018-9448-1, The evaluation of pricing approaches for mobile data services proposed in the literature can rarely be done in practice. Evaluation by simulation is the most common practice. In these proposals demand and utility functions that describe the reaction of users to offered service prices, use traditional and arbitrary functions (linear, exponential, logit, etc.). In this paper, we present a new approach to construct a simulation model whose output can be used as an alternative method to create demand functions avoiding to use arbitrary and predefined demand functions. However, it is out of the scope of this paper to utilize them to propose pricing approaches, since the main objective of this article is to show the difference between the arbitrary demand functions used and our approach that come from users’ data. The starting point in this paper is to consider data offered from Eurostat, although other data sources could be used for the same purposes with the aim to offer more realistic values that could characterize more appropriately, what users are demanding. In this sense, some demographic and psychographic characteristics of the users are included and others such as the utilization of application usage profiles, as parameters that are included in the user`s profiles. These characteristics and usage profiles make up the user profile that will influence users’ behavior in the model. Using the same procedure, Mobile Network Operators could feed their customers’ data into the model and use it to validate their pricing approaches more accurately before their real implementation or simulate future or hypothetical scenarios. It also makes possible to segment users and make insights for decision-making. Results presented in this paper refer to a simple study case, since the purpose of the paper is to show how the proposal model works and to reveal its differences with arbitrary demand functions used. Of course, results depend on the set of parameters assigned to characterize each user’s profile., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Resource allocation for network slicing in WiFi access points

  • Richart Gutiérrez, Matías Mario
  • Baliosian, Javier
  • Serrat Fernández, Juan
  • Gorricho Moreno, Juan Luis
  • Agüero Calvo, Ramón
  • Agoulmine, Nazim
Network slicing has recently appeared as one of the most important features that will be provided by 5G networks and is attracting considerable interest from industry and academia. At the wireless edge of these networks, most of the contributions in this area are related to cellular technologies leaving behind WiFi networks. In this work, we present a resource allocation mechanism based on airtime assignment to achieve infrastructure sharing and slicing in WiFi Access Points. The approach is simple and has the potential to be straightforwardly used within scenarios of wireless access infrastructure sharing., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Fast and efficient energy-oriented cell assignment in heterogeneous networks

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

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

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

A reinforcement learning approach for placement of stateful Virtualized Network Functions

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

Feasibility study to evaluate the potential entry of a new F-MVNO into the Spanish mobile market

  • Tomas, Joaquin
  • Melus Moreno, José Luis
The mobile market until a decade ago had been composed mainly of Mobile Network Operators (MNOs). To promote greater competition in this market the European Commission (EC) has promoted various actions in the regulatory and policy environment in Europe. This has significantly facilitated the appearance of new players in this market, such as Mobile Virtual Network Operators (MVNOs), which in the case of the Spanish mobile market grew from 4 MNOs to 38 non-homogeneous operators by early 2017. This paper presents an assessment of the economic feasibility of the entry of a new Full-Mobile Virtual Network Operator (F-MVNO) in the Spanish mobile market. This operator does not own band rights and therefore has to negotiate with a host operator (HO) for use of spectrum and has to provide the suitable and necessary devices that route and switch calls. Moreover, it has to ensure the interoperability of its own services with other operators and has to manage the services and traffic generated by its own subscribers. The examples of evaluation analyzed in this work consider six different scenarios over five years. The evaluation for each scenario calculates the average return per user (ARPU) or the income per subscriber and the fixed and variable costs needed to provide the proposed services. The data used in this evaluation are provided by the National Commission for Markets and Competition, NCMC or “la Comisión Nacional de los Mercados y la Competencia, CNMC” in Spain [1], which is in charge of publishing quarterly the available data about the Spanish mobile market. The results show for each scenario the minimum number of subscribers that a new F-MVNO needs to ensure its economic feasibility (break-even point) and the time necessary to reach it. The methodology used in this work may also serve as a guide to assess the economic feasibility of new F-MVNOs entering in other European countries., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Centrality metrics and line-graph to measure the importance of links in online social networks

  • Ortiz Gaona, Raúl
  • Postigo Boix, Marcos
  • Melus Moreno, José Luis
Importance of nodes and tie strength are necessary elements to characterize and analyze networks, as well as to study the processes that occur in their interior. We believe that it is also necessary to know the importance of links to have a better characterization of the networks in the study of those processes. In response to this situation, we propose a method to measure the importance of the links.The method is based on applying the line-graph mathematical concept to the graph representing the network, thus we create a new graph in which we apply centrality metrics to find the importance of network links., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Guaranteed bit rate slicing in WiFi networks

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

An alternative procedure to obtain the mortality rate with non-linear functions: Application to the case of the Spanish population

  • Postigo Boix, Marcos
  • Agüero Calvo, Ramón
  • Melus Moreno, José Luis
This paper presents an alternative calculation procedure to calculate the mortality rate, exploiting the data available in the Eurostat demography database for Spain. This methodology has been devised based on two of the most widely known and widespread models to establish the mortality rate: The Gompertz-Makeham (GM) and Lee-Carter (LC) models. Our main goal is to obtain a model yielding a similar accuracy than LC or GM, but able to capture the variation of their parameters over time and ages. The method proposed herewith works by applying simple or double fitting, with non-linear functions, to the values of the parameters considered by each one of such models. One of the main advantages of our approach is that we considerably reduce the amount of data that is required to establish the mortality rate, with respect to what would be needed if the traditional models were used. On the other hand, it also allows analyzing the evolution of the mortality rate, even if no real data was available for a particular year. The results evince that, besides fulfilling the two aforementioned goals, the proposed scheme yields an estimation error that is comparable with that offered by the traditional approach., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Extent prediction of the information and influence propagation in online social networks

  • Ortiz Gaona, Raúl Marcelo
  • Postigo Boix, Marcos
  • Melus Moreno, José Luis
“The final publication is available at Springer via http://dx.doi.org/10.1007/s10588-013-9156-z, We present a new mathematical model that predicts the number of users informed and influenced by messages that are propagated in an online social network. Our model is based on a new way of quantifying the tie-strength, which in turn considers the affinity and relevance between nodes. We could verify that the messages to inform and influence, as well as their importance, produce different propagation behaviors in an online social network. We carried out laboratory tests with our model and with the baseline models Linear Threshold and Independent Cascade, which are currently used in many scientific works. The results were evaluated by comparing them with empirical data. The tests show conclusively that the predictions of our model are notably more accurate and precise than the predictions of the baseline models. Our model can contribute to the development of models that maximize the propagation of messages; to predict the spread of viruses in computer networks, mobile telephony and online social networks., This work was carried out by the financing of the Ecuadorian government of President Rafael Correa D. and by FLAMINGO, a Network of Excellence project (318488) supported by the European Commission under the Seventh Framework Program and the project TEC2015-71329-C2-2-R (MINECO/FEDER) from Ministerio de Economía y Competitividad. R.M.O-G. thanks Dr. Joan Serrat Fernández, Dr. Xavier Muñoz and Dr. Josep Fàbrega, professors at the University Polytechnic of Catalonia. Similarly, Dr. Esteban Samaniego Alvarado and PhD student Vladimiro Tobar Solano, professors at Universidad de Cuenca, and the PhD student Lucía Mendez Tapia for the accomplishment of this work., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Resource slicing in virtual wireless networks: a survey

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

A social model based on customers’ profiles for analyzing the churning process in the mobile market of data plans

  • Postigo Boix, Marcos
  • Melus Moreno, José Luis
Mobile Network Operators (MNOs) present wireless services of the same kind in identical zones, clients select the service taking into account any element they consider relevant. Churning hits on the design of the network and the method to assign prices by MNOs, and of course their earnings. Therefore, MNOs try to reduce churn detecting potential churners before they leave the service. Our approach to churn prediction considers each customer individually. Previous research shows that members of the social circle of a subscriber may influence churn. Thus, many scenarios that describe social relations, and in which churning processes could be expected, set an emerging challenge with practical implications. This paper uses the Agent-Based Modelling (ABM) technique to model customers. The model’s parameters include demographic and psychographic features as well as usage profiles according to their social behavior considering their customers’ profiles. Our model modifies and extends an existing real social network generator algorithm that considers customer’s profiles and homophily considerations to create connections. We show that using our approach, groups of customers with greater tendency to churn due to the influence of their social networks can be identified better., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Slicing with guaranteed quality of service in WiFi networks

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

Self-adaptive online virtual network migration in network virtualization environments

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

Slicing in WiFi networks through airtime-based resource allocation

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

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

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

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

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