Strategic Resource Pricing and Allocation in a 5G Network Slicing Stackelberg Game

We consider a marketplace in the context of 5G network slicing, where service providers (SP), i.e., slice tenants, are in competition for the access to the network resource owned by an infrastructure provider who relies on network slicing. We model the interactions between the end-users (followers) and the SPs (leaders) as a Stackelberg game. We prove that the competition between the SPs results in a multi-resource Tullock rent-seeking game. To determine resource pricing and allocation, we devise two innovative market mechanisms. First, we assume that the SPs are pre-assigned with fixed shares (budgets) of infrastructure, and rely on a trading post mechanism to allocate the resource. Under this mechanism, the SPs can redistribute their budgets in bids and customise their allocations to maximise their profits. We prove that their decision problems give rise to a noncooperative game, which admits a unique Nash equilibrium when dealing with a single resource. Second, when SPs have no bound on their budget, we formulate the problem as a pricing game with coupling constraints and derive the market prices as the duals of the coupling constraints. In addition, we prove that the pricing game admits a unique variational equilibrium. We propose two online learning algorithms to compute solutions to the market mechanisms. A third fully distributed algorithm based on a proximal method is proposed to compute the variational equilibrium solution to the pricing game. Finally, we run numerical simulations to analyse the economic properties of the market mechanisms and the convergence rates of the algorithms

Strategic Resource Pricing and Allocation in a 5G Network Slicing Stackelberg Game

International audienceWe consider a marketplace in the context of 5G network slicing, where Application Service Providers (ASP), i.e., slice tenants, providing heterogeneous services, are in competition for the access to the virtualized network resource owned by a Network Slice Provider (NSP), who relies on network slicing. We model the interactions between the end users (followers) and the ASPs (leaders) as a Stackelberg game. We prove that the competition between the ASPs results in a multi-resource Tullock rent-seeking game. To determine resource pricing and allocation, we devise two innovative market mechanisms. First, we assume that the ASPs are pre-assigned with fixed shares (budgets) of infrastructure, and rely on a trading post mechanism to allocate the resource. Under this mechanism, the ASPs can redistribute their budgets in bids and customise their allocations to maximize their profits. In case a single resource is considered, we prove that the ASPs' coupled decision problems give rise to a unique Nash equilibrium. Second, when ASPs have no bound on their budget, we formulate the problem as a pricing game with coupling constraints capturing the shared resource finite capacities, and derive the market prices as the duals of the coupling constraints. In addition, we prove that the pricing game admits a unique variational equilibrium. We implement two online learning algorithms to compute solutions of the market mechanisms. A third fully distributed algorithm based on a proximal method is proposed to compute the Variational equilibrium solution of the pricing game. Finally, we run numerical simulations to analyse the market mechanism's economic properties and the convergence rates of the algorithms

Highly Flexible RAN Slicing Approach to Manage Isolation, Priority, Efficiency

The evolution toward 5G is driven by the need of providing a wide range of services differing on needed network functionalities, performance requirements, type of devices, and going beyond the human-type communications. Such a wide variety of requirements cannot be always met through a common network setting, hence, high network flexibility and scalability are required. Network slicing allows the operation of multiple end-to-end logical networks on a common physical infrastructure: each network slice is tailored to best support a specific service. Network slicing on the radio access network (RAN) domain is challenging. In order to manage the scarce radio resources, RAN slicing requires flexibility, efficient resource sharing, and customization. Hence, dynamic resource management presents unique challenges, it has to take into account different issues that can also be in contrast with each other. This paper proposes a two-layer scheduler for an efficient and low complexity RAN slicing approach in actual systems. It is shown that simply setting some parameters it is possible to achieve different trade-offs between isolation and efficiency, allowing the management of priority and customization. The performance of the proposed method has been compared with other benchmark approaches to show good behavior and the flexibility of the proposed approach

A Survey of Mobility Management as a Service in Real-time Inter/Intra Slice Control

In-network softwarization, Network Slicing provides scalability and flexibility through various services such as Quality of Service (QoS) and Quality of Experience (QoE) to cover the network demands. For the QoS, a set of policies must be considered in real-time, accompanied by a group of functions and services to guarantee the end-user needs based on network demand. On the other hand, for the QoE, the service's performance needs to be improved to bring an efficient service to cover the demands of the end-user. The 3G Partnership Project (3GPP) defined the slice as a component of resources used to process a set of packets. These resources need to be flexible, which means the resources can be scaled up or down based on the demand. This survey discusses softwarization and virtualization techniques, considering how to implement the slices for future networks. Specifically, we discuss current advances concerning the functionality and architecture of the 5G network. Therefore, the paper critically evaluates recent research and systems related to mobility management as a service in real-time inter/intra slice control by considering the strengths and limitations of these contributions to identify the research gaps and possible research directions for emerging research and development opportunities. Moreover, we extend our review by considering the slice types and their numbers based on the 3GPP Technical Specification (3GPP TS). The study presented in this paper identifies open issues and research directions that reveal that mobility management at a service level with inter/intra slice management techniques has strong potential in future networks and requires further investigation from the research community to exploit its benefits fully

Special Topics in Information Technology

This open access book presents thirteen outstanding doctoral dissertations in Information Technology from the Department of Electronics, Information and Bioengineering, Politecnico di Milano, Italy. Information Technology has always been highly interdisciplinary, as many aspects have to be considered in IT systems. The doctoral studies program in IT at Politecnico di Milano emphasizes this interdisciplinary nature, which is becoming more and more important in recent technological advances, in collaborative projects, and in the education of young researchers. Accordingly, the focus of advanced research is on pursuing a rigorous approach to specific research topics starting from a broad background in various areas of Information Technology, especially Computer Science and Engineering, Electronics, Systems and Control, and Telecommunications. Each year, more than 50 PhDs graduate from the program. This book gathers the outcomes of the thirteen best theses defended in 2019-20 and selected for the IT PhD Award. Each of the authors provides a chapter summarizing his/her findings, including an introduction, description of methods, main achievements and future work on the topic. Hence, the book provides a cutting-edge overview of the latest research trends in Information Technology at Politecnico di Milano, presented in an easy-to-read format that will also appeal to non-specialists

Computing on the Edge of the Network

Um Systeme der fünften Generation zellularer Kommunikationsnetze (5G) zu ermöglichen, sind Energie effiziente Architekturen erforderlich, die eine zuverlässige Serviceplattform für die Bereitstellung von 5G-Diensten und darüber hinaus bieten können. Device Enhanced Edge Computing ist eine Ableitung des Multi-Access Edge Computing (MEC), das Rechen- und Speicherressourcen direkt auf den Endgeräten bereitstellt. Die Bedeutung dieses Konzepts wird durch die steigenden Anforderungen von rechenintensiven Anwendungen mit extrem niedriger Latenzzeit belegt, die den MEC-Server allein und den drahtlosen Kanal überfordern. Diese Dissertation stellt ein Berechnungs-Auslagerungsframework mit Berücksichtigung von Energie, Mobilität und Anreizen in einem gerätegestützten MEC-System mit mehreren Benutzern und mehreren Aufgaben vor, das die gegenseitige Abhängigkeit der Aufgaben sowie die Latenzanforderungen der Anwendungen berücksichtigt.To enable fifth generation cellular communication network (5G) systems, energy efficient architectures are required that can provide a reliable service platform for the delivery of 5G services and beyond. Device Enhanced Edge Computing is a derivative of Multi-Access Edge Computing (MEC), which provides computing and storage resources directly on the end devices. The importance of this concept is evidenced by the increasing demands of ultra-low latency computationally intensive applications that overwhelm the MEC server alone and the wireless channel. This dissertation presents a computational offloading framework considering energy, mobility and incentives in a multi-user, multi-task device-based MEC system that takes into account task interdependence and application latency requirements

Semantics-Empowered Communication: A Tutorial-cum-Survey

Along with the springing up of the semantics-empowered communication (SemCom) research, it is now witnessing an unprecedentedly growing interest towards a wide range of aspects (e.g., theories, applications, metrics and implementations) in both academia and industry. In this work, we primarily aim to provide a comprehensive survey on both the background and research taxonomy, as well as a detailed technical tutorial. Specifically, we start by reviewing the literature and answering the "what" and "why" questions in semantic transmissions. Afterwards, we present the ecosystems of SemCom, including history, theories, metrics, datasets and toolkits, on top of which the taxonomy for research directions is presented. Furthermore, we propose to categorize the critical enabling techniques by explicit and implicit reasoning-based methods, and elaborate on how they evolve and contribute to modern content & channel semantics-empowered communications. Besides reviewing and summarizing the latest efforts in SemCom, we discuss the relations with other communication levels (e.g., conventional communications) from a holistic and unified viewpoint. Subsequently, in order to facilitate future developments and industrial applications, we also highlight advanced practical techniques for boosting semantic accuracy, robustness, and large-scale scalability, just to mention a few. Finally, we discuss the technical challenges that shed light on future research opportunities.Comment: Submitted to an IEEE journal. Copyright might be transferred without further notic

Resource Allocation Framework in Fog Computing for the Internet of Things Environments

Fog computing plays a pivotal role in the Internet of Things (IoT) ecosystem because of its ability to support delay-sensitive tasks, bringing resources from cloud servers closer to the “ground” and support IoT devices that are resource-constrained. Although fog computing offers some benefits such as quick response to requests, geo-distributed data processing and data processing in the proximity of the IoT devices, the exponential increase of IoT devices and large volumes of data being generated has led to a new set of challenges. One such problem is the allocation of resources to IoT tasks to match their computational needs and quality of service (QoS) requirements, whilst meeting both task deadlines and user expectations. Most proposed solutions in existing works suggest task offloading mechanisms where IoT devices would offload their tasks randomly to the fog layer or cloud layer. This helps in minimizing the communication delay; however, most tasks would end up missing their deadlines as many delays are experienced during offloading. This study proposes and introduces a Resource Allocation Scheduler (RAS) at the IoT-Fog gateway, whose goal is to decide where and when a task is to be offloaded, either to the fog layer, or the cloud layer based on their priority needs, computational needs and QoS requirements. The aim directly places work within the communication networks domain, in the transport layer of the Open Systems Interconnection (OSI) model. As such, this study follows the four phases of the top-down approach because of its reusability characteristics. To validate and test the efficiency and effectiveness of the RAS, the fog framework was implemented and evaluated in a simulated smart home setup. The essential metrics that were used to check if round-trip time was minimized are the queuing time, offloading time and throughput for QoS. The results showed that the RAS helps to reduce the round-trip time, increases throughput and leads to improved QoS. Furthermore, the approach addressed the starvation problem, a phenomenon that tends to affect low priority tasks. Most importantly, the results provides evidence that if resource allocation and assignment are appropriately done, round-trip time can be reduced and QoS can be improved in fog computing. The significant contribution of this research is the novel framework which minimizes round-trip time, addresses the starvation problem and improves QoS. Moreover, a literature reviewed paper which was regarded by reviewers as the first, as far as QoS in fog computing is concerned was produced

Resource Allocation Framework in Fog Computing for the Internet of Things Environments

Fog computing plays a pivotal role in the Internet of Things (IoT) ecosystem because of its ability to support delay-sensitive tasks, bringing resources from cloud servers closer to the “ground” and support IoT devices that are resource-constrained. Although fog computing offers some benefits such as quick response to requests, geo-distributed data processing and data processing in the proximity of the IoT devices, the exponential increase of IoT devices and large volumes of data being generated has led to a new set of challenges. One such problem is the allocation of resources to IoT tasks to match their computational needs and quality of service (QoS) requirements, whilst meeting both task deadlines and user expectations. Most proposed solutions in existing works suggest task offloading mechanisms where IoT devices would offload their tasks randomly to the fog layer or cloud layer. This helps in minimizing the communication delay; however, most tasks would end up missing their deadlines as many delays are experienced during offloading. This study proposes and introduces a Resource Allocation Scheduler (RAS) at the IoT-Fog gateway, whose goal is to decide where and when a task is to be offloaded, either to the fog layer, or the cloud layer based on their priority needs, computational needs and QoS requirements. The aim directly places work within the communication networks domain, in the transport layer of the Open Systems Interconnection (OSI) model. As such, this study follows the four phases of the top-down approach because of its reusability characteristics. To validate and test the efficiency and effectiveness of the RAS, the fog framework was implemented and evaluated in a simulated smart home setup. The essential metrics that were used to check if round-trip time was minimized are the queuing time, offloading time and throughput for QoS. The results showed that the RAS helps to reduce the round-trip time, increases throughput and leads to improved QoS. Furthermore, the approach addressed the starvation problem, a phenomenon that tends to affect low priority tasks. Most importantly, the results provides evidence that if resource allocation and assignment are appropriately done, round-trip time can be reduced and QoS can be improved in fog computing. The significant contribution of this research is the novel framework which minimizes round-trip time, addresses the starvation problem and improves QoS. Moreover, a literature reviewed paper which was regarded by reviewers as the first, as far as QoS in fog computing is concerned was produced