Matching theory as enabler of efficient spectrum management in 5G networks

This is the peer reviewed version of the following article: Tsirakis, C, Lopez‐Aguilera, E, Agapiou, G, Varoutas, D. Matching theory as enabler of efficient spectrum management in 5G networks. Trans Emerging Tel Tech. 2020; 31:e3769., which has been published in final form at https://doi.org/10.1002/ett.3769. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions.This paper analyzes the spectrum trading problem in virtualized fifth generation (5G) networks in order to enhance the network performance with respect to the spectrum utilization. The problem is modeled as a Many-to-Many Matching (M2MM) game with utility-based preferences and determines the matching between mobile network operators and mobile virtual network operators. The two proposed versions of utility functions for each set aim at maximizing the satisfaction of both sets with conflicting interests and improving the overall spectrum efficiency. In the simulation evaluation, the proposed scheme is compared with three different schemes in terms of the system utility, individual and pair matching satisfaction. We also investigate the scalability aspects, the strategy plan impact on the matching performance of our proposed scheme, and, at the same time, we attempt to make appropriate assumptions closer to reality. Our proposed scheme shows much better performance than the other schemes achieving a quite high level of satisfaction for the matching result on both sets.Postprint (author's final draft

Wireless network virtualization

Virtualization of wired networks and end computing systems has become one of the leading trends in networked ICT systems. In contrast relatively little virtualization has occurred in infrastructure based wireless networks, but the idea of virtualizing wireless access is gaining attention as it has the potential to improve spectrum utilization and perhaps create new services. In this paper we survey the state of the current research in virtualizing wireless networks. We define and describe possible architectures, the issues, hurdles and trends towards implementation of wireless network virtualization. © 2013 IEEE

Cloud computing resource scheduling and a survey of its evolutionary approaches

A disruptive technology fundamentally transforming the way that computing services are delivered, cloud computing offers information and communication technology users a new dimension of convenience of resources, as services via the Internet. Because cloud provides a finite pool of virtualized on-demand resources, optimally scheduling them has become an essential and rewarding topic, where a trend of using Evolutionary Computation (EC) algorithms is emerging rapidly. Through analyzing the cloud computing architecture, this survey first presents taxonomy at two levels of scheduling cloud resources. It then paints a landscape of the scheduling problem and solutions. According to the taxonomy, a comprehensive survey of state-of-the-art approaches is presented systematically. Looking forward, challenges and potential future research directions are investigated and invited, including real-time scheduling, adaptive dynamic scheduling, large-scale scheduling, multiobjective scheduling, and distributed and parallel scheduling. At the dawn of Industry 4.0, cloud computing scheduling for cyber-physical integration with the presence of big data is also discussed. Research in this area is only in its infancy, but with the rapid fusion of information and data technology, more exciting and agenda-setting topics are likely to emerge on the horizon

A Repeated Auction Model for Load-Aware Dynamic Resource Allocation in Multi-Access Edge Computing

Multi-access edge computing (MEC) is one of the enabling technologies for high-performance computing at the edge of the 6 G networks, supporting high data rates and ultra-low service latency. Although MEC is a remedy to meet the growing demand for computation-intensive applications, the scarcity of resources at the MEC servers degrades its performance. Hence, effective resource management is essential; nevertheless, state-of-the-art research lacks efficient economic models to support the exponential growth of the MEC-enabled applications market. We focus on designing a MEC offloading service market based on a repeated auction model with multiple resource sellers (e.g., network operators and service providers) that compete to sell their computing resources to the offloading users. We design a computationally-efficient modified Generalized Second Price (GSP)-based algorithm that decides on pricing and resource allocation by considering the dynamic offloading requests arrival and the servers' computational workloads. Besides, we propose adaptive best-response bidding strategies for the resource sellers, satisfying the symmetric Nash equilibrium (SNE) and individual rationality properties. Finally, via intensive numerical results, we show the effectiveness of our proposed resource allocation mechanism.Comment: 17 pages, 11 figure