Moscholios, Ioannis, Vasilakis, Vasileios orcid.org/0000-0003-4902-8226, Logothetis, Michael et al. (1 more author) (2017) State-Dependent Bandwidth Sharing Policies for Wireless Multirate Loss Networks. IEEE Transactions on Wireless Communications. 7942058. pp. 5481-5497. ISSN 1536-1276
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: 1) a probabilistic threshold (PrTH) policy or 2) the multiple fractional channel reservation (MFCR) policy. In the PrTH policy, if the number of in-service calls (new or handover) of a service-class exceeds a threshold (difference 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.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. |
Keywords: | Call admission,convolution,reservation,threshold,wireless networks |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Depositing User: | Pure (York) |
Date Deposited: | 20 Jun 2017 11:30 |
Last Modified: | 07 Feb 2025 00:16 |
Published Version: | https://doi.org/10.1109/TWC.2017.2712153 |
Status: | Published |
Refereed: | Yes |
Identification Number: | 10.1109/TWC.2017.2712153 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:117905 |
Download
Filename: ieee_trans_accepted_manuscript.pdf
Description: ieee_trans_accepted_manuscript