skip to main content

Title: Slice-Aware Service Restoration with RecoveryTrucks for Optical Metro-Access Networks
Next-generation optical metro-access networks are expected to support end-to-end virtual network slices for critical 5G services. However, disasters affecting physical infrastructures upon which network slices are mapped can cause significant disruption in these services. Operators can deploy recovery units or trucks to restore services based on slice requirements. In this study, we investigate the problem of slice-aware service restoration in metro-access networks with specialized recovery trucks to restore services after a disaster failure. We model the problem based on classical vehicle-routing problem to find optimal routes for recovery trucks to failure sites to provide temporary backup service until the network components are repaired. Our proposed slice-aware service-restoration approach is formulated as a mixed integer linear program with the objective to minimize penalty of service disruption across different network slices.We compare our slice-aware approach with a slice-unaware approach and show that our proposed approach can achieve significant reduction in service-disruption penalty
Award ID(s):
Publication Date:
Journal Name:
IEEE Globecom 2019
Sponsoring Org:
National Science Foundation
More Like this
  1. Network slicing allows mobile network operators to virtualize infrastructures and provide customized slices for supporting various use cases with heterogeneous requirements. Online deep reinforcement learning (DRL) has shown promising potential in solving network problems and eliminating the simulation-to-reality discrepancy. Optimizing cross-domain resources with online DRL is, however, challenging, as the random exploration of DRL violates the service level agreement (SLA) of slices and resource constraints of infrastructures. In this paper, we propose OnSlicing, an online end-to-end network slicing system, to achieve minimal resource usage while satisfying slices' SLA. OnSlicing allows individualized learning for each slice and maintains its SLA bymore »using a novel constraint-aware policy update method and proactive baseline switching mechanism. OnSlicing complies with resource constraints of infrastructures by using a unique design of action modification in slices and parameter coordination in infrastructures. OnSlicing further mitigates the poor performance of online learning during the early learning stage by offline imitating a rule-based solution. Besides, we design four new domain managers to enable dynamic resource configuration in radio access, transport, core, and edge networks, respectively, at a timescale of subseconds. We implement OnSlicing on an end-to-end slicing testbed designed based on OpenAirInterface with both 4G LTE and 5G NR, OpenDayLight SDN platform, and OpenAir-CN core network. The experimental results show that OnSlicing achieves 61.3% usage reduction as compared to the rule-based solution and maintains nearly zero violation (0.06%) throughout the online learning phase. As online learning is converged, OnSlicing reduces 12.5% usage without any violations as compared to the state-of-the-art online DRL solution.« less
  2. We revisit the long-standing problem of providing network QoS to applications, and propose the concept of judicious QoS -- combining the cheaper, best effort IP service with the cloud, which offers a highly reliable infrastructure and the ability to add in-network services, albeit at higher cost. Our proposed J-QoS framework offers a range of reliability services with different cost vs. delay trade-offs, including: i) a forwarding service that forwards packets over the cloud overlay, ii) a caching service, which stores packets inside the cloud and allows them to be pulled in case of packet loss or disruption on the Internet,more »and iii) a novel coding service that provides the least expensive packet recovery option by combining packets of multiple application streams and sending a small number of coded packets across the more expensive cloud paths. We demonstrate the feasibility of these services using measurements from RIPE Atlas and a live deployment on PlanetLab. We also consider case studies on how J-QoS works with services up and down the network stack, including Skype video conferencing, TCP-based web transfers and cellular access networks.« less
  3. The objective of this paper is to integrate the post-disaster network access to critical facilities into the network robustness assessment, considering the geographical exposure of infrastructure to natural hazards. Conventional percolation modelling that uses generating function to measure network robustness fails to characterize spatial networks due to the degree correlation. In addition, the giant component alone is not sufficient to represent the performance of transportation networks in the post-disaster setting, especially in terms of the access to critical facilities (i.e. emergency services). Furthermore, the failure probability of various links in the face of different hazards needs to be encapsulated inmore »simulation. To bridge this gap, this paper proposed the metric robust component and a probabilistic link-removal strategy to assess network robustness through a percolation-based simulation framework. A case study has been conducted on the Portland Metro road network during an M9.0 earthquake scenario. The results revealed how the number of critical facilities severely impacts network robustness. Besides, earthquake-induced failures led to a two-phase percolation transition in robustness performance. The proposed robust component metric and simulation scheme can be generalized into a wide range of scenarios, thus enabling engineers to pinpoint the impact of disastrous disruption on network robustness. This research can also be generalized to identify critical facilities and sites for future development.« less
  4. In this paper, we introduce a network entity called point of connection (PoC), which is equipped with customized powerful communication, computing, and storage (CCS) capabilities, and design a data transportation network (DART) of interconnected PoCs to facilitate the provision of Internet of Things (IoT) services. By exploiting the powerful CCS capabilities of PoCs, DART brings both communication and computing services much closer to end devices so that resource-constrained IoT devices could have access to the desired communication and computing services. To achieve the design goals of DART, we further study spectrum-aware placement of edge computing services. We formulate the servicemore »placement as a stochastic mixed-integer optimization problem and propose an enhanced coarse-grained fixing procedure to facilitate efficient solution finding. Through extensive simulations, we demonstrate the effectiveness of the resulting spectrum-aware service placement strategies and the proposed solution approach.« less
  5. Going beyond the one-type-fits-all design philosophy, the future 5G radio access network (RAN) with network slicing methodology is employed to support widely diverse applications over the same physical network. RAN slicing aims to logically split an infrastructure into a set of self-contained programmable RAN slices in which each slice built on top of the underlying physical RAN (substrate) is a separate logical mobile network and delivers a set of services with similar characteristics. Each RAN slice is constituted by various virtual network functions (VNFs) distributed geographically in numerous substrate nodes. A RAN configuration scheme for the network is imperative tomore »embed VNFs in substrate nodes. In this paper, we propose to design new algorithms to enhance the stability of RAN slicing by addressing the resources allocation and VNF embedding problem, referred to as RS-configuration. Specifically, we establish the theoretical foundation for using RS-configuration to construct a VNF mapping plan for all VNFs with two efficient algorithms, including Group-based Algorithm (GBA) and Group-Connectivity-based Algorithm (GCBA). Through rigorous analysis and experimentation, we demonstrate that the proposed algorithms perform well within reasonable bounds of computational complexity.« less