2019
DOI: 10.1109/tnsm.2019.2893126
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Resource Trading in Sliced Mobile Networks

Abstract: Expanding the market of mobile network services and defining solutions that are cost efficient are the key challenges for next generation mobile networks. Network slicing is commonly considered to be the main instrument to exploit the flexibility of the new radio interface and core network functions. It targets splitting resources among services with different requirements and tailoring system parameters according to their needs. Regulation authorities also recognize network slicing as a way of opening the mar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
41
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 40 publications
(41 citation statements)
references
References 24 publications
0
41
0
Order By: Relevance
“…In [12], Xie et al proposed a dynamic resource pooling and trading mechanism in network virtualization using Stackelberg game to achieve more efficient utilization of network resources. In [13,14], Akguel et al proposed an algorithm for trading resources among tenants. However, their approach involves a high computational cost that can make it impractical for real-scenarios.…”
Section: Related Workmentioning
confidence: 99%
“…In [12], Xie et al proposed a dynamic resource pooling and trading mechanism in network virtualization using Stackelberg game to achieve more efficient utilization of network resources. In [13,14], Akguel et al proposed an algorithm for trading resources among tenants. However, their approach involves a high computational cost that can make it impractical for real-scenarios.…”
Section: Related Workmentioning
confidence: 99%
“…Extending our previous work [9], we investigate the dynamic negotiation platform provided in Fig. 1.…”
Section: System Modelmentioning
confidence: 99%
“…error-free) prediction, is not robust to errors, which have direct impact on the slice configuration. Therefore, since guaranteeing high prediction accuracy in real time is quite challenging, we tackle the problem by splitting our original formulation into two subproblems, namely to P 1 and P 2 , as in our previous work [9]. However, our aim with the two-step algorithm in this case is different from what we had in [9].…”
Section: B Exploiting the Prediction Datamentioning
confidence: 99%
See 2 more Smart Citations