Queueing and Traffic in Cellular Radio
<p>A Cellular Radio system is analyzed from the communications traffic point of view. A cell within a given system is modeled by a multi-server service facility with or without the possibility of queueing some type of customers. Two types of arrivals are distinguished, corresponding to handoff...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
1986
|
| Online Access: | https://thesis.library.caltech.edu/1022/1/Guerin_r_1986.pdf Guérin, Roch (1986) Queueing and Traffic in Cellular Radio. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/WY9Y-FB87. https://resolver.caltech.edu/CaltechETD:etd-03192008-140041 <https://resolver.caltech.edu/CaltechETD:etd-03192008-140041> |
| Summary: | <p>A Cellular Radio system is analyzed from the communications traffic point of view. A cell within a given system is modeled by a multi-server service facility with or without the possibility of queueing some type of customers. Two types of arrivals are distinguished, corresponding to handoff calls (calls already in progress that enter the cell) and originating calls (calls initiated inside the cell). The queueing system used assumes Poisson distributed arrivals with different rates for the two types of customers. We initially assume, as is usually done for telephone communications, an exponential distribution for the service times of the customers. Due to mobility of the subscribers that can travel through several cells in the system, the channel occupancy time is in general different from the total call duration. Using both a simulation of a cellular system and an analytic model we offer evidence that a memory-less distribution may not be too unrealistic for the channel occupancy time.</p>
<p>We derive some traffic policies that give a higher level of protection to handoff calls, and their influence on the other class of customers as well as on the overall traffic is analyzed. The first policies proposed have the advantage of simplicity and provide an efficient way of reducing the blocking probability of handoff calls while only slightly increasing the blocking probability of originating calls. The price paid is, however, a small decrease in the total carried traffic.</p>
<p>Some more evolved traffic policies are then introduced that still decrease the blocking probability of handoff calls without much penalizing originating calls whose access to the system will only be slightly delayed. These more evolved policies provide the additional advantage of increasing the total carried traffic, while still providing a higher level of protection to handoff calls.</p>
|
|---|