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 65, Issue 8, July 2008, Pages 573-585
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (1278 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.peva.2007.10.005    
How to Cite or Link Using DOI (Opens New Window)

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

Hierarchical Markov chain analysis of an adaptive bandwidth reservation algorithm in wireless communication systems

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.

Donghwan Leea, Jin-Ghoo Choia, Changhee JooCorresponding Author Contact Information, a, E-mail The Corresponding Author and Saewoong Bahka

aDepartment of EECS, INMC, Seoul National University, Seoul, Republic of Korea


Received 26 November 2005; 
revised 2 June 2007; 
accepted 24 October 2007. 
Available online 4 November 2007.

Abstract

Admission control for handoff drops is a key resource management technique in wireless multimedia networks. While several adaptive schemes have been studied in the literature, little effort has been made for their analysis due to difficulty in mathematical modeling. Our main contribution is the proposal of a methodology for analyzing the Markov chain that is created when modeling a simple adaptive bandwidth reservation mechanism. For this purpose, we decompose the Markov chain into two levels: intra-domain for the analysis of equilibrium states and inter-domain for the analysis of transient states. This hierarchical decomposition provides an exact solution with significantly reduced computational complexity.

Keywords: Hierarchical Markov chain analysis; Handoff; Admission control; Probabilistic QoS guarantee

Article Outline

1. Introduction
2. System model
2.1. Admission control and bandwidth reservation
2.2. Adaptive bandwidth reservation algorithm
3. Analysis of a simple adaptive algorithm
3.1. Grouping the state diagram
3.2. Inter-domain (equilibrium state) analysis
3.3. Intra-domain (transient state) analysis
3.3.1. Decomposing a domain
3.3.2. Solving stage-by-stage
3.3.3. Inter-domain transition
3.4. Handoff dropping probability
4. Alternative analysis method using domain visit
4.1. Visits to each state of a single stage
4.2. Repeating the procedures
5. Simulation and numerical results
6. Conclusion
Acknowledgements
References
Vitae









Corresponding Author Contact InformationCorresponding author.

Performance Evaluation
Volume 65, Issue 8, July 2008, Pages 573-585
 
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.