Eliminating the boundary effect of a large-scale personal communication service network simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Distributed Simulation of Large-Scale PCS Networks
MASCOTS '94 Proceedings of the Second International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
Applying a modified Chandy-Misra algorithm to the distributed simulation of a cellular network
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Exploiting model independence for parallel PCS network simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
On the parallel simulation of fixed channel allocation algorithms
Mobile Networks and Applications
Partitioning WCN models for parallel simulation of radio resource management
Wireless Networks - Special issue: Design and modeling in mobile and wireless systsems
Simulating spatially explicit problems on high performance architectures
Journal of Parallel and Distributed Computing - Parallel and Distributed Discrete Event Simulation--An Emerging Technology
Proceedings of the seventeenth workshop on Parallel and distributed simulation
Improving scalability of wireless network simulation with bounded inaccuracies
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Hi-index | 0.00 |
Recently, research and development of complex PCS (personal communication service) networks has increased, due to the rise in demand for mobile cellular communications. The efficiency of a PCS network is crucial in minimizing cost while maintaining quality service to mobile subscribers. Simulation is used extensively to facilitate the development of an efficient network. We present a conservative distributed simulation of a large scale PCS network. The conservative approach that we propose permits large simulations using the PVM software to configure the network into a parallel machine. Using a unique approach to exploit lookahead, we are able to induce speedups comparable to those produced by C.D. Carothers et al. (1994).