On Whitt's conjecture for queues in which service times and interarrival times depend linearly and randomly upon waiting times

On Whitt's conjecture for queues in which service times and interarrival times depend linearly and randomly upon waiting times

0.00 Avg rating0 Votes
Article ID: iaor19993189
Country: United States
Volume: 22
Issue: 3/4
Start Page Number: 345
End Page Number: 366
Publication Date: Oct 1996
Journal: Queueing Systems
Authors:
Keywords: GI/G/1 queues
Abstract:

We consider a modification of the standard G/G/1 queueing system with infinite waiting space and the first-in-first-out discipline in which the service times and interarrival times depend linearly and randomly on the waiting times. In this model the waiting times satisfy a modified version of the classical Lindley recursion. When the waiting-time distributions converge to a proper limit, Whitt proposed a normal approximation for this steady-state limit. In this paper we prove a limit theorem for the steady-state limit of the system. Thus, our result provides a solid foundation for Whitt's normal approximation of the steady-state distribution of the system.

Reviews

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