Quality of service differentiation in heterogeneous CDMA networks: a mathematical modelling approach

Moscholios, Ioannis D.; Logothetis, Michael D.

doi:10.1007/s11276-016-1411-z

Cited by 11 publications

(3 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The accuracy of the proposed formulas is quite satisfactory compared to simulation. As a future work, we will extend these models in order to incorporate the interesting case of elastic and adaptive multirate traffic, where the bandwidth given to in-service calls is not constant during their service time [47][48][49][50][51][52][53][54].…”

Section: Discussionmentioning

confidence: 99%

Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls

Moscholios¹

2021

Telecom

Self Cite

View full text Add to dashboard Cite

In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation.

show abstract

Section: Discussionmentioning

confidence: 99%

Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls

Moscholios¹

2021

Telecom

Self Cite

View full text Add to dashboard Cite

show abstract

“…[2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]), wireless (e.g. [17][18][19][20][21][22][23][24][25][26][27][28]), satellite (e.g. [29][30][31][32][33]), and optical networks (e.g.…”

Section: Introductionmentioning

confidence: 99%

Call blocking probabilities in a two‐link multirate loss system for Poisson traffic

Sagkriotis

Pantelis²,

Moscholios³

2018

IET Networks

Self Cite

View full text Add to dashboard Cite

The authors propose two multirate teletraffic loss models in a two-link system that accommodates Poisson arriving calls from different service-classes with different bandwidth-per-call requirements. Each link has two thresholds which refer to the number of in-service calls in the link. The lowest threshold named support threshold, defines up to which point the link can support calls offloaded from the other link. The highest threshold, named offloading threshold, defines the point where the link starts offloading calls to the other link. Two different bandwidth sharing policies are considered: (i) the complete sharing policy, in which a call can be accepted in a link if there exist enough available bandwidth units and (ii) the bandwidth reservation policy, in which an integer number of bandwidth units is reserved to benefit calls of high bandwidth requirements. The two models do not have a product form solution for the steady state probabilities. However, they propose approximate formulas for the calculation of call blocking probabilities. The accuracy of the formulas is verified through simulation and found to be quite satisfactory.

show abstract

“…The K-R recursion was initially proposed for the traditional connection-oriented networks and since then has been extended for wired [17][18][19][20], wireless [21][22][23], and optical networks [24][25][26]. In particular, the arrivals and departures of calls in the system are modelled as a continuous-time Markov chain.…”

Section: Introductionmentioning

confidence: 99%

Efficient radio resource allocation in SDN/NFV based mobile cellular networks under the complete sharing policy

Moscholios

Logothetis

2018

IET Networks

Self Cite

View full text Add to dashboard Cite

Novel networking paradigms, such as software-defined networking (SDN) and network function virtualization (NFV), introduce new opportunities in the design of next-generation mobile networks. The present work investigates the benefits of the emerging SDN and NFV technologies on the radio resource management (RRM) in mobile cellular networks. In particular, the aim of the RRM scheme is to enable an efficient and flexible radio resource allocation in order to assure quality-of-experience of mobile users. The authors consider the orthogonal frequency division multiple access scheme and the complete radio resource sharing policy. To enable time-and space-efficient resource allocation, the authors investigate the applicability of the well-known Kaufman-Roberts recursion in the context of new architectural and functional changes of SDN/NFV based mobile environments. Finally, they discuss the applicability of the proposed approach for more complicated resource sharing policies.

show abstract

Quality of service differentiation in heterogeneous CDMA networks: a mathematical modelling approach

Cited by 11 publications

References 44 publications

Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls

Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls

Call blocking probabilities in a two‐link multirate loss system for Poisson traffic

Efficient radio resource allocation in SDN/NFV based mobile cellular networks under the complete sharing policy

Contact Info

Product

Resources

About