Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Eliminating the boundary effect of a large-scale personal communication service network simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Reducing location update cost in a PCS network
IEEE/ACM Transactions on Networking (TON)
Dynamic resource assignment strategies for PCS data services
Information Sciences: an International Journal
Dynamic resource assignment strategies for PCS data services
Information Sciences: an International Journal
| Hi-index | 0.00 |
For high speed mobile communication applications, the data rate can be increased by using multiple channels (or time slots) instead of one channel. To reduce the high blocking rate of multiple channels assignment, flexible resource allocation strategies have been proposed. This paper proposes the Equal Resource Sharing Allocation scheme (ERSA scheme) for flexible resource allocation. The ERSA scheme dynamically averages the allocated resource to the call requests based on the number of calls in a base station. The scheme accommodates the maximum number of requests while providing acceptable quality to the admitted requests. We developed an analytic model to investigate the performance of ERSA, and conducted simulation experiments to validate the analytic model. We define satisfaction indication SI as the performance measurement of the resource allocation algorithm. The experiment results indicate that the ERSA scheme outperforms other resource allocation algorithms proposed in our previous study.