2021
DOI: 10.1007/978-3-030-72247-0_20
|View full text |Cite
|
Sign up to set email alerts
|

Methods for Analyzing Slicing Technology in 5G Wireless Network Described as Queueing System with Unlimited Buffer and Retrial Group

Abstract: Fourth generation wireless network was very soon about to not be able to support or withstand the exponential growth of traffic in modern wireless telecommunication networks. In addition, the inflexibility of mobile networks until now is making the situation even more complicated. In response, the fifth generation (5G) wireless telecommunication network was developed, allowing flexible and quick deployment of applications and services to accommodate specific requirements of users in very diverse fields. The co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…Due to the "infinite" sizes of buffer and orbit, the stationary probability distributions P = (𝑃 (n)) n∈𝒳 and Q = (𝑄(n)) n∈𝒴 should be computed through generating function-based approaches [25], [27], [29]. However, one can compute them using iteration methods [31], [32] by simply adding limitations to the storage sizes, setting these to random maximum values.…”
Section: Stationary Probability Distributionmentioning
confidence: 99%
See 1 more Smart Citation
“…Due to the "infinite" sizes of buffer and orbit, the stationary probability distributions P = (𝑃 (n)) n∈𝒳 and Q = (𝑄(n)) n∈𝒴 should be computed through generating function-based approaches [25], [27], [29]. However, one can compute them using iteration methods [31], [32] by simply adding limitations to the storage sizes, setting these to random maximum values.…”
Section: Stationary Probability Distributionmentioning
confidence: 99%
“…More precisely, we provide a comparative analysis of model's performance measures under preemptive and non-preemptive scheduling algorithms. For that we use the mathematical apparatus of queueing theory and describe the model as a retrial queueing system coupled with a buffer [27]- [29].…”
Section: Introductionmentioning
confidence: 99%