A queueing model with dependence between service and interarrival times
نویسندگان
چکیده
We consider a storage model that can be either interpreted as a certain queueing model with dependence between a service request and the subsequent interarrival time, or as a fluid production/inventory model with a two-state random environment. We establish a direct link between the workload distributions· of the queueing model and the production/inventory model, and we present a detailed analysis of the workload and waiting time process of the queueing system. 1991 Mathematics Subject Classification: 60K25, 90B22.
منابع مشابه
On the Waiting Time in the GI/M/1 Vacations Queues with Dependency Between Interarrival and Service Times
We derive the waiting time distribution in a GI/M/1 queueing system with dependence between the service time of each customer and the subsequent interarrival times. In addition, the server takes exponentially distributed vacations when there are no customers left to serve in the queue.
متن کاملOn the waiting times in queues with dependency between interarrival and service times
In this paper a queueing system with partial correlation is considered. We assume that the amount of work (service time) brought in by a customer and the subsequent interarrival time are dependent. We show that in this case stronger dependence between interarrival and service times leads to decreasing waiting times in the increasing convex ordering sense. This generalizes a result of Chao (Oper...
متن کاملUsing Robust Queueing to Expose the Impact of Dependence in Single-Server Queues
Copyright: © 2017 INFORMS Abstract. Queueing applications are often complicated by dependence among interarrival times and service times. Such dependence is common in networks of queues, where arrivals are departures from other queues or superpositions of such complicated processes, especially when there are multiple customer classes with class-dependent servicetime distributions. We show that ...
متن کاملMonotonicity of the throughput of an open queueing network in the interarrival and service times
Using coupling and a sample path argument it is shown that the throughput of an open queueing network with general interarrival and service times is decreasing if the arrival and service times are stochastically increasing.
متن کاملOn queues with service and interarrival times depending on waiting times
W D = max{0, B − A + YW}, where P[Y = 1] = p and P[Y = −1] = 1 − p. For p = 1 this model reduces to the classical Lindley equation for the waiting time in the G/G/1 queue, whereas for p = 0 it describes the waiting time of the server in an alternating service model. For all other values of p this model describes a FCFS queue in which the service times and interarrival times depend linearly and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 128 شماره
صفحات -
تاریخ انتشار 2001