Pasar al contenido principal

DISEÑANDO UNA INFRAESTRUCTURA DE RED 5G DEFINIDA MEDIANTE CONOCIMIENTO HACIA LA PROXIMA SOCIEDAD DIGITAL

TEC2017-90034-C2-1-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2017
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

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

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

A skewness-aware matrix factorization approach for mesh-structured cloud services

  • Fu, Yongquan
  • Li, Dongsheng
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Huang, Chun
  • Huang, Zhen
  • Shen, Siqi
  • Su, Huayou
© 2019 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., Online cloud services need to fulfill clients' requests scalably and fast. State-of-the-art cloud services are increasingly deployed as a distributed service mesh. Service to service communication is frequent in the mesh. Unfortunately, problematic events may occur between any pair of nodes in the mesh, therefore, it is vital to maximize the network visibility. A state-of-the-art approach is to model pairwise RTTs based on a latent factor model represented as a low-rank matrix factorization. A latent factor corresponds to a rank-1 component in the factorization model, and is shared by all node pairs. However, different node pairs usually experience a skewed set of hidden factors, which should be fully considered in the model. In this paper, we propose a skewness-aware matrix factorization method named SMF. We decompose the matrix factorization into basic units of rank-one latent factors, and progressively combine rank-one factors for different node pairs. We present a unifying framework to automatically and adaptively select the rank-one factors for each node pair, which not only preserves the low rankness of the matrix model, but also adapts to skewed network latency distributions. Over real-world RTT data sets, SMF significantly improves the relative error by a factor of 0.2 x to 10 x, converges fast and stably, and compactly captures fine-grained local and global network latency structures., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Network measurements for web tracking analysis and detection: A tutorial

  • Castell Uroz, Ismael
  • Solé Pareta, Josep|||0000-0002-9411-6308
  • Barlet Ros, Pere|||0000-0001-7837-0886
Digital society has developed to a point where it is nearly impossible for a user to know what it is happening in the background when using the Internet. To understand it, it is necessary to perform network measurements not only at the network layer (e.g., IP, ICMP), but also at the application layer (e.g., HTTP). For example, opening a single website can trigger a cascade of requests to different servers and services to obtain the resources embedded inside it. This process is becoming so complex that, to explore only one website, the number of communications can explode easily from tens to hundreds depending on the website. Inside those communications, there is an ever-increasing portion dedicated to web tracking, a controversial practice from the security and privacy perspective [1]., This work was supported by the Spanish MINECO under contract TEC2017-90034-C2-1-R (ALLIANCE)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

RouteNet: leveraging graph neural networks for network modeling and optimization in SDN

  • Rusek, Krzysztof
  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Almasan Puscas, Felician Paul|||0000-0003-3903-6759
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
© 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 modeling is a key enabler to achieve efficient network operation in future self-driving Software-Defined Networks. However, we still lack functional network models able to produce accurate predictions of Key Performance Indicators (KPI) such as delay, jitter or loss at limited cost. In this paper we propose RouteNet, a novel network model based on Graph Neural Network (GNN) that is able to understand the complex relationship between topology, routing, and input traffic to produce accurate estimates of the per-source/destination per-packet delay distribution and loss. RouteNet leverages the ability of GNNs to learn and model graph-structured information and as a result, our model is able to generalize over arbitrary topologies, routing schemes and traffic intensity. In our evaluation, we show that RouteNet is able to predict accurately the delay distribution (mean delay and jitter) and loss even in topologies, routing and traffic unseen in the training (worst case MRE = 15.4%). Also, we present several use cases where we leverage the KPI predictions of our GNN model to achieve efficient routing optimization and network planning., This work was supported in part by the Polish Ministryof Science and Higher Education with the subvention funds of the Facultyof Computer Science, Electronics and Telecommunications, AGH University,in part by the Spanish MINECO under Contract TEC2017-90034-C2-1-R(ALLIANCE), in part by the Catalan Institution for Research and AdvancedStudies (ICREA) and the FI-AGAUR Grant by the Catalan Government, andin part by PL-Grid Infrastructure., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Spatial partitioning for proactive spectrum fragmentation avoidance in flex-grid/SDM dynamic optical core networks

  • Comellas Colomé, Jaume|||0000-0002-9129-0562
  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Solé Pareta, Josep|||0000-0002-9411-6308
  • Junyent Giralt, Gabriel|||0000-0003-0059-7700
Spectrum fragmentation has always been a major issue to overcome toward spectrally efficient Flex-Grid over Single-Mode Fiber dynamic optical networks and continues like so when evolving to Flex-Grid over Spatial Division Multiplexing (SDM). A possible strategy to eliminate its pernicious effects is to divide the available spectrum into several partitions, dedicating each one of them to only support connections with identical spectral requirements. In this way, a first-fit spectrum assignment ensures that spectral gaps at each spectral partition will always match the bandwidth needs of future connection requests. In this paper, we extend this strategy to be applicable to Flex-Grid/SDM dynamic optical networks. Furthermore, leveraging the spatial multiplicity offered by SDM, we also investigate spatial partitioning as an effective yet simpler and more easily manageable solution to also eliminate the spectrum fragmentation negative effects. Both strategies are numerically evaluated in two reference Flex-Grid/SDM backbone networks with ׿7 spatial multiplicity, yielding noteworthy carried network load gains up to 18% versus a non-partitioned network scenario. When increasing the spatial multiplicities up to ׿30, such gains tend to stabilize around 3–4%. Some results are also obtained under unexpected traffic profile deviations, showing that, even under moderate deviations, partitioning becomes beneficial. Comparing spectral and spatial partitioning, they tend to perform quite similar in all cases. This makes us advocate for spatial partitioning as a more interesting solution for spectrum fragmentation avoidance in this kind of networks., This work has been partially funded by Spanish projects TWINS (TEC2017-90097-R) and ALLIANCE (TEC2017-90034-C2-1-R)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Routing in optical transport networks with deep reinforcement learning

  • Suárez Varela, José
  • Mestres Sugranyes, Albert
  • Yu, Junlin
  • Kuang, Li
  • Feng, Haoyu
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Barlet Ros, Pere|||0000-0001-7837-0886
Deep reinforcement learning (DRL) has recently revolutionized the resolution of decision-making and automated control problems. In the context of networking, there is a growing trend in the research community to apply DRL algorithms to optimization problems such as routing. However, existing proposals fail to achieve good results, often under-performing traditional routing techniques. We argue that the reason behind this poor performance is that they use straightforward representations of networks. In this paper, we propose a DRL-based solution for routing in optical transport networks (OTNs). Contrary to previous works, we propose a more elaborate representation of the network state that reduces the level of knowledge abstraction required for DRL agents and easily captures the singularities of network topologies. Our evaluation results show that using our novel representation, DRL agents achieve better performance and learn how to route traffic in OTNs significantly faster compared to state-of-the-art representations. Additionally, we reverse engineered the routing strategy learned by our DRL agent, and as a result, we found a routing algorithm that outperforms well-known traditional routing heuristics., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Computing graph neural networks: A survey from algorithms to accelerators

  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
  • Jain, Akshay|||0000-0002-6986-2720
  • Guirado Liñan, Robert
  • López Alonso, Jorge
  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
Graph Neural Networks (GNNs) have exploded onto the machine learning scene in recent years owing to their capability to model and learn from graph-structured data. Such an ability has strong implications in a wide variety of fields whose data are inherently relational, for which conventional neural networks do not perform well. Indeed, as recent reviews can attest, research in the area of GNNs has grown rapidly and has lead to the development of a variety of GNN algorithm variants as well as to the exploration of ground-breaking applications in chemistry, neurology, electronics, or communication networks, among others. At the current stage research, however, the efficient processing of GNNs is still an open challenge for several reasons. Besides of their novelty, GNNs are hard to compute due to their dependence on the input graph, their combination of dense and very sparse operations, or the need to scale to huge graphs in some applications. In this context, this article aims to make two main contributions. On the one hand, a review of the field of GNNs is presented from the perspective of computing. This includes a brief tutorial on the GNN fundamentals, an overview of the evolution of the field in the last decade, and a summary of operations carried out in the multiple phases of different GNN algorithm variants. On the other hand, an in-depth analysis of current software and hardware acceleration schemes is provided, from which a hardware-software, graph-aware, and communication-centric vision for GNN accelerators is distilled., This work is possible thanks to funding from the European Union’s Horizon 2020 research and innovation programme under Grant No. 863337 (WiPLASH project) and the Spanish Ministry of Economy and Competitiveness under contract TEC2017-90034-C2-1-R (ALLIANCE project) that receives funding from FEDER., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Random number generation by coherent detection of quantum phase noise

  • Álvarez, Juan Rafael
  • Sarmiento Hernández, Samael|||0000-0001-6549-8426
  • Lázaro Villa, José Antonio|||0000-0002-5592-8434
  • Gené Bernaus, Joan M.|||0000-0002-1082-9408
  • Pérez Torres, Juan|||0000-0002-4454-6676
In 2010 Qi et al. [Opt. Lett. 35(3), 312 (2010)] demonstrated a random number generator based on the drift of the phase of a laser due to spontaneous emission, The out-of-the-lab implementation of this scheme presents two main drawbacks: it requires a long and highly unbalanced interferometer to generate a random phase with uniform probability distribution, or alternatively, a shorter and slightly unbalanced interferometer that notwithstanding requires active stabilization and does not generate a uniform probability distribution without randomness extraction. Here we demonstrate that making use of the random nature of the phase difference between two independent laser sources and two coherent detectors we can overcome these limitations. The two main advantages of the system demonstrated are: i) it generates a probability distribution of quantum origin which is intrinsically uniform and thus in principle needs no randomness extraction for obtaining a uniform distribution, and ii) the phase is measured with telecom equipment routinely used for high capacity coherent optical communications. The speed of random bit generation is determined by the photodetector bandwidth and the linewidth of the lasers. As a by-product of our method, we have obtained images of how phase noise develops with time in a laser. This provides a highly visual alternative way of measuring the coherence time of a laser., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Route, modulation format, MIMO and spectrum assignment in Flex-Grid/MCF transparent optical core networks

  • Rumipamba Zambrano, Rubén Darío
  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Spadaro, Salvatore|||0000-0002-4100-1726
In this paper, we target an optimal multiple-input multiple-output digital signal processing (MIMO-DSP) assignment to super-channels affected by intercore crosstalk (ICXT) in multicore fiber (MCF) enabled transparent optical core networks. MIMO-DSP undoes ICXT effects, but can be costly with high core density MCFs. Hence, its implementation in the network must be carefully decided. We address our objective as a joint route, modulation format, MIMO and spectrum assignment (RMMSA) problem, for which integer linear programming formulations are provided to optimally solve it in small network scenarios. Moreover, several heuristic approaches are also proposed to solve large-scale problem instances with good accuracy. Their goal is to minimize both network spectral requirements and the amount of MIMO equalized super-channels, taking a crosstalk-free space division multiplexing (SDM) solution as a reference, for example, based on parallel single mode fibers [i.e., a multifiber (MF) scenario]. For our evaluation, we consider several state-of-the-art MCF prototypes and different network topologies. The obtained results, with the considered MCFs, disclose that in national backbone networks, the desirable percentage of super-channels with MIMO equalization to match the performance of an equivalent crosstalk-free SDM solution ranges from 0% to 36, while in continental-wide networks this range raises from 0% to 56%. In addition, in the case of a nonideal MIMO (with a 3 dB/km of crosstalk compensation), such percentages range from 0% to 28% and from 0% to 45% in national and continental-wide backbone networks, respectively, experimenting a performance gap up to 12% with respect to the MF reference scenario., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

NetXplain: Real-time explainability of graph neural networks applied to networking

  • Pujol Perich, David
  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Xiao, Shihan
  • Wu, Bo
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Barlet Ros, Pere|||0000-0001-7837-0886
Recent advancements in Deep Learning (DL) have revolutionized the way we can efficiently tackle complex optimization problems. However, existing DL-based solutions are often considered as black boxes with high inner complexity. As a result, there is still certain skepticism among the networking industry about their practical viability to operate data networks. In this context, explainability techniques have recently emerged to unveil why DL models make each decision. This paper focuses on the explainability of Graph Neural Networks (GNNs) applied to networking. GNNs are a novel DL family with unique properties to generalize over graphs. As a result, they have shown unprecedented performance to solve complex network optimization problems. This paper presents NetXplain, a novel real-time explainability solution that uses a GNN to interpret the output produced by another GNN. In the evaluation, we apply the proposed explainability method to RouteNet, a GNN model that predicts end-to-end QoS metrics in networks. We show that NetXplain operates more than 3 orders of magnitude faster than state-of-the-art explainability solutions when applied to networks up to 24 nodes, which makes it compatible with real-time applications; while demonstrating strong capabilities to generalize to network scenarios not seen during training., This work has been supported by the Spanish MINECO under contract TEC2017‑90034‑C2‑1‑R (ALLIANCE) and the Catalan Institution for Research and Advanced Studies (ICREA)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Decision-making under uncertainty for the deployment of future hyperconnected networks: A survey

  • Alzate Mejía, Nestor
  • Santos Boada, Germán|||0000-0002-9528-2287
  • Almeida Amazonas, José Roberto de
This paper is an extended version of our paper published in “Néstor Alzate Mejía, Germán Santos-Boada, José R. de Almeida Amazonas, Decision-Making Under Uncertainty for the Deployment of Future Networks in IoT Scenarios” 11th EAI International Conference on Broadband Communications, Networks, and Systems, 11–12 December 2020., Among the several emerging dimensioning, control and deployment of future communication network paradigms stands out the human-centric characteristic that creates an intricate relationship between telematics and human activities. The hard to model dynamics of user behavior introduces new uncertainties into these systems that give rise to difficult network resource management challenges. According to this context, this work reviews several decision-making computational methods under the influence of uncertainties. This work, by means of a systematic literature review, focuses on sensor-based Internet of Things scenarios such as Smart Spaces and Industry 4.0. According to our conclusions, it is mandatory to establish a means for modeling the human behavior context in order to improve resource assignment and management., This research was funded by Spanish Ministry of Economy and Competitiveness under contract TEC2017-90034-C2-1-R (ALLIANCE project) that received funding from FEDER. Moreover, it was partially supported by the Spanish Thematic Network under contract RED2018-102585-T (Go2Edge) and by the aid granted by the Sinfoni project INV2733 of the Cooperative University of Colombia., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

End-user traffic policing for QoS assurance in polyservice RINA networks

  • León Gaixas, Sergio
  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Careglio, Davide|||0000-0002-7931-8147
  • Grasa, Eduard
  • Tarzan Lorente, Miquel
Looking at the ever-increasing amount of heterogeneous distributed applications supported on current data transport networks, it seems evident that best-effort packet delivery falls short to supply their actual needs. Multiple approaches to Quality of Service (QoS) differentiation have been proposed over the years, but their usage has always been hindered by the rigidness of the TCP/IP-based Internet model, which does not even allow for applications to express their QoS needs to the underlying network. In this context, the Recursive InterNetwork Architecture (RINA) has appeared as a clean-slate network architecture aiming to replace the current Internet based on TCP/IP. RINA provides a well-defined QoS support across layers, with standard means for layers to inform of the different QoS guarantees that they can support. Besides, applications and other processes can express their flow requirements, including different QoS-related measures, like delay and jitter, drop probability or average traffic usage. Greedy end-users, however, tend to request the highest quality for their flows, forcing providers to apply intelligent data rate limitation procedures at the edge of their networks. In this work, we propose a new rate limiting policy that, instead of enforcing limits on a per QoS class basis, imposes limits on several independent QoS dimensions. This offers a flexible traffic control to RINA network providers, while enabling end-users freely managing their leased resources. The performance of the proposed policy is assessed in an experimental RINA network test-bed and its performance compared against other policies, either RINA-specific or adopted from TCP/IP. Results show that the proposed policy achieves an effective traffic control for high QoS traffic classes, while also letting lower QoS classes to take profit of the capacity initially reserved for the former ones when available., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A universal specification for multicore fiber crosstalk

  • Gené Bernaus, Joan M.|||0000-0002-1082-9408
  • Winzer, Peter J.
© 2019 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., In order to transition multi-core fiber (MCF) technologies from their research state to volume production, the key design specifications have to be broadly agreed upon, first and foremost an acceptable level of inter-core crosstalk per unit length. Against common belief, we show that MCF crosstalk requirements per unit length are fairly independent of transmission distance in the context of modern coherent optical communication systems. As a consequence, a single value for the tolerable inter-core crosstalk per unit length can be used to specify MCFs, valid from metropolitan (~100 km) to trans-pacific (~10 000 km) deployment scenarios. The notion of a universal inter-core crosstalk specification allows for application-independent MCF designs (including a distance-independent optimum core density) and will facilitate the standardization and volume manufacturing of MCF., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Survey on terahertz nanocommunication and networking: A top-down perspective

  • Lemic, Filip
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
  • Tavernier, Wouter
  • Stroobant, Pieter
  • Colle, Didier
  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
  • Marquez-Barja, Johann
  • Famaey, Jeroen
Recent developments in nanotechnology herald nanometer-sized devices expected to bring light to a number of groundbreaking applications. Communication with and among nanodevices will be needed for unlocking the full potential of such applications. As the traditional communication approaches cannot be directly applied in nanocommunication, several alternative paradigms have emerged. Among them, electromagnetic nanocommunication in the terahertz (THz) frequency band is particularly promising, mainly due to the breakthrough of novel materials such as graphene. For this reason, numerous research efforts are nowadays targeting THz band nanocommunication and consequently nanonetworking. As it is expected that these trends will continue in the future, we see it beneficial to summarize the current status in these research domains. In this survey, we therefore aim to provide an overview of the current THz nanocommunication and nanonetworking research. Specifically, we discuss the applications envisioned to be supported by nanonetworks operating in the THz band, together with the requirements such applications pose on the underlying nanonetworks. Subsequently, we provide an overview of the current contributions on the different layers of the protocol stack, as well as the available channel models and experimentation tools. Finally, we identify a number of open research challenges and outline several future research directions., The author Filip Lemic was supported by the EU Marie Skłodowska-Curie Actions Individual Fellowships (MSCAIF) project Scalable Localization-enabled In-body Terahertz Nanonetwork (SCaLeITN, grant nr. 893760). The author Pieter Stroobant was supported by a PhD grant of Ghent University’s Special Research Fund (BOF). This work was partly funded by the Ghent University’s BOF/GOA project “Autonomic Networked Multimedia Systems”. This work was also supported by the Spanish Ministry of Economy and Competitiveness under contract TEC2017-90034-C2-1-R (ALLIANCE project) that receives funding from FEDER, and by the European Commission under grants No. 736876 and No. 863337., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Results and achievements of the ALLIANCE Project: New network solutions for 5G and beyond

  • Careglio, Davide|||0000-0002-7931-8147
  • Spadaro, Salvatore|||0000-0002-4100-1726
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Lázaro Villa, José Antonio|||0000-0002-5592-8434
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Gené Bernaus, Joan M.|||0000-0002-1082-9408
  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Agraz Bujan, Fernando|||0000-0001-8958-0088
  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Pagès Raventós, Albert
  • Paillissé Vilanova, Jordi|||0000-0001-7733-9713
  • Almasan Puscas, Felician Paul|||0000-0003-3903-6759
  • Domingo Pascual, Jordi|||0000-0001-6277-7542
  • Solé Pareta, Josep|||0000-0002-9411-6308
Leaving the current 4th generation of mobile communications behind, 5G will represent a disruptive paradigm shift integrating 5G Radio Access Networks (RANs), ultra-high-capacity access/metro/core optical networks, and intra-datacentre (DC) network and computational resources into a single converged 5G network infrastructure. The present paper overviews the main achievements obtained in the ALLIANCE project. This project ambitiously aims at architecting a converged 5G-enabled network infrastructure satisfying those needs to effectively realise the envisioned upcoming Digital Society. In particular, we present two networking solutions for 5G and beyond 5G (B5G), such as Software Defined Networking/Network Function Virtualisation (SDN/NFV) on top of an ultra-high-capacity spatially and spectrally flexible all-optical network infrastructure, and the clean-slate Recursive Inter-Network Architecture (RINA) over packet networks, including access, metro, core and DC segments. The common umbrella of all these solutions is the Knowledge-Defined Networking (KDN)-based orchestration layer which, by implementing Artificial Intelligence (AI) techniques, enables an optimal end-to-end service provisioning. Finally, the cross-layer manager of the ALLIANCE architecture includes two novel elements, namely the monitoring element providing network and user data in real time to the KDN, and the blockchain-based trust element in charge of exchanging reliable and confident information with external domains., This work has been partially funded by the Spanish Ministry of Economy and Competitiveness under contract FEDER TEC2017-90034-C2 (ALLIANCE project) and by the Generalitat de Catalunya under contract 2017SGR-1037 and 2017SGR-605., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

The graph neural networking challenge: a worldwide competition for education in AI/ML for networks

  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Ferriol Galmés, Miquel|||0000-0002-7806-2979
  • López Brescó, Albert|||0009-0005-0611-5516
  • Almasan Puscas, Felician Paul|||0000-0003-3903-6759
  • Bernárdez Gil, Guillermo
  • Pujol Perich, David
  • Rusek, Krzysztof
  • Bonniot, Loïck
  • Neumann, Christoph
  • Schnitzler, François
  • Taïani, François
  • Happ, Martin
  • Barlet Ros, Pere|||0000-0001-7837-0886
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
During the last decade, Machine Learning (ML) has increasingly become a hot topic in the field of Computer Networks and is expected to be gradually adopted for a plethora of control, monitoring and management tasks in real-world deployments. This poses the need to count on new generations of students, researchers and practitioners with a solid background in ML applied to networks. During 2020, the International Telecommunication Union (ITU) has organized the "ITU AI/ML in 5G challenge", an open global competition that has introduced to a broad audience some of the current main challenges in ML for networks. This large-scale initiative has gathered 23 different challenges proposed by network operators, equipment manufacturers and academia, and has attracted a total of 1300+ participants from 60+ countries. This paper narrates our experience organizing one of the proposed challenges: the "Graph Neural Networking Challenge 2020". We describe the problem presented to participants, the tools and resources provided, some organization aspects and participation statistics, an outline of the top-3 awarded solutions, and a summary with some lessons learned during all this journey. As a result, this challenge leaves a curated set of educational resources openly available to anyone interested in the topic., This work has received funding from the European Union’s H2020 research and innovation programme within the framework of the NGI-POINTER Project funded under grant agreement No. 871528. This paper reflects only the authors’ view; the European Commission is not responsible for any use that may be made of the information it contains. This work was also supported by the Spanish MINECO under contract TEC2017-90034-C2-1-R (ALLIANCE), the Catalan Institution for Research and Advanced Studies (ICREA), and by FI-AGAUR grant by the Catalan Government. Salzburg Research is grateful for the support by the WISS 2025 (Science and Innovation Strategy Salzburg 2025) project ”IDALab Salzburg” (20204-WISS/225/197-2019 and 20102-F1901166-KZP) and the 5G-AI-MLab by the Federal Ministry for Climate Action, Environment, Energy, Mobility, Innovation and Technology (BMK) and the Austrian state Salzburg., Peer Reviewed, Article escrit per 24 autors/autores: José Suárez-Varela (1), Miquel Ferriol-Galmés (1), Albert López (1), Paul Almasan (1), Guillermo Bernárdez (1), David Pujol-Perich (1), Krzysztof Rusek (1,2), Loïck Bonniot (3, 4), Christoph Neumann (3), François Schnitzler (3), François Taïani (4), Martin Happ (5, 6), Christian Maier (5), Jia Lei Du (5), Matthias Herlich (5), Peter Dorfinger (5), Nick Vincent Hainke (7), Stefan Venz (7), Johannes Wegener (7), Henrike Wissing (7), Bo Wu (8), Shihan Xiao (8), Pere Barlet-Ros (1), Albert Cabellos-Aparicio (1). 1- Barcelona Neural Networking center, Universitat Politècnica de Catalunya, Spain. 2- AGH University of Science and Technology, Department of Telecommunications, Poland. 3- InterDigital, France. 4- Univ. Rennes, Inria, CNRS, IRISA, France. 5- Salzburg Research Forschungsgesellschaft mbH, Austria. 6- IDA Lab, University of Salzburg, Austria. 7- Fraunhofer HHI, Germany. 8- Network Technology Lab., Huawei Technologies Co., Ltd., China.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

IGNNITION: Bridging the gap between graph neural networks and networking systems

  • Pujol Perich, David
  • Suárez-Varela Maciá, José Rafael|||0000-0002-7141-3414
  • Ferriol Galmés, Miquel|||0000-0002-7806-2979
  • Xiao, Shihan
  • Wu, Bo
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Barlet Ros, Pere|||0000-0001-7837-0886
Recent years have seen the vast potential of graph neural networks (GNN) in many fields where data is structured as graphs (e.g., chemistry, recommender systems). In particular, GNNs are becoming increasingly popular in the field of networking, as graphs are intrinsically present at many levels (e.g., topology, routing). The main novelty of GNNs is their ability to generalize to other networks unseen during training, which is an essential feature for developing practical machine learning (ML) solutions for networking. However, implementing a functional GNN prototype is currently a cumbersome task that requires strong skills in neural network programming. This poses an important barrier to network engineers that often do not have the necessary ML expertise. In this article, we present IGNNITION, a novel open source framework that enables fast prototyping of GNNs for networking systems. IGNNITION is based on an intuitive high-level abstraction that hides the complexity behind GNNs, while still offering great flexibility to build custom GNN architectures. To showcase the versatility and performance of this framework, we implement two state-of-the-art GNN models applied to different networking use cases. Our results show that the GNN models produced by IGNNITION are equivalent in terms of accuracy and performance to their native implementations in TensorFlow., This open source project has received funding from the European Union’s Horizon 2020 research and innovation programme within the framework of the NGI-POINTER Project funded under grant agreement No. 871528. This article reflects only the author’s view; the European Commission is not responsible for any use that may be made of the information it contains. The work was also supported by the Spanish MINECO under contract TEC2017-90034-C2-1-R (ALLIANCE) and the Catalan Institution for Research and Advanced Studies (ICREA), Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Flexible resource provisioning of polarization independent coherent PONs based on non-orthogonal multiple access and multiCAP modulation

  • Izquierdo Nuñez, David
  • Sarmiento Hernández, Samael|||0000-0001-6549-8426
  • Barrio Segura, Miguel
  • Clemente Vicente, Jesús
  • Millán, Pablo
  • Lázaro Villa, José Antonio|||0000-0002-5592-8434
  • Garces Gregorio, Juan Ignacio
  • Altabas Navarro, José Antonio
  • Puerta, Rafael
  • Rommel, Simon
  • Vegas Olmos, Juan J.
  • Tafur Monroy, Idelfonso
A combined non-orthogonal multiple access (NOMA) and multiband carrierless amplitude and phase modulation (multiCAP) scheme is proposed for flexible resource provisioning in coherent passive optical networks (PONs). While the proposed combination increases the data-rate and the number of users through the inclusion of NOMA and multiCAP, the coherent reception increases the range and splitting factor of the network through optical power budget enhancement. The proposed system is experimentally evaluated providing a 20 Gb/s aggregated data-rate per wavelength with 10G optoelectronics and applied in two main PON scenarios with four spectral configurations from full-band CAP to four-band multiCAP. The first PON scenario consists of an existing PON that the network operator requires to increase the number of users; NOMA with full-band CAP or multiCAP can be introduced replacing one or more users of the existing PON by one or several new sub-networks and multiplexing the sub-networks by NOMA. In the other PON scenario, several PONs can be nested sharing an initial splitter and achieving a larger number of users by the combination of NOMA and multiCAP. The proposed techniques are fully compatible with other multiplexing techniques such as dense wavelength division multiplexing, which should be considered to achieve higher numbers of users., Gobierno de Aragón (T20_20R); Ministerio de Economía y Competitividad (TEC2017-85752-R, TEC2017-90034-C2-2-R); Electronic Components and Systems for European Leadership (H2020/ECSEL BRAINE - 876967)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Immersive interconnected virtual and augmented reality: a 5G and IoT perspective

  • Torres Vega, Maria
  • Liaskos, Christos
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
  • Papapetrou, Evangelos
  • Jain, Akshay|||0000-0002-6986-2720
  • Mouhouche, Belkacem
  • Kalem, Gokhan
  • Ergüt, Salih
  • Mach, Marian
  • Sabol, Tomas
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Grimm, Christoph
  • De Turck, Filip
  • Famaey, Jeroen
The final publication is available at Springer via http://dx.doi.org/10.1007/s10922-020-09545-w, Despite remarkable advances, current augmented and virtual reality (AR/VR) applications are a largely individual and local experience. Interconnected AR/VR, where participants can virtually interact across vast distances, remains a distant dream. The great barrier that stands between current technology and such applications is the stringent end-to-end latency requirement, which should not exceed 20 ms in order to avoid motion sickness and other discomforts. Bringing AR/VR to the next level to enable immersive interconnected AR/VR will require significant advances towards 5G ultra-reliable low-latency communication (URLLC) and a Tactile Internet of Things (IoT). In this article, we articulate the technical challenges to enable a future AR/VR end-to-end architecture, that combines 5G URLLC and Tactile IoT technology to support this next generation of interconnected AR/VR applications. Through the use of IoT sensors and actuators, AR/VR applications will be aware of the environmental and user context, supporting human-centric adaptations of the application logic, and lifelike interactions with the virtual environment. We present potential use cases and the required technological building blocks. For each of them, we delve into the current state of the art and challenges that need to be addressed before the dream of remote AR/VR interaction can become reality., Maria Torres Vega is funded by the Research Foundation Flanders (FWO), grant number 12W4819N. This work has been partially supported by the Spanish Ministry of Economy and Competitiveness under contract TEC2017-90034-C2-1-R (ALLIANCE project) that receives funding from FEDER, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A multicast routing scheme for the Internet: simulation and experimentation in large-scale networks

  • Careglio, Davide|||0000-0002-7931-8147
  • Agraz Bujan, Fernando|||0000-0001-8958-0088
  • Papadimitriou, Dimitri
With the globalisation of the multimedia entertainment industry and the popularity of streaming and content services, multicast routing is (re-)gaining interest as a bandwidth saving technique. In the 1990’s, multicast routing received a great deal of attention from the research community; nevertheless, its main problems still remain mostly unaddressed and do not reach the acceptance level required for its wide deployment. Among other reasons, the scaling limitation and the relative complexity of the standard multicast protocol architecture can be attributed to the conventional approach of overlaying the multicast routing on top of the unicast routing topology. In this paper, we present the Greedy Compact Multicast Routing (GCMR) scheme. GMCR is characterised by its scalable architecture and independence from any addressing and unicast routing schemes; more specifically, the local knowledge of the cost to direct neighbour nodes is enough for the GCMR scheme to properly operate. The branches of the multicast tree are constructed directly by the joining destination nodes which acquire the routing information needed to reach the multicast source by means of an incremental two-stage search process. In this paper we present the details of GCMR and evaluate its performance in terms of multicast tree size (i.e., the stretch), the memory space consumption, the communication cost, and the transmission cost. The comparative performance analysis is performed against one reference algorithm and two well-known protocol standards. Both simulation and emulation results show that GCMR achieves the expected performance objectives and provide the guidelines for further improvements., This work has been partially funded by the Spanish Ministry of Economy and Competitiveness under contract FEDER TEC2017-90034-C2 (ALLIANCE project) and supported but not funded by the Generalitat de Catalunya under contract 2017SGR-1037., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A GRASP meta-heuristic for evaluating the latency and lifetime impact of critical nodes in large wireless sensor networks

  • Sembroiz Ausejo, David
  • Ojaghi Kahjogh, Behnam
  • Careglio, Davide|||0000-0002-7931-8147
  • Ricciardi, Sergio|||0000-0002-0960-421X
Wireless Sensor Networks (WSN) have lately been gaining momentum thanks to the hardware improvements and standardization software efforts. Moreover, the appearance of Internet of Things (IoT) and its reliance on sensors are helping to widely extend the usage of WSNs. However, such networks present drawbacks, mainly because of limited sensor batteries and their vulnerability against physical attacks due to the lack of protection and security. Additionally, not all the sensors inside the network have the same responsibility in terms of traffic handling. In this paper, we firstly analyze the fact that some nodes are more critical than others, considering the most critical node the one that, once incapacitated, causes the most deterioration on the network performance. Such performance is analyzed using two metrics, namely network latency and lifetime. We present a result comparison between a Mixed Integer Programming (MIP) model and a Greedy Randomized Adaptive Search Procedure (GRASP) meta-heuristic for small networks. For bigger networks, GRASP meta-heuristic results are presented to understand how the network degrades as the number of both critical and network nodes increase, by distributing them into two different areas: fixed and incremental to maintain node density., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Greenfield gradual migration planning toward spectrally-spatially flexible optical networks

  • Lechowicz, Piotr
  • Goscien, Roza
  • Rumipamba Zambrano, Rubén Darío
  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Spadaro, Salvatore|||0000-0002-4100-1726
  • Walkowiak, Krzysztof
© 2019 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, This article identifies the unavoidably required upgrade of short-term realizable elastic optical networks (EONs) operating over single-mode fibers toward spectrally-spatially flexible optical networks (SS-FONs), exploiting spatial division multiplexing (SDM) technology in order to cope with the expected mid- and long-term future traffic forecasts. Since a complete EON to SS-FON network migration overnight is unrealistic, this article proposes a gradual greenfield migration strategy employing novel heuristic planning solutions. These solutions allow identifying which network components should be SDM-capable so as to support the forecasted traffic increase at a given time. To allow transmission in an SS-FON, links should be extended with SDM-capable fibers and nodes should be equipped with SDM-capable reconfigurable optical add/drop multiplexers. Using the proposed solutions, a migration case study in a national reference core network is provided and analyzed., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Decentralized trust in the inter-domain routing infrastructure

  • Paillissé Vilanova, Jordi|||0000-0001-7733-9713
  • Manrique, Jan
  • Bonet, Guillem
  • Rodríguez Natal, Alberto
  • Maino, Fabio
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
Inter-domain routing security is of critical importance to the Internet since it prevents unwanted traffic redirections. The current system is based on a Public Key Infrastructure (PKI), a centralized repository of digital certificates. However, the inherent centralization of such design creates tensions between its participants and hinders its deployment. In addition, some technical drawbacks of PKIs delay widespread adoption. In this paper we present IPchain, a blockchain to store the allocations and delegations of IP addresses. IPchain leverages blockchains' properties to decentralize trust among its participants, with the final goal of providing flexible trust models that adapt better to the ever-changing geopolitical landscape. Moreover, we argue that Proof of Stake is a suitable consensus algorithm for IPchain due to the unique incentive structure of this use-case, and that blockchains offer relevant technical advantages when compared to existing systems, such as simplified management. In order to show its feasibility and suitability, we have implemented and evaluated IPchain's performance and scalability storing around 350k IP prefixes in a 2.5 GB chain., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A GRASP meta-heuristic for evaluating the latency and lifetime impact of critical nodes in large wireless sensor networks

  • Sembroiz Ausejo, David
  • Ojaghi Kahjogh, Behnam
  • Careglio, Davide
  • Ricciardi, Sergio
Wireless Sensor Networks (WSN) have lately been gaining momentum thanks to the hardware improvements and standardization software efforts. Moreover, the appearance of Internet of Things (IoT) and its reliance on sensors are helping to widely extend the usage of WSNs. However, such networks present drawbacks, mainly because of limited sensor batteries and their vulnerability against physical attacks due to the lack of protection and security. Additionally, not all the sensors inside the network have the same responsibility in terms of traffic handling. In this paper, we firstly analyze the fact that some nodes are more critical than others, considering the most critical node the one that, once incapacitated, causes the most deterioration on the network performance. Such performance is analyzed using two metrics, namely network latency and lifetime. We present a result comparison between a Mixed Integer Programming (MIP) model and a Greedy Randomized Adaptive Search Procedure (GRASP) meta-heuristic for small networks. For bigger networks, GRASP meta-heuristic results are presented to understand how the network degrades as the number of both critical and network nodes increase, by distributing them into two different areas: fixed and incremental to maintain node density., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

End-user traffic policing for QoS assurance in polyservice RINA networks

  • León Gaixas, Sergio
  • Perelló Muntan, Jordi
  • Careglio, Davide
  • Grasa, Eduard
  • Tarzan Lorente, Miquel
Looking at the ever-increasing amount of heterogeneous distributed applications supported on current data transport networks, it seems evident that best-effort packet delivery falls short to supply their actual needs. Multiple approaches to Quality of Service (QoS) differentiation have been proposed over the years, but their usage has always been hindered by the rigidness of the TCP/IP-based Internet model, which does not even allow for applications to express their QoS needs to the underlying network. In this context, the Recursive InterNetwork Architecture (RINA) has appeared as a clean-slate network architecture aiming to replace the current Internet based on TCP/IP. RINA provides a well-defined QoS support across layers, with standard means for layers to inform of the different QoS guarantees that they can support. Besides, applications and other processes can express their flow requirements, including different QoS-related measures, like delay and jitter, drop probability or average traffic usage. Greedy end-users, however, tend to request the highest quality for their flows, forcing providers to apply intelligent data rate limitation procedures at the edge of their networks. In this work, we propose a new rate limiting policy that, instead of enforcing limits on a per QoS class basis, imposes limits on several independent QoS dimensions. This offers a flexible traffic control to RINA network providers, while enabling end-users freely managing their leased resources. The performance of the proposed policy is assessed in an experimental RINA network test-bed and its performance compared against other policies, either RINA-specific or adopted from TCP/IP. Results show that the proposed policy achieves an effective traffic control for high QoS traffic classes, while also letting lower QoS classes to take profit of the capacity initially reserved for the former ones when available., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A multicast routing scheme for the Internet: simulation and experimentation in large-scale networks

  • Careglio, Davide
  • Agraz Bujan, Fernando
  • Papadimitriou, Dimitri
With the globalisation of the multimedia entertainment industry and the popularity of streaming and content services, multicast routing is (re-)gaining interest as a bandwidth saving technique. In the 1990’s, multicast routing received a great deal of attention from the research community; nevertheless, its main problems still remain mostly unaddressed and do not reach the acceptance level required for its wide deployment. Among other reasons, the scaling limitation and the relative complexity of the standard multicast protocol architecture can be attributed to the conventional approach of overlaying the multicast routing on top of the unicast routing topology. In this paper, we present the Greedy Compact Multicast Routing (GCMR) scheme. GMCR is characterised by its scalable architecture and independence from any addressing and unicast routing schemes; more specifically, the local knowledge of the cost to direct neighbour nodes is enough for the GCMR scheme to properly operate. The branches of the multicast tree are constructed directly by the joining destination nodes which acquire the routing information needed to reach the multicast source by means of an incremental two-stage search process. In this paper we present the details of GCMR and evaluate its performance in terms of multicast tree size (i.e., the stretch), the memory space consumption, the communication cost, and the transmission cost. The comparative performance analysis is performed against one reference algorithm and two well-known protocol standards. Both simulation and emulation results show that GCMR achieves the expected performance objectives and provide the guidelines for further improvements., This work has been partially funded by the Spanish Ministry of Economy and Competitiveness under contract FEDER TEC2017-90034-C2 (ALLIANCE project) and supported but not funded by the Generalitat de Catalunya under contract 2017SGR-1037., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Survey on terahertz nanocommunication and networking: A top-down perspective

  • Lemic, Filip
  • Abadal Cavallé, Sergi
  • Tavernier, Wouter
  • Stroobant, Pieter
  • Colle, Didier
  • Alarcón Cot, Eduardo José
  • Marquez-Barja, Johann
  • Famaey, Jeroen
Recent developments in nanotechnology herald nanometer-sized devices expected to bring light to a number of groundbreaking applications. Communication with and among nanodevices will be needed for unlocking the full potential of such applications. As the traditional communication approaches cannot be directly applied in nanocommunication, several alternative paradigms have emerged. Among them, electromagnetic nanocommunication in the terahertz (THz) frequency band is particularly promising, mainly due to the breakthrough of novel materials such as graphene. For this reason, numerous research efforts are nowadays targeting THz band nanocommunication and consequently nanonetworking. As it is expected that these trends will continue in the future, we see it beneficial to summarize the current status in these research domains. In this survey, we therefore aim to provide an overview of the current THz nanocommunication and nanonetworking research. Specifically, we discuss the applications envisioned to be supported by nanonetworks operating in the THz band, together with the requirements such applications pose on the underlying nanonetworks. Subsequently, we provide an overview of the current contributions on the different layers of the protocol stack, as well as the available channel models and experimentation tools. Finally, we identify a number of open research challenges and outline several future research directions., The author Filip Lemic was supported by the EU Marie Skłodowska-Curie Actions Individual Fellowships (MSCAIF) project Scalable Localization-enabled In-body Terahertz Nanonetwork (SCaLeITN, grant nr. 893760). The author Pieter Stroobant was supported by a PhD grant of Ghent University’s Special Research Fund (BOF). This work was partly funded by the Ghent University’s BOF/GOA project “Autonomic Networked Multimedia Systems”. This work was also supported by the Spanish Ministry of Economy and Competitiveness under contract TEC2017-90034-C2-1-R (ALLIANCE project) that receives funding from FEDER, and by the European Commission under grants No. 736876 and No. 863337., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A universal specification for multicore fiber crosstalk

  • Gené Bernaus, Joan M.
  • Winzer, Peter J.
© 2019 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., In order to transition multi-core fiber (MCF) technologies from their research state to volume production, the key design specifications have to be broadly agreed upon, first and foremost an acceptable level of inter-core crosstalk per unit length. Against common belief, we show that MCF crosstalk requirements per unit length are fairly independent of transmission distance in the context of modern coherent optical communication systems. As a consequence, a single value for the tolerable inter-core crosstalk per unit length can be used to specify MCFs, valid from metropolitan (~100 km) to trans-pacific (~10 000 km) deployment scenarios. The notion of a universal inter-core crosstalk specification allows for application-independent MCF designs (including a distance-independent optimum core density) and will facilitate the standardization and volume manufacturing of MCF., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Decision-making under uncertainty for the deployment of future hyperconnected networks: A survey

  • Alzate Mejía, Nestor
  • Santos Boada, Germán
  • Almeida Amazonas, José Roberto de
This paper is an extended version of our paper published in “Néstor Alzate Mejía, Germán Santos-Boada, José R. de Almeida Amazonas, Decision-Making Under Uncertainty for the Deployment of Future Networks in IoT Scenarios” 11th EAI International Conference on Broadband Communications, Networks, and Systems, 11–12 December 2020., Among the several emerging dimensioning, control and deployment of future communication network paradigms stands out the human-centric characteristic that creates an intricate relationship between telematics and human activities. The hard to model dynamics of user behavior introduces new uncertainties into these systems that give rise to difficult network resource management challenges. According to this context, this work reviews several decision-making computational methods under the influence of uncertainties. This work, by means of a systematic literature review, focuses on sensor-based Internet of Things scenarios such as Smart Spaces and Industry 4.0. According to our conclusions, it is mandatory to establish a means for modeling the human behavior context in order to improve resource assignment and management., This research was funded by Spanish Ministry of Economy and Competitiveness under contract TEC2017-90034-C2-1-R (ALLIANCE project) that received funding from FEDER. Moreover, it was partially supported by the Spanish Thematic Network under contract RED2018-102585-T (Go2Edge) and by the aid granted by the Sinfoni project INV2733 of the Cooperative University of Colombia., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Decentralized trust in the inter-domain routing infrastructure

  • Paillissé Vilanova, Jordi
  • Manrique, Jan
  • Bonet, Guillem
  • Rodríguez Natal, Alberto
  • Maino, Fabio
  • Cabellos Aparicio, Alberto
Inter-domain routing security is of critical importance to the Internet since it prevents unwanted traffic redirections. The current system is based on a Public Key Infrastructure (PKI), a centralized repository of digital certificates. However, the inherent centralization of such design creates tensions between its participants and hinders its deployment. In addition, some technical drawbacks of PKIs delay widespread adoption. In this paper we present IPchain, a blockchain to store the allocations and delegations of IP addresses. IPchain leverages blockchains' properties to decentralize trust among its participants, with the final goal of providing flexible trust models that adapt better to the ever-changing geopolitical landscape. Moreover, we argue that Proof of Stake is a suitable consensus algorithm for IPchain due to the unique incentive structure of this use-case, and that blockchains offer relevant technical advantages when compared to existing systems, such as simplified management. In order to show its feasibility and suitability, we have implemented and evaluated IPchain's performance and scalability storing around 350k IP prefixes in a 2.5 GB chain., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Immersive interconnected virtual and augmented reality: a 5G and IoT perspective

  • Torres Vega, Maria
  • Liaskos, Christos
  • Abadal Cavallé, Sergi
  • Papapetrou, Evangelos
  • Jain, Akshay
  • Mouhouche, Belkacem
  • Kalem, Gokhan
  • Ergüt, Salih
  • Mach, Marian
  • Sabol, Tomas
  • Cabellos Aparicio, Alberto
  • Grimm, Christoph
  • De Turck, Filip
  • Famaey, Jeroen
The final publication is available at Springer via http://dx.doi.org/10.1007/s10922-020-09545-w, Despite remarkable advances, current augmented and virtual reality (AR/VR) applications are a largely individual and local experience. Interconnected AR/VR, where participants can virtually interact across vast distances, remains a distant dream. The great barrier that stands between current technology and such applications is the stringent end-to-end latency requirement, which should not exceed 20 ms in order to avoid motion sickness and other discomforts. Bringing AR/VR to the next level to enable immersive interconnected AR/VR will require significant advances towards 5G ultra-reliable low-latency communication (URLLC) and a Tactile Internet of Things (IoT). In this article, we articulate the technical challenges to enable a future AR/VR end-to-end architecture, that combines 5G URLLC and Tactile IoT technology to support this next generation of interconnected AR/VR applications. Through the use of IoT sensors and actuators, AR/VR applications will be aware of the environmental and user context, supporting human-centric adaptations of the application logic, and lifelike interactions with the virtual environment. We present potential use cases and the required technological building blocks. For each of them, we delve into the current state of the art and challenges that need to be addressed before the dream of remote AR/VR interaction can become reality., Maria Torres Vega is funded by the Research Foundation Flanders (FWO), grant number 12W4819N. This work has been partially supported by the Spanish Ministry of Economy and Competitiveness under contract TEC2017-90034-C2-1-R (ALLIANCE project) that receives funding from FEDER, Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Flexible resource provisioning of polarization independent coherent PONs based on non-orthogonal multiple access and multiCAP modulation

  • Izquierdo Nuñez, David
  • Sarmiento Hernández, Samael
  • Barrio Segura, Miguel
  • Clemente Vicente, Jesús
  • Millán, Pablo
  • Lázaro Villa, José Antonio
  • Garces Gregorio, Juan Ignacio
  • Altabas Navarro, José Antonio
  • Puerta, Rafael
  • Rommel, Simon
  • Vegas Olmos, Juan J.
  • Tafur Monroy, Idelfonso
A combined non-orthogonal multiple access (NOMA) and multiband carrierless amplitude and phase modulation (multiCAP) scheme is proposed for flexible resource provisioning in coherent passive optical networks (PONs). While the proposed combination increases the data-rate and the number of users through the inclusion of NOMA and multiCAP, the coherent reception increases the range and splitting factor of the network through optical power budget enhancement. The proposed system is experimentally evaluated providing a 20 Gb/s aggregated data-rate per wavelength with 10G optoelectronics and applied in two main PON scenarios with four spectral configurations from full-band CAP to four-band multiCAP. The first PON scenario consists of an existing PON that the network operator requires to increase the number of users; NOMA with full-band CAP or multiCAP can be introduced replacing one or more users of the existing PON by one or several new sub-networks and multiplexing the sub-networks by NOMA. In the other PON scenario, several PONs can be nested sharing an initial splitter and achieving a larger number of users by the combination of NOMA and multiCAP. The proposed techniques are fully compatible with other multiplexing techniques such as dense wavelength division multiplexing, which should be considered to achieve higher numbers of users., Gobierno de Aragón (T20_20R); Ministerio de Economía y Competitividad (TEC2017-85752-R, TEC2017-90034-C2-2-R); Electronic Components and Systems for European Leadership (H2020/ECSEL BRAINE - 876967)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Routing in optical transport networks with deep reinforcement learning

  • Suárez Varela, José
  • Mestres Sugranyes, Albert
  • Yu, Junlin
  • Kuang, Li
  • Feng, Haoyu
  • Cabellos Aparicio, Alberto
  • Barlet Ros, Pere
Deep reinforcement learning (DRL) has recently revolutionized the resolution of decision-making and automated control problems. In the context of networking, there is a growing trend in the research community to apply DRL algorithms to optimization problems such as routing. However, existing proposals fail to achieve good results, often under-performing traditional routing techniques. We argue that the reason behind this poor performance is that they use straightforward representations of networks. In this paper, we propose a DRL-based solution for routing in optical transport networks (OTNs). Contrary to previous works, we propose a more elaborate representation of the network state that reduces the level of knowledge abstraction required for DRL agents and easily captures the singularities of network topologies. Our evaluation results show that using our novel representation, DRL agents achieve better performance and learn how to route traffic in OTNs significantly faster compared to state-of-the-art representations. Additionally, we reverse engineered the routing strategy learned by our DRL agent, and as a result, we found a routing algorithm that outperforms well-known traditional routing heuristics., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Results and achievements of the ALLIANCE Project: New network solutions for 5G and beyond

  • Careglio, Davide
  • Spadaro, Salvatore
  • Cabellos Aparicio, Alberto
  • Lázaro Villa, José Antonio
  • Barlet Ros, Pere
  • Gené Bernaus, Joan M.
  • Perelló Muntan, Jordi
  • Agraz Bujan, Fernando
  • Suárez-Varela Maciá, José Rafael
  • Pagès Raventós, Albert
  • Paillissé Vilanova, Jordi
  • Almasan Puscas, Felician Paul
  • Domingo Pascual, Jordi
  • Solé Pareta, Josep
Leaving the current 4th generation of mobile communications behind, 5G will represent a disruptive paradigm shift integrating 5G Radio Access Networks (RANs), ultra-high-capacity access/metro/core optical networks, and intra-datacentre (DC) network and computational resources into a single converged 5G network infrastructure. The present paper overviews the main achievements obtained in the ALLIANCE project. This project ambitiously aims at architecting a converged 5G-enabled network infrastructure satisfying those needs to effectively realise the envisioned upcoming Digital Society. In particular, we present two networking solutions for 5G and beyond 5G (B5G), such as Software Defined Networking/Network Function Virtualisation (SDN/NFV) on top of an ultra-high-capacity spatially and spectrally flexible all-optical network infrastructure, and the clean-slate Recursive Inter-Network Architecture (RINA) over packet networks, including access, metro, core and DC segments. The common umbrella of all these solutions is the Knowledge-Defined Networking (KDN)-based orchestration layer which, by implementing Artificial Intelligence (AI) techniques, enables an optimal end-to-end service provisioning. Finally, the cross-layer manager of the ALLIANCE architecture includes two novel elements, namely the monitoring element providing network and user data in real time to the KDN, and the blockchain-based trust element in charge of exchanging reliable and confident information with external domains., This work has been partially funded by the Spanish Ministry of Economy and Competitiveness under contract FEDER TEC2017-90034-C2 (ALLIANCE project) and by the Generalitat de Catalunya under contract 2017SGR-1037 and 2017SGR-605., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

RouteNet: leveraging graph neural networks for network modeling and optimization in SDN

  • Rusek, Krzysztof
  • Suárez-Varela Maciá, José Rafael
  • Almasan Puscas, Felician Paul
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
© 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 modeling is a key enabler to achieve efficient network operation in future self-driving Software-Defined Networks. However, we still lack functional network models able to produce accurate predictions of Key Performance Indicators (KPI) such as delay, jitter or loss at limited cost. In this paper we propose RouteNet, a novel network model based on Graph Neural Network (GNN) that is able to understand the complex relationship between topology, routing, and input traffic to produce accurate estimates of the per-source/destination per-packet delay distribution and loss. RouteNet leverages the ability of GNNs to learn and model graph-structured information and as a result, our model is able to generalize over arbitrary topologies, routing schemes and traffic intensity. In our evaluation, we show that RouteNet is able to predict accurately the delay distribution (mean delay and jitter) and loss even in topologies, routing and traffic unseen in the training (worst case MRE = 15.4%). Also, we present several use cases where we leverage the KPI predictions of our GNN model to achieve efficient routing optimization and network planning., This work was supported in part by the Polish Ministryof Science and Higher Education with the subvention funds of the Facultyof Computer Science, Electronics and Telecommunications, AGH University,in part by the Spanish MINECO under Contract TEC2017-90034-C2-1-R(ALLIANCE), in part by the Catalan Institution for Research and AdvancedStudies (ICREA) and the FI-AGAUR Grant by the Catalan Government, andin part by PL-Grid Infrastructure., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

The graph neural networking challenge: a worldwide competition for education in AI/ML for networks

  • Suárez-Varela Maciá, José Rafael
  • Ferriol Galmés, Miquel
  • López Brescó, Albert
  • Almasan Puscas, Felician Paul
  • Bernárdez Gil, Guillermo
  • Pujol Perich, David
  • Rusek, Krzysztof
  • Bonniot, Loïck
  • Neumann, Christoph
  • Schnitzler, François
  • Taïani, François
  • Happ, Martin
  • Barlet Ros, Pere
  • Cabellos Aparicio, Alberto
During the last decade, Machine Learning (ML) has increasingly become a hot topic in the field of Computer Networks and is expected to be gradually adopted for a plethora of control, monitoring and management tasks in real-world deployments. This poses the need to count on new generations of students, researchers and practitioners with a solid background in ML applied to networks. During 2020, the International Telecommunication Union (ITU) has organized the "ITU AI/ML in 5G challenge", an open global competition that has introduced to a broad audience some of the current main challenges in ML for networks. This large-scale initiative has gathered 23 different challenges proposed by network operators, equipment manufacturers and academia, and has attracted a total of 1300+ participants from 60+ countries. This paper narrates our experience organizing one of the proposed challenges: the "Graph Neural Networking Challenge 2020". We describe the problem presented to participants, the tools and resources provided, some organization aspects and participation statistics, an outline of the top-3 awarded solutions, and a summary with some lessons learned during all this journey. As a result, this challenge leaves a curated set of educational resources openly available to anyone interested in the topic., This work has received funding from the European Union’s H2020 research and innovation programme within the framework of the NGI-POINTER Project funded under grant agreement No. 871528. This paper reflects only the authors’ view; the European Commission is not responsible for any use that may be made of the information it contains. This work was also supported by the Spanish MINECO under contract TEC2017-90034-C2-1-R (ALLIANCE), the Catalan Institution for Research and Advanced Studies (ICREA), and by FI-AGAUR grant by the Catalan Government. Salzburg Research is grateful for the support by the WISS 2025 (Science and Innovation Strategy Salzburg 2025) project ”IDALab Salzburg” (20204-WISS/225/197-2019 and 20102-F1901166-KZP) and the 5G-AI-MLab by the Federal Ministry for Climate Action, Environment, Energy, Mobility, Innovation and Technology (BMK) and the Austrian state Salzburg., Peer Reviewed, Article escrit per 24 autors/autores: José Suárez-Varela (1), Miquel Ferriol-Galmés (1), Albert López (1), Paul Almasan (1), Guillermo Bernárdez (1), David Pujol-Perich (1), Krzysztof Rusek (1,2), Loïck Bonniot (3, 4), Christoph Neumann (3), François Schnitzler (3), François Taïani (4), Martin Happ (5, 6), Christian Maier (5), Jia Lei Du (5), Matthias Herlich (5), Peter Dorfinger (5), Nick Vincent Hainke (7), Stefan Venz (7), Johannes Wegener (7), Henrike Wissing (7), Bo Wu (8), Shihan Xiao (8), Pere Barlet-Ros (1), Albert Cabellos-Aparicio (1). 1- Barcelona Neural Networking center, Universitat Politècnica de Catalunya, Spain. 2- AGH University of Science and Technology, Department of Telecommunications, Poland. 3- InterDigital, France. 4- Univ. Rennes, Inria, CNRS, IRISA, France. 5- Salzburg Research Forschungsgesellschaft mbH, Austria. 6- IDA Lab, University of Salzburg, Austria. 7- Fraunhofer HHI, Germany. 8- Network Technology Lab., Huawei Technologies Co., Ltd., China., Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

NetXplain: Real-time explainability of graph neural networks applied to networking

  • Pujol Perich, David
  • Suárez-Varela Maciá, José Rafael
  • Xiao, Shihan
  • Wu, Bo
  • Cabellos Aparicio, Alberto
  • Barlet Ros, Pere
Recent advancements in Deep Learning (DL) have revolutionized the way we can efficiently tackle complex optimization problems. However, existing DL-based solutions are often considered as black boxes with high inner complexity. As a result, there is still certain skepticism among the networking industry about their practical viability to operate data networks. In this context, explainability techniques have recently emerged to unveil why DL models make each decision. This paper focuses on the explainability of Graph Neural Networks (GNNs) applied to networking. GNNs are a novel DL family with unique properties to generalize over graphs. As a result, they have shown unprecedented performance to solve complex network optimization problems. This paper presents NetXplain, a novel real-time explainability solution that uses a GNN to interpret the output produced by another GNN. In the evaluation, we apply the proposed explainability method to RouteNet, a GNN model that predicts end-to-end QoS metrics in networks. We show that NetXplain operates more than 3 orders of magnitude faster than state-of-the-art explainability solutions when applied to networks up to 24 nodes, which makes it compatible with real-time applications; while demonstrating strong capabilities to generalize to network scenarios not seen during training., This work has been supported by the Spanish MINECO under contract TEC2017‑90034‑C2‑1‑R (ALLIANCE) and the Catalan Institution for Research and Advanced Studies (ICREA)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Route, modulation format, MIMO and spectrum assignment in Flex-Grid/MCF transparent optical core networks

  • Rumipamba Zambrano, Rubén Darío
  • Perelló Muntan, Jordi
  • Spadaro, Salvatore
In this paper, we target an optimal multiple-input multiple-output digital signal processing (MIMO-DSP) assignment to super-channels affected by intercore crosstalk (ICXT) in multicore fiber (MCF) enabled transparent optical core networks. MIMO-DSP undoes ICXT effects, but can be costly with high core density MCFs. Hence, its implementation in the network must be carefully decided. We address our objective as a joint route, modulation format, MIMO and spectrum assignment (RMMSA) problem, for which integer linear programming formulations are provided to optimally solve it in small network scenarios. Moreover, several heuristic approaches are also proposed to solve large-scale problem instances with good accuracy. Their goal is to minimize both network spectral requirements and the amount of MIMO equalized super-channels, taking a crosstalk-free space division multiplexing (SDM) solution as a reference, for example, based on parallel single mode fibers [i.e., a multifiber (MF) scenario]. For our evaluation, we consider several state-of-the-art MCF prototypes and different network topologies. The obtained results, with the considered MCFs, disclose that in national backbone networks, the desirable percentage of super-channels with MIMO equalization to match the performance of an equivalent crosstalk-free SDM solution ranges from 0% to 36, while in continental-wide networks this range raises from 0% to 56%. In addition, in the case of a nonideal MIMO (with a 3 dB/km of crosstalk compensation), such percentages range from 0% to 28% and from 0% to 45% in national and continental-wide backbone networks, respectively, experimenting a performance gap up to 12% with respect to the MF reference scenario., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

IGNNITION: Bridging the gap between graph neural networks and networking systems

  • Pujol Perich, David
  • Suárez-Varela Maciá, José Rafael
  • Ferriol Galmés, Miquel
  • Xiao, Shihan
  • Wu, Bo
  • Cabellos Aparicio, Alberto
  • Barlet Ros, Pere
Recent years have seen the vast potential of graph neural networks (GNN) in many fields where data is structured as graphs (e.g., chemistry, recommender systems). In particular, GNNs are becoming increasingly popular in the field of networking, as graphs are intrinsically present at many levels (e.g., topology, routing). The main novelty of GNNs is their ability to generalize to other networks unseen during training, which is an essential feature for developing practical machine learning (ML) solutions for networking. However, implementing a functional GNN prototype is currently a cumbersome task that requires strong skills in neural network programming. This poses an important barrier to network engineers that often do not have the necessary ML expertise. In this article, we present IGNNITION, a novel open source framework that enables fast prototyping of GNNs for networking systems. IGNNITION is based on an intuitive high-level abstraction that hides the complexity behind GNNs, while still offering great flexibility to build custom GNN architectures. To showcase the versatility and performance of this framework, we implement two state-of-the-art GNN models applied to different networking use cases. Our results show that the GNN models produced by IGNNITION are equivalent in terms of accuracy and performance to their native implementations in TensorFlow., This open source project has received funding from the European Union’s Horizon 2020 research and innovation programme within the framework of the NGI-POINTER Project funded under grant agreement No. 871528. This article reflects only the author’s view; the European Commission is not responsible for any use that may be made of the information it contains. The work was also supported by the Spanish MINECO under contract TEC2017-90034-C2-1-R (ALLIANCE) and the Catalan Institution for Research and Advanced Studies (ICREA), Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Greenfield gradual migration planning toward spectrally-spatially flexible optical networks

  • Lechowicz, Piotr
  • Goscien, Roza
  • Rumipamba Zambrano, Rubén Darío
  • Perelló Muntan, Jordi
  • Spadaro, Salvatore
  • Walkowiak, Krzysztof
© 2019 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, This article identifies the unavoidably required upgrade of short-term realizable elastic optical networks (EONs) operating over single-mode fibers toward spectrally-spatially flexible optical networks (SS-FONs), exploiting spatial division multiplexing (SDM) technology in order to cope with the expected mid- and long-term future traffic forecasts. Since a complete EON to SS-FON network migration overnight is unrealistic, this article proposes a gradual greenfield migration strategy employing novel heuristic planning solutions. These solutions allow identifying which network components should be SDM-capable so as to support the forecasted traffic increase at a given time. To allow transmission in an SS-FON, links should be extended with SDM-capable fibers and nodes should be equipped with SDM-capable reconfigurable optical add/drop multiplexers. Using the proposed solutions, a migration case study in a national reference core network is provided and analyzed., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Computing graph neural networks: A survey from algorithms to accelerators

  • Abadal Cavallé, Sergi
  • Jain, Akshay
  • Guirado Liñan, Robert
  • López Alonso, Jorge
  • Alarcón Cot, Eduardo José
Graph Neural Networks (GNNs) have exploded onto the machine learning scene in recent years owing to their capability to model and learn from graph-structured data. Such an ability has strong implications in a wide variety of fields whose data are inherently relational, for which conventional neural networks do not perform well. Indeed, as recent reviews can attest, research in the area of GNNs has grown rapidly and has lead to the development of a variety of GNN algorithm variants as well as to the exploration of ground-breaking applications in chemistry, neurology, electronics, or communication networks, among others. At the current stage research, however, the efficient processing of GNNs is still an open challenge for several reasons. Besides of their novelty, GNNs are hard to compute due to their dependence on the input graph, their combination of dense and very sparse operations, or the need to scale to huge graphs in some applications. In this context, this article aims to make two main contributions. On the one hand, a review of the field of GNNs is presented from the perspective of computing. This includes a brief tutorial on the GNN fundamentals, an overview of the evolution of the field in the last decade, and a summary of operations carried out in the multiple phases of different GNN algorithm variants. On the other hand, an in-depth analysis of current software and hardware acceleration schemes is provided, from which a hardware-software, graph-aware, and communication-centric vision for GNN accelerators is distilled., This work is possible thanks to funding from the European Union’s Horizon 2020 research and innovation programme under Grant No. 863337 (WiPLASH project) and the Spanish Ministry of Economy and Competitiveness under contract TEC2017-90034-C2-1-R (ALLIANCE project) that receives funding from FEDER., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Spatial partitioning for proactive spectrum fragmentation avoidance in flex-grid/SDM dynamic optical core networks

  • Comellas Colomé, Jaume
  • Perelló Muntan, Jordi
  • Solé Pareta, Josep
  • Junyent Giralt, Gabriel
Spectrum fragmentation has always been a major issue to overcome toward spectrally efficient Flex-Grid over Single-Mode Fiber dynamic optical networks and continues like so when evolving to Flex-Grid over Spatial Division Multiplexing (SDM). A possible strategy to eliminate its pernicious effects is to divide the available spectrum into several partitions, dedicating each one of them to only support connections with identical spectral requirements. In this way, a first-fit spectrum assignment ensures that spectral gaps at each spectral partition will always match the bandwidth needs of future connection requests. In this paper, we extend this strategy to be applicable to Flex-Grid/SDM dynamic optical networks. Furthermore, leveraging the spatial multiplicity offered by SDM, we also investigate spatial partitioning as an effective yet simpler and more easily manageable solution to also eliminate the spectrum fragmentation negative effects. Both strategies are numerically evaluated in two reference Flex-Grid/SDM backbone networks with ׿7 spatial multiplicity, yielding noteworthy carried network load gains up to 18% versus a non-partitioned network scenario. When increasing the spatial multiplicities up to ׿30, such gains tend to stabilize around 3–4%. Some results are also obtained under unexpected traffic profile deviations, showing that, even under moderate deviations, partitioning becomes beneficial. Comparing spectral and spatial partitioning, they tend to perform quite similar in all cases. This makes us advocate for spatial partitioning as a more interesting solution for spectrum fragmentation avoidance in this kind of networks., This work has been partially funded by Spanish projects TWINS (TEC2017-90097-R) and ALLIANCE (TEC2017-90034-C2-1-R)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A skewness-aware matrix factorization approach for mesh-structured cloud services

  • Fu, Yongquan
  • Li, Dongsheng
  • Barlet Ros, Pere
  • Huang, Chun
  • Huang, Zhen
  • Shen, Siqi
  • Su, Huayou
© 2019 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., Online cloud services need to fulfill clients' requests scalably and fast. State-of-the-art cloud services are increasingly deployed as a distributed service mesh. Service to service communication is frequent in the mesh. Unfortunately, problematic events may occur between any pair of nodes in the mesh, therefore, it is vital to maximize the network visibility. A state-of-the-art approach is to model pairwise RTTs based on a latent factor model represented as a low-rank matrix factorization. A latent factor corresponds to a rank-1 component in the factorization model, and is shared by all node pairs. However, different node pairs usually experience a skewed set of hidden factors, which should be fully considered in the model. In this paper, we propose a skewness-aware matrix factorization method named SMF. We decompose the matrix factorization into basic units of rank-one latent factors, and progressively combine rank-one factors for different node pairs. We present a unifying framework to automatically and adaptively select the rank-one factors for each node pair, which not only preserves the low rankness of the matrix model, but also adapts to skewed network latency distributions. Over real-world RTT data sets, SMF significantly improves the relative error by a factor of 0.2 x to 10 x, converges fast and stably, and compactly captures fine-grained local and global network latency structures., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Network measurements for web tracking analysis and detection: A tutorial

  • Castell Uroz, Ismael
  • Solé Pareta, Josep
  • Barlet Ros, Pere
Digital society has developed to a point where it is nearly impossible for a user to know what it is happening in the background when using the Internet. To understand it, it is necessary to perform network measurements not only at the network layer (e.g., IP, ICMP), but also at the application layer (e.g., HTTP). For example, opening a single website can trigger a cascade of requests to different servers and services to obtain the resources embedded inside it. This process is becoming so complex that, to explore only one website, the number of communications can explode easily from tens to hundreds depending on the website. Inside those communications, there is an ever-increasing portion dedicated to web tracking, a controversial practice from the security and privacy perspective [1]., This work was supported by the Spanish MINECO under contract TEC2017-90034-C2-1-R (ALLIANCE)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Random number generation by coherent detection of quantum phase noise

  • Álvarez, Juan Rafael
  • Sarmiento Hernández, Samael
  • Lázaro Villa, José Antonio
  • Gené Bernaus, Joan M.
  • Pérez Torres, Juan
In 2010 Qi et al. [Opt. Lett. 35(3), 312 (2010)] demonstrated a random number generator based on the drift of the phase of a laser due to spontaneous emission, The out-of-the-lab implementation of this scheme presents two main drawbacks: it requires a long and highly unbalanced interferometer to generate a random phase with uniform probability distribution, or alternatively, a shorter and slightly unbalanced interferometer that notwithstanding requires active stabilization and does not generate a uniform probability distribution without randomness extraction. Here we demonstrate that making use of the random nature of the phase difference between two independent laser sources and two coherent detectors we can overcome these limitations. The two main advantages of the system demonstrated are: i) it generates a probability distribution of quantum origin which is intrinsically uniform and thus in principle needs no randomness extraction for obtaining a uniform distribution, and ii) the phase is measured with telecom equipment routinely used for high capacity coherent optical communications. The speed of random bit generation is determined by the photodetector bandwidth and the linewidth of the lasers. As a by-product of our method, we have obtained images of how phase noise develops with time in a laser. This provides a highly visual alternative way of measuring the coherence time of a laser., Peer Reviewed, Postprint (published version)