16 research outputs found
Survivable Virtual Network Embedding in Transport Networks
Network Virtualization (NV) is perceived as an enabling technology for the future Internet and the 5th Generation (5G) of mobile networks. It is becoming increasingly difficult to keep up with emerging applications’ Quality of Service (QoS) requirements in an ossified Internet. NV addresses the current Internet’s ossification problem by allowing the co-existence of multiple Virtual Networks (VNs), each customized to a specific purpose on the shared Internet. NV also facilitates a new business model, namely, Network-as-a-Service (NaaS), which provides a separation between applications and services, and the networks supporting them. 5G mobile network operators have adopted the NaaS model to partition their physical network resources into multiple VNs (also called network slices) and lease them to service providers. Service providers use the leased VNs to offer customized services satisfying specific QoS requirements without any investment in deploying and managing a physical network infrastructure.
The benefits of NV come at additional resource management challenges. A fundamental problem in NV is to efficiently map the virtual nodes and virtual links of a VN to physical nodes and paths, respectively, known as the Virtual Network Embedding (VNE) problem. A VNE that can survive physical resource failures is known as the survivable VNE (SVNE) problem, and has received significant attention recently. In this thesis, we address variants of the SVNE problem with different bandwidth and reliability requirements for transport networks. Specifically, the thesis includes four main contributions. First, a connectivity-aware VNE approach that ensures VN connectivity without bandwidth guarantee in the face of multiple link failures. Second, a joint spare capacity allocation and VNE scheme that provides bandwidth guarantee against link failures by augmenting VNs with necessary spare capacity. Third, a generalized recovery mechanism to re-embed the VNs that are impacted by a physical node failure. Fourth, a reliable VNE scheme with dedicated protection that allows tuning of available bandwidth of a VN during a physical link failure. We show the effectiveness of the proposed SVNE schemes through extensive simulations. We believe that the thesis can set the stage for further research specially in the area of automated failure management for next generation networks
MonArch: Network Slice Monitoring Architecture for Cloud Native 5G Deployments
Automated decision making algorithms are expected to play a key role in
management and orchestration of network slices in 5G and beyond networks.
State-of-the-art algorithms for automated orchestration and management tend to
rely on data-driven methods which require a timely and accurate view of the
network. Accurately monitoring an end-to-end (E2E) network slice requires a
scalable monitoring architecture that facilitates collection and correlation of
data from various network segments comprising the slice. The state-of-the-art
on 5G monitoring mostly focuses on scalability, falling short in providing
explicit support for network slicing and computing network slice key
performance indicators (KPIs). To fill this gap, in this paper, we present
MonArch, a scalable monitoring architecture for 5G, which focuses on network
slice monitoring, slice KPI computation, and an application programming
interface (API) for specifying slice monitoring requests. We validate the
proposed architecture by implementing MonArch on a 5G testbed, and demonstrate
its capability to compute a network slice KPI (e.g., slice throughput). Our
evaluations show that MonArch does not significantly increase data ingestion
time when scaling the number of slices and that a 5-second monitoring interval
offers a good balance between monitoring overhead and accuracy.Comment: Accepted at IEEE/IFIP NOMS 202
Latency-Aware Service Function Chain Placement in 5G Mobile Networks
The 5th generation mobile network (5G) is expected to support numerous services with versatile quality of service (QoS) requirements such as high data rates and low end-to-end (E2E) latency. It is widely agreed that E2E latency can be significantly reduced by moving content/computing capability closer to the network edge. However, since the edge nodes (i.e., base stations) have limited computing capacity, mobile network operators shall make a decision on how to provision the computing resources to the services in order to make sure that the E2E latency requirement of the services are satisfied while the network resources (e.g., computing, radio, and transport network resources) are used in an efficient manner. In this work, we employ integer linear programming (ILP) techniques to formulate and solve a joint user association, service function chain (SFC) placement, and resource allocation problem where SFCs, composed of virtualized service functions (VSFs), represent user requested services that have certain E2E latency and data rate requirements. Specifically, we compare three variants of an ILP-based algorithm that aim to minimize E2E latency of requested services, service provisioning cost, and VSF migration frequency, respectively. We then propose a heuristic in order to address the scalability issue of the ILP-based solutions. Simulations results demonstrate the effectiveness of the proposed heuristic algorithm
Orchestrating End-to-end Slices in 5G Networks
none55G networks are characterized by massive device connectivity, supporting a wide range of novel applications with their diverse Quality of Service (QoS) requirements. This poses a challenge since 5G as one-fits-all technology has to simultaneously address all these requirements. Network slicing has been proposed to cope with this challenge, calling for efficient slicing and slice placement strategies in order to ensure that the slice requirements (e.g., latency, data rate) are met, while the network resources are utilized in the most optimal manner. In this paper, we compare different end-to-end (E2E) slice placement strategies by formulating and solving a Mixed Integer Linear Programming (MILP) slice placement problem and study their trade-offs. E2E slice requests are modelled as Service Functions Chains (SFC), in which each core network and radio access network component is represented as a Virtual Network Function (VNF). Based on the analysis of the results, we then propose a slice placement heuristic algorithm whose objective is to minimize the number of VNF migrations in the network and their impact onto the slices while, at the same time, optimizing the network utilization and making sure that the QoS requirements of the considered slice requests are satisfied. The results of the simulations demonstrate the efficiency of the proposed algorithm.noneDavit Harutyunyan; Riccardo Fedrizzi; Nashid Shahriar; Raouf Boutaba; Roberto RiggioHarutyunyan, Davit; Fedrizzi, Riccardo; Shahriar, Nashid; Boutaba, Raouf; Riggio, Robert