Performance analysis of a PCS network with state dependent calls arrival processes and impatient calls
✍ Scribed by Wei Li; Kia Makki; Niki Pissinou
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 127 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0140-3664
No coin nor oath required. For personal study only.
✦ Synopsis
This paper studies the behavior of performance evaluation for a personal communication services (PCS) network, in which the calls' arrival process may depend on the number of calls in the target cells. Each cell of the PCS network consists of a ®nite channel and a buffer (with ®nite or in®nite size) for handoff calls. The handoff calls having to wait in the buffer for further communication may become impatient and leave the system if their waiting time exceeds their own patience. The mobilities of the portables are characterized by the random cell residence times of the portables. For insight into the effect of dependent calls arrival processes and the impatient calls on PCS network performance, we propose an analytical model and obtain the expressions for the following interesting conventional and new performance measures: the new call blocking probability, handoff call failure probability and the forced termination probability of a handoff call; the quasi and actual waiting time of a handoff call in the buffer; the actual call holding time of a new call; and the blocking period of time of the new calls and the handoff calls etc. We also provide an algorithm to compare these blocking probabilities and the arrival rates for handoff calls. Some special cases of our model used in previous traf®c models of wireless and/or wireline communications are discussed. The results presented in this paper can provide guidelines for ®eld data processing on updated PCS network design and performance evaluation.