Congestion probabilities of elastic and adaptive calls in Erlang-Engset multirate loss models under the threshold and bandwidth reservation policies

Moscholios, Ioannis D.; Logothetis, Michael D.; Vardakas, John S.; Boucouvalas, Anthony C.

doi:10.1016/j.comnet.2015.09.010

Cited by 37 publications

(16 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The next stage in the discretization process is a determination of the allocation unit (AU) for a given system, also called in literature Basic Bandwidth Unit (BBU) [58,79,80].…”

Section: Overflow Of Adaptive Traffic In Mobile Networkmentioning

confidence: 99%

Modelling of Multiservice Networks with Separated Resources and Overflow of Adaptive Traffic

Głąbowski

Kmiecik

Stasiak

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

The article proposes a new method of determining traffic characteristics of multiservice overflow systems that carry adaptive traffic. When the total offered load in primary resources exceeds a certain value, this type of traffic is admitted for service with lower bitrate. A particular attention is given in the article to a method for a determination of the parameters of traffic that overflows to secondary resources as well as to the way adaptive traffic is serviced. The method takes into consideration three possible types of traffic: Erlang, Engset, and Pascal traffic. It is based on a generalization of Hayward’s concept and its application to model systems with adaptive traffic with threshold compression. The method can be used for optimal dimensioning of logical networks (slices) in modern mobile systems due to possibility of analytical determination of grade of service parameters (blocking probability, carried traffic, and network load). To verify the accuracy of the proposed model the results of analytical calculations, obtained on the basis of the proposed model, are then compared with the results of simulation experiments for a number of selected structures of overflow systems that service adaptive traffic. The results of the study demonstrate high accuracy of the proposed theoretical model.

show abstract

“…The next stage in the discretization process is a determination of the allocation unit (AU) for a given system, also called in literature Basic Bandwidth Unit (BBU) [58,79,80].…”

Section: Overflow Of Adaptive Traffic In Mobile Networkmentioning

confidence: 99%

Modelling of Multiservice Networks with Separated Resources and Overflow of Adaptive Traffic

Głąbowski

Kmiecik

Stasiak

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…However, in presentday networks, the ratio of the number of traffic sources to the capacity of a system is often limited and the value of traffic offered by calls of individual classes depends on the count of traffic sources for individual service classes [44,45].…”

Section: Related Workmentioning

confidence: 99%

Analytical modelling of multiservice switching networks with multiservice sources and resource management mechanisms

Głąbowski

Sobieraj

2017

Telecommun Syst

View full text Add to dashboard Cite

This article proposes a new analytical method of determining occupancy distribution and blocking probability in multiservice switching networks with admission control mechanisms and resource management mechanisms. The proposed method is a universal one, which allows for determining blocking probability using the same model, regardless of the type of admission control mechanisms and resource management mechanisms. The versatility of the method is demonstrated in the article for two selected mechanisms, i.e. a threshold mechanism and a resource reservation mechanisms. The switching networks under consideration are offered multiservice traffic streams, generated by the so-called multiservice sources, according to Erlang, Engset and Pascal distributions. The proposed method is based on a generalised way of determining traffic characteristics for inter-stage links of switching networks with resource and call management mechanisms. Particular attention is given to determining the influence of the introduced mechanisms in outgoing links of the switching network on the traffic properties of inter-stage links of the network. The results of analytical calculations are then compared with the results obtained in digital simulation for a number of selected switching networks.

show abstract

“…For an efficient calculation of the various performance measures, we can exploit the PFS of the PrTH-RQ model, and use the 3-step convolution algorithm of Section III, whereby, q k ( j)'s for new and handover service-class k calls can be determined by (17) and (8), respectively. CBP and system's utilization can be determined by (12) and (13), respectively, while E(n k ) can be determined by (14) where y k ( j) is calculated by (18) for new calls and (15) for handover calls.…”

Section: The Proposed Prth-rq Modelmentioning

confidence: 99%

“…The latter: i) is applicable in wired (e.g., [7], [16], [17]), wireless (e.g., [18]- [20]) and satellite networks (e.g., [21], [22]), ii) is attractive in access tree networks and iii) does not destroy reversibility in continuous time Markov chains, unlike the BR or MFCR policies. In the TH policy, the number of in-service calls of a service-class must not exceed a threshold (dedicated to the service-class), after the acceptance of a new call of this service-class.…”

Section: Introductionmentioning

confidence: 99%

“…The BR policy introduces a service priority to benefit high-speed calls and can achieve CBP equalization among calls of different serviceclasses at the expense of substantially increasing the CBP of lower-speed calls. In addition, the system analysis under the BR policy leads to non-reversible continuous time Markov chains and consequently to approximate formulas for the CBP calculation (e.g., [8], [9], [11], [16], [17]). The MFCR policy generalizes the BR policy for a refined QoS assessment by allowing the reservation of real (not integer) number of channels (e.g., [4]- [6]).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

State-Dependent Bandwidth Sharing Policies for Wireless Multirate Loss Networks

Moscholios

Logothetis

Boucouvalas

2017

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

Abstract-We consider a reference cell of fixed capacity in a wireless cellular network while concentrating on next-generation network architectures. The cell accommodates new and handover calls from different service-classes. Arriving calls follow a random or quasi-random process and compete for service in the cell under two bandwidth sharing policies: i) a probabilistic threshold (PrTH) policy, or ii) the multiple fractional channel reservation (MFCR) policy. In the PrTH policy, if the number of inservice calls (new or handover) of a service-class exceeds a threshold (different between new and handover calls), then an arriving call of the same service-class is accepted in the cell with a predefined state-dependent probability. In the MFCR policy, a real number of channels is reserved to benefit calls of certain service-classes; thus a service priority is introduced. The cell is modeled as a multirate loss system. Under the PrTH policy, call-level performance measures are determined via accurate convolution algorithms, while under the MFCR policy, via approximate but efficient models. Furthermore, we discuss the applicability of the proposed models in 4G/5G networks. The accuracy of the proposed models is verified through simulation.Comparison against other models reveals the necessity of the new models and policies.

show abstract

Congestion probabilities of elastic and adaptive calls in Erlang-Engset multirate loss models under the threshold and bandwidth reservation policies

Cited by 37 publications

References 42 publications

Modelling of Multiservice Networks with Separated Resources and Overflow of Adaptive Traffic

Modelling of Multiservice Networks with Separated Resources and Overflow of Adaptive Traffic

Analytical modelling of multiservice switching networks with multiservice sources and resource management mechanisms

State-Dependent Bandwidth Sharing Policies for Wireless Multirate Loss Networks

Contact Info

Product

Resources

About