The Possibilities and Limitations of the Application of the Convolution Algorithm for Modeling Network Systems

Kaliszan, Adam; Stasiak, Maciej

doi:10.1007/978-3-319-59767-6_18

Cited by 3 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Generally speaking, it is significant in network planning and dimensioning procedures to have convolution algorithms or efficient recursive formulas for the determination of various performance measures including congestion probabilities . We focus on convolution algorithms which are adopted in the literature both in PFS [37][38][39] and in non-PFS queueing/loss models [40][41][42]. The advantage of such algorithms is that they can incorporate various resource sharing policies such as the bandwidth reservation policy, the complete sharing policy, as well as threshold-based policies [43][44][45][46].…”

Section: Introductionmentioning

confidence: 99%

Congestion Probabilities in a Multi-Cluster C-RAN Servicing a Mixture of Traffic Sources

2020

View full text Add to dashboard Cite

A multi-cluster cloud radio access network (C-RAN) is considered in this paper where the remote radio heads (RRHs) form different clusters. A cluster includes RRHs that have the same radio resource unit capacity. In addition, all RRHs are separated from the common pool of computational resource units named baseband units. Each RRH accommodates calls whose arrival process can be random, quasi-random, or even bursty. The latter is modeled according to the compound Poisson process where calls arrive in the C-RAN in the form of batches whose size (in calls) is generally distributed. An arriving call requires a radio and a computational resource unit so as to be accepted in the C-RAN. If at least one of these units is not available, the call is blocked. To analyze the proposed multi-cluster C-RAN we model it as a loss system, show that the steady-state probabilities have a product form solution and propose an algorithm for the computation of congestion probabilities. The accuracy of the proposed algorithm is verified via simulation.

show abstract