Performance and reliability analysis of computer systems: an example-based approach using the SHARPE software package
Reducing location update cost in a PCS network
IEEE/ACM Transactions on Networking (TON)
The GSM System for Mobile Communications
The GSM System for Mobile Communications
Performance characterization of forwarding strategies in personal communication networks
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
A forwarding strategy to reduce network impacts of PCS
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
An alternative strategy for location tracking
IEEE Journal on Selected Areas in Communications
Location Management Strategies for Reducing Both Movement Cost and Locating Cost Simultaneously
MDA '99 Proceedings of the First International Conference on Mobile Data Access
“Cache and Carry” for Location Management in Mobile Information Systems
Distributed and Parallel Databases
New mobility scheme for reducing location traffic in mobile networks
ICCS'03 Proceedings of the 2003 international conference on Computational science
Efficient migration algorithm for mobile agents in wired/wireless internets
ICCS'03 Proceedings of the 2003 international conference on Computational science
| Hi-index | 0.00 |
In mobile environments, a personal communication service (PCS) network must keep track of the location of each mobile user in order to correctly deliver calls.A basic scheme used in the standard IS-41 and GSM protocolsis to always update the location of a mobile userwhenever the mobile user moves to a new location. The problem withthis approach is that the cost of location update operations is very highespecially when the mobile user moves frequently.In recent years, various location management strategies for reducing the location update cost have been proposed.However, the performance issue of these proposedalgorithms remains to be investigated.In this paper, we develop two Markov chains to analyze and comparethe performance of two promising location update strategies, i.e., the two location algorithm (TLA) and the forwarding and resetting algorithm (FRA).By utilizing the Markov chain, we are able to quickly answer what-ifquestions regarding the performance of PCS networks under various workload conditions and also identify conditions under which one strategy can perform better than the others.Using the cost due to locationupdate and search operations between two successive calls to a mobile user as a performance measure,we show that when the mobile user exhibits a high degree of locality and the mobile user‘s call-to-mobility ratio (CMR) is low, TLA can significantly outperform both FRA and IS-41.On the other hand, when CMR is high, FRA is the winner.Furthermore, unlike TLA which may perform worse thanIS-41 at high CMR values, FRA at identified optimal conditions can always perform at least as good as IS-41, suggesting thatFRA over TLA should be used as a genericscheme in reducing the location cost in the PCS networkto cover all possible per-user CMR values.