ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Performance Evaluation
Volume 55, Issues 3-4, February 2004, Pages 231-249
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (196 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.peva.2003.07.009    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2003 Elsevier B.V. All rights reserved.

Loss probabilities of hand-in traffic under various protocols: II. Model comparisons

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

D. J. Daleya, Corresponding Author Contact Information, E-mail The Corresponding Author and L. D. ServiE-mail The Corresponding Author, b, 1

a Mathematical Sciences Institute, Australian National University, Canberra, ACT 0200, Australia

b Verizon Laboratories, 40 Sylvan Road, Waltham, MA 02451, USA


Received 16 October 2000; 
revised 16 May 2003. 
Available online 13 November 2003.

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



Corresponding Author Contact InformationCorresponding author.

1 Current address: MIT Lincoln Laboratory, 244 Wood Street, Lexington, MA 02420, USA.


Performance Evaluation
Volume 55, Issues 3-4, February 2004, Pages 231-249
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.