Copyright © 2003 Elsevier B.V. All rights reserved.
Loss probabilities of hand-in traffic under various protocols: II. Model comparisons
Received 16 October 2000;
Abstract
Mobile telephone traffic business demands that a given base station be able to handle both newly originating traffic and hand-off traffic from neighboring base stations, with priority to be given to the latter, existing traffic. This paper examines three access control protocols that give such traffic priority by specifying a reserve capacity R amongst the Ntot channels, where R need not be an integer. Assuming a Poisson arrival process and independent exponential service times, it is shown via birth–death processes, sample path constructions and stochastic monotonicity results for Markov processes that pairwise comparison of the protocols considered is possible, and, in particular, that one of them is ‘best’ in terms of the smallest loss probability of one type of traffic for a given rate of loss for the other type. Results proved via sample path constructions hold under weaker conditions of stationary ergodic arrival processes and exponential service times.
Author Keywords: Protocols; Hand-off traffic; Monotonicity
Article Outline
- 1. Introduction
- 2. The protocols and main results
- 3. Loss probabilities: basic properties
- 4. Markov processes for Models I–IV
- 5. Birth-and-death process equations for Pr{X(·)=i}
- 6. Sample path comparison of Models II and III
- 7. General comparison properties of Models I–IV
- 8. Models with waiting facility and reneging
- Acknowledgements
- Appendix A. Infinitesimal transition rates for Models I–IV
- References
- Vitae
1 Current address: MIT Lincoln Laboratory, 244 Wood Street, Lexington, MA 02420, USA.






E-mail Article
Add to my Quick Links

Cited By in Scopus (1)






vqsu for 
