Call completion probability for a PCS network

Yuguang Fang, Imrich Chlamtac, Yi Bing Lin

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

2 Citations (Scopus)

Abstract

In the emerging PCS networks, some calls may not be completed due to the handoff failure. It is very important to know the call completion probability for system design and performance evaluation. This probability depends on the distributions of the call holding times and the cell residence times. While the commonly used exponential distributions may provide good approximations for some cellular systems, they may not be appropriate for the emerging PCS network modeling due to the new integrated services. In this paper we derive formulae for the call completion probability under general call holding times and general cell residence times.
Original languageEnglish
Title of host publicationAnnual International Conference on Universal Personal Communications - Record
PublisherIEEE
Pages567-571
Volume2
DOIs
Publication statusPublished - 1997
Externally publishedYes
EventProceedings of the 1997 IEEE 6th International Conference on Universal Personal Communications, ICUPC'97. Part 1 (of 2) - San Diego, CA, USA
Duration: 12 Oct 199716 Oct 1997

Conference

ConferenceProceedings of the 1997 IEEE 6th International Conference on Universal Personal Communications, ICUPC'97. Part 1 (of 2)
CitySan Diego, CA, USA
Period12/10/9716/10/97

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Fingerprint

Dive into the research topics of 'Call completion probability for a PCS network'. Together they form a unique fingerprint.

Cite this