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

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

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

A discrete-time queueing model with periodically scheduled arrival and departure slots

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.

Johan van Leeuwaardena, Corresponding Author Contact Information, E-mail The Corresponding Author, Dee Denteneerb and Jacques Resingc

aEURANDOM, P.O. Box 513, 5600 MB Eindhoven, The Netherlands

bDigital Signal Processing Group, Philips Research, 5656 AA Eindhoven, The Netherlands

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


Received 25 September 2003; 
revised 15 February 2005. 
Available online 7 April 2005.

Abstract

We consider a time-slotted queueing model where each time slot can either be an arrival slot, in which new packets arrive, or a departure slot, in which packets are transmitted and hence depart from the queue. The slot scheduling strategy we consider describes periodically, and for a fixed number of time slots, which slots are arrival and departure slots. We consider a static and a dynamic strategy. For both strategies, we obtain expressions for the probability generating function of the steady-state queue length and the packet delay. The model is motivated by cable-access networks, which are often regulated by a request–grant procedure in which actual data transmission is preceded by a reservation procedure. Time slots can then either be used for reservation or for data transmission.

Keywords: Cable-access networks; Discrete-time queue; Frame-based scheduling; Steady-state packet delay

Article Outline

1. Introduction
2. Models
3. Backlog
3.1. Backlog in fixed boundary model
3.2. Backlog in flexible boundary model
4. Packet delay
4.1. Basic approach
4.2. Packet delay in fixed boundary model
4.3. Packet delay in flexible boundary model
5. Numerical results
5.1. Fixed versus flexible boundary models
5.2. Influence of c in flexible boundary model
6. Conclusion
Acknowledgements
References








Corresponding Author Contact InformationCorresponding author. Tel.: +31 40 2474768; fax: +31 40 2465995.

 
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.