Probabilistic call admission control in wireless multiservice networks

Stratogiannis, Dimitrios G.; Tsiropoulos, Georgios I.; Kanellopoulos, J.D.; Cottis, Panayotis G.

doi:10.1109/lcomm.2009.091327

Cited by 10 publications

(9 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In static P-CAC schemes,ˇj is set equal to one for traffic states below a certain threshold T .T < C / and equal to a fixed valueˇ, 0 6ˇ< 1, for the other states [14,15]. Besides, the admission of LSC calls is subject to a priorityˇj , j D 1, 2, : : : , C , 0 6ˇj 6 1.…”

Section: System Model and Probabilistic Call Admission Control Schemementioning

confidence: 99%

Utility‐based probabilistic call admission control for complete fairness in wireless networks

Tsiropoulos

Stratogiannis

Chen

et al. 2012

Int J Communication

View full text Add to dashboard Cite

Resource reservation or the other prioritization strategies adopted by Call Admission Control (CAC) schemes in wireless networks lead to unfair resource allocation to users belonging to different service classes (SCs) due to high divergence among the respective call blocking probabilities (CBPs). In this paper, we propose dynamic optimization of probabilistic CAC (P-CAC) schemes to assure CAC fairness among users of different SCs in wireless networks. The approach is based on users utility combined with fairness optimization, aiming at dynamically determining the probability value in the P-CAC scheme. This optimal probability is adjusted to network ongoing traffic, CBPs of each SC, prioritization levels characterizing the SCs supported, and the users risk aversion, which reflects their behavior toward the perceived QoS. The existence and uniqueness of the optimal probability that leads to absolute fairness among the users of a wireless network are proven.

show abstract

Section: System Model and Probabilistic Call Admission Control Schemementioning

confidence: 99%

Utility‐based probabilistic call admission control for complete fairness in wireless networks

Tsiropoulos

Stratogiannis

Chen

et al. 2012

Int J Communication

View full text Add to dashboard Cite

show abstract

“…In a cellular system, the QoS requirements for different services (e.g., voice, real-time video) require a CAC to limit the number of connections in each access network [2]. The CAC policy can either accept the connection request and allocate the resources accordingly or reject the connection request.…”

Section: Introductionmentioning

confidence: 99%

“…They assume that all arriving connections request the same amount of bandwidth. Therefore, CAC schemes have been proposed for multiservice wireless networks by Chao and Chen [6], Stratogiannis et al [2], and Stevens-Navarro et al [7].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Admission control policy for adaptive multirate multiservices in cellular systems

Wang

Pan

2012

J Wireless Com Network

View full text Add to dashboard Cite

Forced termination of connections during handover and blocked connection initiation are annoying from the perspective of multiservice cellular system users. Previous studies have shown that an admission control policy reduces the dropping probability to a much lower level but at the cost of raising the blocking probability to a higher level. As an alternative for reducing both blocking and dropping probabilities, we make use of the Adaptive Multirate (AMR) scheme, which is a well-known real-time streaming coding technique. For an example of AMR technique, a video source is encoded into multiple independent descriptions. A cellular device, depending on its available computing and network resources, joins different descriptions to meet performance requirements. The base layer is received and the enhancement layer(s) are abandoned if the cellular capacity is insufficient for high-quality video. Mobile cellular devices currently obtain basic video quality at a lower frame rate. AMR services can substantially improve the degree of user satisfaction and guarantee the connection-level quality of service (QoS) for different multimedia. In cellular systems, the QoS requirements of different services require a connection admission control (CAC) that limits the number of connections in each access network. Therefore, we focus on the CAC and connection-level QoS of multiservice traffic using adaptive coding in mobile cellular systems. We initially analyzed our CAC policy in a multiservices cellular system by formulating the CAC policy functions, arrival rate, departure rate, blocking probability, and dropping probability of the multiservices, before we derived the connection-level QoS and verified it by simulation. The adaptive coding of multiservices traffic has a significant impact on the connection-level QoS in multiservice cellular systems. Our method decreased the blocking and dropping probabilities by adapting multirate services while users were roaming. Mobile cellular operators providing AMR services could apply our CAC to fulfill the quality requirements of the user experience and also improve the connection-level QoS.

show abstract

“…To the best of our knowledge, this has not been addressed so far by related works. Previous studies that investigate the problem of performance prediction and admission control mechanisms in OFDMA systems focus on single-cell scenarios and do not take dynamic resource allocation into account [9], [10]. A notable exception to this is [11] where the authors take an interference-limited OFDMA system into account, however, without considering dynamic resource allocation.…”

Section: Introductionmentioning

confidence: 99%

How bad is interference in IEEE 802.16e systems?

Naghibi

Gross

2010

2010 European Wireless Conference (EW)

View full text Add to dashboard Cite

This paper presents a performance model for dynamic resource allocation in cellular deployments of IEEE 802.16e-like systems. More specifically, we derive a framework which allows to quantify the number of VoIP calls that can be supported in downlink of such systems purely based on the average SINR per terminal. The major difficulty to overcome is to predict the impact of dynamic resource allocations on the system performance in the presence of interference. We show that dynamic resource allocations perform a transformation of subcarrier SINR PDFs and derive an approximate, closed-form representation of these SINR PDFs. Based on these derivations, we derive rate PMFs which predicts system performance up to a gap of about 25% compared to optimal system performance. Furthermore, the model allows for detailed investigation of dynamic resource allocation in interference-limited scenarios. We show that the average SINR is not a valid metric to predict system performance from, but instead the received power of the signal of interest is much more important (together with the received interference power). To the best of our knowledge, such performance models are novel while the presented insights have significant consequences for network design and network selfoptimization.

show abstract

Probabilistic call admission control in wireless multiservice networks

Cited by 10 publications

References 7 publications

Utility‐based probabilistic call admission control for complete fairness in wireless networks

Utility‐based probabilistic call admission control for complete fairness in wireless networks

Admission control policy for adaptive multirate multiservices in cellular systems

How bad is interference in IEEE 802.16e systems?

Contact Info

Product

Resources

About