Finite-Buffer Queues with Workload-Dependent Service and Arrival Rates

We consider M/G/1 queues with workload-dependent arrival rate, service speed, and restricted accessibility. The admittance of customers typically depends on the amount of work found upon arrival in addition to its own service requirement. Typical examples are the finite dam, systems with customer impatience and queues regulated by the complete rejection discipline. Our study is motivated by queueing scenarios where the arrival rate and/or speed of the server depends on the amount of work present, like production systems and the Internet.First, we compare the steady-state distribution of the workload in two finite-buffer models, in which the ratio of arrival and service speed is equal. Second, we find an explicit expression for the cycle maximum in an M/G/1 queue with workload-dependent arrival and service rate. And third, we derive a formal solution for the steady-state workload density in case of restricted accessibility. The proportionality relation between some finite and infinite-buffer queues is extended. Level crossings and Volterra integral equations play a key role in our approach.

[1]  Jacob Cohen,et al.  On regenerative processes in queueing theory , 1976 .

[2]  L. Takács.  Investigation of waiting time problems by reduction to Markov processes , 1955 .

[3]  Jacqueline Loris-Teghem.  On the waiting time distribution in a generalized queueing system with uniformly bounded sojourn times , 1972 .

[4]  Jwm Will Bertrand,et al.  The effects of a simple arrival rate control policy on throughput and work-in-process in production systems with workload dependent processing times , 2001 .

[5]  J. G. Shanthikumar.  On Level Crossing Analysis of Queues , 1981 .

[6]  Sلأren Asmussen,et al.  Applied Probability and Queues , 1989 .

[7]  H. Tijms,et al.  A queueing system with impatient customers , 1985 .

[8]  J. W. Cohen,et al.  Single server queues with restricted accessibility , 1969 .

[9]  A. Zwart.  A fluid queue with a finite buffer and subexponential input , 2000, Advances in Applied Probability.

[10]  S. Asmussen.  Extreme Value Theory for Queues Via Cycle Maxima , 1998 .

[11]  Peter Linz,et al.  Analytical and numerical methods for Volterra equations , 1985, SIAM studies in applied and numerical mathematics.

[12]  D. Jagerman,et al.  Certain volterra integral equations arising in queueing , 1985 .

[13]  A. Zwart,et al.  ON AN EQUIVALENCE BETWEEN LOSS RATES AND CYCLE MAXIMA IN QUEUES AND DAMS , 2005, Probability in the Engineering and Informational Sciences.

[14]  Søren Asmussen,et al.  Monotone Stochastic Recursions and their Duals , 1996, Probability in the Engineering and Informational Sciences.

[15]  Søren Asmussen,et al.  Applied probability and queues, Second Edition , 2003, Applications of mathematics.

[16]  J. W. M Bertrand,et al.  Workload based order release and productivity: a missing link , 2002 .

[17]  A.I. Elwalid,et al.  Statistical multiplexing with loss priorities in rate-based congestion control of high-speed networks , 1994, IEEE Trans. Commun..

[18]  Michel Mandjes,et al.  Simple models of network access, with applications to the design of joint rate and admission control , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[19]  Vincent Hodgson,et al.  The Single Server Queue. , 1972 .

[20]  Karl Sigman,et al.  WORK-MODULATED QUEUES WITH APPLICATIONS TO STORAGE PROCESSES , 1992 .

[21]  J. Michael Harrison,et al.  The Stationary Distribution and First Exit Probabilities of a Storage Process with General Release Rule , 1976, Math. Oper. Res..

[22]  D. Daley.  General customer impatience in the queue GI/G/ 1 , 1965 .

[23]  G. Hooghiemstra.  A Path Construction for the Virtual Waiting Time of an M/G/1 Queue , 1987 .

[24]  Offer Kella,et al.  Dam processes with state dependent batch sizes and intermittent production processes with state dependent rates , 1997, Queueing Syst. Theory Appl..

[25]  Debasis Mitra,et al.  Analysis and design of rate-based congestion control of high speed networks, I: stochastic fluid models, access regulation , 1991, Queueing Syst. Theory Appl..

[26]  Lajos Takács,et al.  APPLICATION OF BALLOT THEOREMS IN THE THEORY OF QUEUES , 1964 .

[27]  R. Tweedie,et al.  Storage processes with general release rule and additive inputs , 1982, Advances in Applied Probability.

[28]  Bezalel Gavish,et al.  The Markovian Queue with Bounded Waiting time , 1977 .

[29]  Sem C. Borst,et al.  Queues with Workload-Dependent Arrival and Service Rates , 2004, Queueing Syst. Theory Appl..

[30]  Nam Kyoo Boots,et al.  A Multiserver Queueing System with Impatient Customers , 1999 .

[31]  Bert Zwart,et al.  Loss rates in the M/G/1 queue with complete rejection , 2003 .