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 (261 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.02.001    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2007 Elsevier Ltd All rights reserved.

The use of the distributional Little’s law in the computational analysis of discrete-time GI/G/1 and GI/D/c 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.

Nam K. Kima, E-mail The Corresponding Author and Mohan L. Chaudhryb, Corresponding Author Contact Information, E-mail The Corresponding Author

aDepartment of Industrial Engineering, Chonnam National University, Gwangju, 500-757, Republic of Korea

bDepartment of Mathematics and Computer Science, Royal Military College of Canada, P.O. Box 17000 STN FORCES, Kingston, ON K7K 7B4, Canada


Received 20 August 2005; 
revised 23 August 2006; 
accepted 3 February 2007. 
Available online 8 February 2007.

Abstract

In this paper, we first establish a discrete-time version of what is called the distributional Little’s law, a relation between the stationary distributions of the number of customers in a system (or queue length) and the number of slots a customer spends in that system (or waiting time). Based on this relation, we then present a simple computational procedure to obtain the queue-length distribution of the discrete-time GI/G/1 queue from its waiting-time distribution, which is readily available by various existing methods. Using the same procedure, we also obtain the queue-length distribution of the discrete-time multi-server GI/D/c queue in a unified manner. Sample numerical examples are also given.

Keywords: Discrete-time queue; Distributional Little’s law; GI/G/1 queue; GI/D/c queue; Queue length; Waiting time

Article Outline

1. Introduction
2. Distributional Little’s law
3. The GI/G/1 queue
4. The multi-server GI/D/c queue
Acknowledgements
Appendix A. Derivation of (1)
Appendix B. Derivation of (4) and (5)
References
Vitae

Corresponding Author Contact InformationCorresponding author. Tel.: +1 613 541 6000x6460; fax: +1 613 541 6584.

 
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.