The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2018
DOI: 10.3103/s0146411618050127
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis of M2M Traffic in LTE Network Using Queuing Systems with Random Resource Requirements

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(12 citation statements)
references
References 8 publications
0
12
0
Order By: Relevance
“…For the generation of random numbers with CDF   The simulation results were compared with calculations from [7], where performance measures of the queueing system were obtained using sampling of the CDF (7) and applying recurrence algorithm for discrete resource requirements (figures 3 and 4). As it is seen from figure 4, the blocking probability growth slows down with the increase of the load.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…For the generation of random numbers with CDF   The simulation results were compared with calculations from [7], where performance measures of the queueing system were obtained using sampling of the CDF (7) and applying recurrence algorithm for discrete resource requirements (figures 3 and 4). As it is seen from figure 4, the blocking probability growth slows down with the increase of the load.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…However, analytical formulas for probabilistic characteristics are too complex to be used directly due to multiple convolutions of the resource requirements CDF. In [7], we derived the recurrent algorithm for evaluation of stationary measures for the case of discrete resource requirements and proposed the sampling approach for continuous resources. However, the complexity of the calculations is still high and the algorithms are only applicable under assumption of Poisson arrivals.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The main reason is the need for evaluating multiple convolutions of the resource requirements distribution as discussed above. However, the authors in [161], developed a recursive algorithm for calculating the normalization constant constant Q 0 , which allows for efficient numerical analysis.…”
Section: B Baseline Resource Queuing Systemsmentioning
confidence: 99%
“…The proposed work is the first that studies a C-RAN that accommodates multiservice quasi-random traffic and, at the same time, provides convolution algorithms for the efficient determination of congestion probabilities (recently, the case of C-RAN multi-service random traffic has been proposed in [46]). Such algorithms are used in the literature in order to express complicated resource sharing policies such as the bandwidth reservation policy and threshold-based policies [47][48][49][50][51][52][53][54]. The proposed models of this paper are named finite multi-class-single-cluster (f-MC-SC) and finite multiclass-multi-cluster (f-MC-MC), respectively, while the summary of our contribution is as follows: (1) we propose the f-MC-SC model and show that the model has a PFS, (2) we present a brute force (BF) analytical method together with a convolution algorithm for the calculation of congestion probabilities in the proposed model, (3) we compare the congestion probabilities results of the f-MC-SC model with simulation results and those obtained via [27], (4) we propose the f-MC-MC model and show that the model has a PFS, and (5) we present a BF method as well as a convolution algorithm for the determination of congestion probabilities in the f-MC-MC model.…”
Section: Introductionmentioning
confidence: 99%