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

In Broker We Trust: A Double-auction Approach for Resource Allocation in NFV Markets

Network function virtualization (NFV) is an emerging scheme to provide virtualized network function services for next-generation networks. However, finding an efficient way to distribute different resources to customers is difficult. In this paper, we develop a new double-auction approach named DARA that is used for both service function chain routing and NFV price adjustment to maximize the profits of all participants. To the best of our knowledge, this is the first work to adopt a double-auction strategy in this area. The objective of the proposed approach is to maximize the profits of three types of participants: 1) NFV broker; 2) customers; and 3) service providers. Moreover, we prove that the approach is a weakly dominant strategy in a given NFV market by finding the Bayesian Nash equilibrium in the double-auction game. Finally, according to the results of the performance evaluation, our approach outperforms the single-auction mechanism with higher profits for the three types of participants in the given NFV market

Statistical Multiplexing and Traffic Shaping Games for Network Slicing

Next generation wireless architectures are expected to enable slices of shared wireless infrastructure which are customized to specific mobile operators/services. Given infrastructure costs and the stochastic nature of mobile services' spatial loads, it is highly desirable to achieve efficient statistical multiplexing amongst such slices. We study a simple dynamic resource sharing policy which allocates a 'share' of a pool of (distributed) resources to each slice-Share Constrained Proportionally Fair (SCPF). We give a characterization of SCPF's performance gains over static slicing and general processor sharing. We show that higher gains are obtained when a slice's spatial load is more 'imbalanced' than, and/or 'orthogonal' to, the aggregate network load, and that the overall gain across slices is positive. We then address the associated dimensioning problem. Under SCPF, traditional network dimensioning translates to a coupled share dimensioning problem, which characterizes the existence of a feasible share allocation given slices' expected loads and performance requirements. We provide a solution to robust share dimensioning for SCPF-based network slicing. Slices may wish to unilaterally manage their users' performance via admission control which maximizes their carried loads subject to performance requirements. We show this can be modeled as a 'traffic shaping' game with an achievable Nash equilibrium. Under high loads, the equilibrium is explicitly characterized, as are the gains in the carried load under SCPF vs. static slicing. Detailed simulations of a wireless infrastructure supporting multiple slices with heterogeneous mobile loads show the fidelity of our models and range of validity of our high load equilibrium analysis