標題: Call performance for a PCS network
作者: Fang, YG
Chlamtac, I
Lin, YB
資訊工程學系
Department of Computer Science
關鍵字: call blocking;call-holding time;call pricing;cell residence;PCS
公開日期: 1-Oct-1997
摘要: It is well known that, due to the mobility of a portable and limited channel availability, calls of portables may not be completed due to being blocked or terminated during the call initiation or the handover process, The characteristics of the call-completion and call holding times for both a complete call and an incomplete call are of critical importance for establishing the actual billing process in the PCS network. In this paper, we derive the call-completion probability (hence, call-dropping probability) and the effective call-holding time distributions for complete/incomplete calls with a general cell-residence time and a general call-holding time are analyzed, and. general computable formulas are obtained, We show that when fall-holding times are Erlang distributed, easy-to-compute formulas for the probability of a call completion and the expected effective call-holding times for both a complete call and an incomplete call can be derived.
URI: http://dx.doi.org/10.1109/49.634795
http://hdl.handle.net/11536/280
ISSN: 0733-8716
DOI: 10.1109/49.634795
期刊: IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
Volume: 15
Issue: 8
起始頁: 1568
結束頁: 1581
Appears in Collections:Articles


Files in This Item:

  1. A1997YA92800017.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.