Call completion probability for a PCS network

Yuguang Fang*, Imrich Chlamtac, Yi-Bing Lin

*此作品的通信作者

研究成果: Paper同行評審

2 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁面567-571
頁數5
DOIs
出版狀態Published - 12 10月 1997
事件Proceedings of the 1997 IEEE 6th International Conference on Universal Personal Communications, ICUPC'97. Part 1 (of 2) - San Diego, CA, USA
持續時間: 12 10月 199716 10月 1997

Conference

ConferenceProceedings of the 1997 IEEE 6th International Conference on Universal Personal Communications, ICUPC'97. Part 1 (of 2)
城市San Diego, CA, USA
期間12/10/9716/10/97

指紋

深入研究「Call completion probability for a PCS network」主題。共同形成了獨特的指紋。

引用此