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 1, January 2008, Pages 82-98
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (939 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.03.001    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2007 Elsevier Ltd All rights reserved.

Decomposition properties in fluid queues

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.

Yujing Wua, Corresponding Author Contact Information, E-mail The Corresponding Author, Weibo Gongb, E-mail The Corresponding Author and Don Towsleyc, E-mail The Corresponding Author

aDepartment of Computer Science, University of Calgary, Calgary AB, Canada T2N 1N4

bDepartment of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA 01003, USA

cDepartment of Computer Science, University of Massachusetts, Amherst, MA 01003, USA


Received 1 October 2005; 
revised 15 August 2006; 
accepted 7 March 2007. 
Available online 18 March 2007.

Abstract

We discover two decomposition properties in certain fluid queues. In a queue fed by burst flows, the impact of flow dynamics over shorter timescales on the mean buffer length can be separated from the impact of flow dynamics over larger timescales. A queue with multiple inputs can be decomposed into multiple simpler queues and the two systems have the same mean buffer length. This study may find applications in fast evaluation and resource management of computer networks.

Keywords: Queues; Decomposition; Mean buffer length; Fluid flows

Article Outline

1. Introduction
2. Model description
3. Local decomposition
3.1. Sample path analysis (SPA)
3.2. Stochastic model
3.3. Multiple burst flows
4. Flow decomposition
4.1. Single fluid queue
4.2. Fluid tandem system
5. Summary
Appendix A. Prove Lemma 3.3
Appendix B. Prove Lemma 3.4
Appendix C. Proof of Lemma 4.7
References
Vitae









Corresponding Author Contact InformationCorresponding author. Tel.: +1 403 2108814.

Performance Evaluation
Volume 65, Issue 1, January 2008, Pages 82-98
 
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.