Skip Navigation

IMA Journal of Mathematical Control and Information 1996 13(2):151-155; doi:10.1093/imamci/13.2.151
© 1996 by Institute of Mathematics and its Applications
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by MOUSTAFA, M. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Timeout control scheme for overloaded M/E2/1 queue

MAGDI S. MOUSTAFA

The American University in Cairo Cairo, Egypt

A timeout scheme is considered for controlling an infinite ‘first come, first served’ overloaded single-server queue. In the overload situation, a customer-rejection mechanism is used for timing out ‘older’ customers in the queue, i.e. excluding those who have waited longer than a certain time. Applying ‘level-crossing analysis’ to an M/E2/1 queue, exact analytic expressions of performance such as the density and distribution functions of waiting time of the customers who get served, the mean delay of customers, successful throughput, and ‘goodput’ are determined for this queue.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.