A game-theoretic approach to network slicing

Yang, Xu; Liu, Yue; Chou, Ka Seng; Cuthbert, Laurie

doi:10.1109/atnac.2017.8215397

Cited by 10 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the following, we will examine the background of work on this issue. In work [11] they presented a network Slicing approach (especially radio Slicing) in order to provide a dynamic allocation plan for spectrum resources using game theory. Their algorithm specifically allocates the entire spectrum resource to users in different slices.…”

Section: Related Workmentioning

confidence: 99%

Dynamic Allocation of 5G Network Resources using Game Theory

Bamdad

Jamali

Fotohi

2022

Preprint

View full text Add to dashboard Cite

Standardization of "Network Slice", which is an important part of resource allocation among innovations emerging in 5G networks, is considered a vital and important issue in the research community. The network slice to support one or more specific services is modified and changed according to the needs of that service. These slices provide an efficient basis for dividing the infrastructure between different entities, each of which has a slice. In this research, a proposed method for allocation of cache storage resources with a network Slicing scenario in the core network of the fifth generation of communications using game theory and specifically the bankruptcy game in order to improve the quality of the end user's experience has been presented. Game theory is a field of applied mathematics that is developed in the context of economics and studies strategic behavior between rational agents. In general, the Shapley method has improved by 5% in the user satisfaction index compared to the proportional allocation method. In the fairness index, Shapley's allocation method and proportional allocation method have both improved by 27% compared to the minimum-maximum method. In the fairness index of the quality of experience, Shapley's method and proportional allocation method are equal. Shepley's method and proportional allocation compared to the minimum-maximum method have improved 4% in the fairness index of experience quality. The results clearly show the fairness of the Shapley allocation method and proportional allocation, and in some aspects, these two have been different from each other, which has been discussed in detail. End-to-end multi-resource allocation using the bankruptcy game can be mentioned for future work in the existing field.

show abstract

Section: Related Workmentioning

confidence: 99%

Dynamic Allocation of 5G Network Resources using Game Theory

Bamdad

Jamali

Fotohi

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…A scenario comprised of a common radio infrastructure shared by N tenants is assumed. Each tenant operates a pre-generated and deployed RAN slice through the Network Slice Subnet Management Function (NSSMF) [23]. The diagram shown in Figure 2 is comprised of a gNB cell of bandwidth B divided into Physical Resource Blocks (PRB).…”

Section: System Design and Developmentmentioning

confidence: 99%

Aircraft to Operations Communication Analysis and Architecture for the Future Aviation Environment

Whitworth

Al‐Rubaye

Tsourdos

et al. 2021

2021 IEEE/AIAA 40th Digital Avionics Systems Conference (DASC)

View full text Add to dashboard Cite

Fifth Generation (5G) systems are envisaged to support a wide range of applications scenarios with varying requirements. 5G architecture includes network slicing abilities which facilitate the partitioning of a single network infrastructure on to multiple logical networks, each tailored to a given use case, providing appropriate isolation and Quality of Service (QoS) characteristics. Radio Access Network (RAN) slicing is key to ensuring appropriate QoS over multiple domains; achieved via the configuration of multiple RAN behaviors over a common pool of radio resources. This Paper proposes a novel solution for efficient resource allocation and assignment among a verity of heterogeneous services, to utilize the resources while ensuring maximum QoS for network services. First, this paper evaluates the effectiveness of different wireless data bearers. Secondly, the paper proposes a novel dynamic resource allocation algorithm for RAN slicing within 5G New Radio (NR) networks utilising cooperative game theory combined with priority-based bargaining. The impact of this work to industry is to provide a new technique for resource allocation that utilizes cooperative bargaining to ensure all network services achieve minimum QoS requirementswhile using application priority to reduce data transfer time for key services to facilitate increase turn around time at the gate.

show abstract

“…Similarly, a 5G network based control plane is proposed by [25] to perform trade-off between resource slicing and user mobility. Moreover, authors in [26][27] introduce a set of game theory based methods to dynamically assign system bandwidth as an auction game in virtualized wireless networks. However, underutilization of resources and infeasibility to cope with dynamic traffic are still the issues once customized resource assignment and slicing is done by the methods mentioned above.…”

Section: A State Of the Art And Related Workmentioning

confidence: 99%