Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, YBen_US
dc.date.accessioned2014-12-08T15:02:01Z-
dc.date.available2014-12-08T15:02:01Z-
dc.date.issued1997-02-01en_US
dc.identifier.issn0163-6804en_US
dc.identifier.urihttp://dx.doi.org/10.1109/35.565671en_US
dc.identifier.urihttp://hdl.handle.net/11536/739-
dc.description.abstractOver the past few years there has been rapid growth in the demand for mobile communications that has led to intensive research and development of complex PCS (personal communication services) networks. Capacity planning and performance modeling are necessary to maintain a high quality of service to the PCS subscriber while minimizing costs. Effective and practical performance models for large-scale PCS networks are currently available. Two new performance models are presented in this article which can be solved using analytical techniques. The first is the so-called portable population model, based on the flow equivalent assumption (the rate of portables into a cell equals the rate of portables out of the cell). The model provides the steady-state portable population distribution in a cell that is independent of the portable residual time distribution, which can be used by simulations to reduce the necessary execution time by reaching the steady state more rapidly. Additionally, this model can be used to study the blocking probability of a low (portable) mobility PCS network and the performance of portable deregistration strategies. The second model is the so-called portable movement model which can be used to study location tracking and handoff algorithms. The model assumes that the arriving calls to a portable form a Poisson process, and portable residual times have a general distribution. This model can be used to study location-tracking algorithms and handoff algorithms. it is shown that under some assumptions, the analytic techniques are consistent with the simulation model.en_US
dc.language.isoen_USen_US
dc.titleModeling techniques for large-scale PCS networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/35.565671en_US
dc.identifier.journalIEEE COMMUNICATIONS MAGAZINEen_US
dc.citation.volume35en_US
dc.citation.issue2en_US
dc.citation.spage102en_US
dc.citation.epage107en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
Appears in Collections:Articles


Files in This Item:

  1. A1997WF97600011.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.