Simulating population dependent PCS network models using time warp

  • Authors:
  • Christopher D. Carothers;Yi-Bing Lin;Richard M. Fujimoto

  • Affiliations:
  • College of Computing, Georgia Institute of Technology, Atlanta, Georgia;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.;College of Computing, Georgia Institute of Technology, Atlanta, Georgia

  • Venue:
  • WSC '95 Proceedings of the 27th conference on Winter simulation
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

The demand for mobile communications has led to intensive research and development efforts for complex PCS (personal communication service) networks. Capacity planning and performance modeling is necessary to maintain a high quality of service to the mobile subscriber while minimizing cost to the PCS provider. A question of pragmatic interest concerns the modeling of subscriber or portable movement in a PCS network. Typically, portable movement models are based on a probabilistic distribution function with fixed mean. These models may be an over simplification of real portable movement patterns. For example, portable movements during rush hour traffic may be slowed due to traffic jams. However, when the volume of vehicular traffic is less, portables are allowed to move more freely and with greater speed. To capture this type of portable movement behavior, we develop a population dependent PCS model where portable movement is based on the number of portables currently residing in that service area or cell. Because of the large amount of computation required to simulate PCS networks, we implement this model on a distributed Time Warp simulator, which has been shown to reduce the execution time of a single run from 20 hours down to 3.5 hours. Using this simulation model, we study the effect of different call workloads and population dependent portable movement patterns on PCS blocking statistics and present our preliminary results.