A LCFS finite buffer model with batch input and non-exponential services

A LCFS finite buffer model with batch input and non-exponential services

0.00 Avg rating0 Votes
Article ID: iaor19891141
Country: Netherlands
Volume: 33
Issue: 1
Start Page Number: 123
End Page Number: 129
Publication Date: Oct 1989
Journal: Stochastic Processes and Their Applications
Authors:
Abstract:

A finite last-come first-served queueing system is studied with batch input and non-exponential services. A closed form expression is obtained for the steady-state queue length distribution and shown to be insensitive to service distributional forms (i.e. to depend only on mean service times). This result is of both practical and theoretical interest as an extension of the standard exponential case.

Reviews

Required fields are marked *. Your email address will not be published.