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 277-298
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (171 K)

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

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

Discrete-time queues with generally distributed service times and renewal-type server interruptions

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.

Dieter FiemsCorresponding Author Contact Information, E-mail The Corresponding Author, E-mail The Corresponding Author, Bart Steyaert and Herwig Bruneel

SMACS Research Group, Vakgroep TELIN (TW07V), Ghent University, Sint-Pietersnieuwstraat 41, B-9000, Ghent, Belgium


Received 21 September 2001; 
revised 7 March 2003. 
Available online 6 November 2003.

Abstract

In this contribution, we investigate a discrete-time single-server queue subjected to server interruptions. Server interruptions are modeled as an on/off process with geometrically distributed on-periods and generally distributed off-periods. As message lengths can exceed one time-slot, different operation modes are considered, depending on whether service of an interrupted message continues, partially restarts or completely restarts after an interruption. For all alternatives, we establish expressions for the steady-state probability generating functions (pgf) of the buffer contents at message departure times and random slot boundaries, of the unfinished work at random slot boundaries, the message delay, and the lengths of the idle and busy periods. From these results, closed-form expressions for various performance measures, such as mean and variance of the buffer occupancy and message delay, can be established. As an application, we show that this model is able to assess performance of a multi-class priority scheduling system. We then illustrate our approach with some numerical examples.

Author Keywords: Discrete-time queueing; Interruptions; Priority queueing

Article Outline

1. Introduction
2. Model
3. Effective service times
3.1. Continue-after-interruption mode
3.2. Repeat-after-interruption mode
3.3. Partial repeat-after-interruption mode
3.4. Remarks
4. Buffer contents
4.1. At message departure times
4.2. Random slot boundaries
4.3. Remarks
5. Unfinished work and message delay
6. Idle and busy periods
7. Application
8. Numerical example
9. Conclusions
Appendix A. Various moments
A.1. Effective service times
A.2. Queue contents and message delay
A.3. Idle and busy periods
References
Vitae



Corresponding Author Contact InformationCorresponding author. Tel.: +32-9-264-89-02; fax: +32-9-264-42-95.


Performance Evaluation
Volume 55, Issues 3-4, February 2004, Pages 277-298
 
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.