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 61, Issues 2-3, July 2005, Pages 281-298
Long Range Dependence and Heavy tail Distributions
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (175 K)

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

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

Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements

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.

Sem Borsta, b, c, Corresponding Author Contact Information, E-mail The Corresponding Author, Dennis van Ooteghema, b and Bert Zwarta, b

aCWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands

bDepartment of Mathematics & Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands

cBell Laboratories, Lucent Technologies, P.O. Box 636, Murray Hill, NJ 07974, USA


Available online 19 January 2005.

Abstract

We derive the sojourn time asymptotics for a multi-class GI/GI/1 queue with regularly varying service requirements operating under the discriminatory processor-sharing (DPS) discipline. DPS provides a natural approach for modelling the flow-level performance of differentiated bandwidth-sharing mechanisms. Under certain assumptions, we prove that the service requirement and sojourn time of a given class have similar tail behaviour, independent of the specific values of the DPS weights. As a by-product, we obtain an extension of the tail equivalence for ordinary processor-sharing (PS) queues to non-Poisson arrivals. The results suggest that DPS offers a potential instrument for effectuating preferential treatment to high-priority classes, without inflicting excessive delays on low-priority classes. To obtain the asymptotics, we develop a novel method which only involves information of the workload process and does not require any knowledge of the steady-state queue length distribution. In particular, the proof method brings sufficient strength to extend the results to scenarios with a time-varying service capacity.

Keywords: Differentiated services; (Discriminatory) processor sharing; Heavy-tailed traffic; Regular variation; Sojourn time asymptotics

Article Outline

1. Introduction
2. Model description
3. Main result
4. Proofs
4.1. Lower bound
4.2. Upper bound
5. Time-varying service rate
5.1. Modifications to the proof of the lower bound
5.2. Modifications to the proof of the upper bound
Acknowledgements
References

Corresponding Author Contact InformationCorresponding author. Tel.: +31 20 592 4205; fax: +31 20 592 4199.

Performance Evaluation
Volume 61, Issues 2-3, July 2005, Pages 281-298
Long Range Dependence and Heavy tail Distributions
 
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.