QUEUEING SYSTEMS WITH RESTRICTED WORKLOAD: AN EXPLICIT SOLUTION

Queueing systems with non-exponential service distributions and a capacity restriction on the total residual service requirement (workload) are studied. Closedform expressions of geometric form in the LCFS case and recursive representations in the FCFS case are obtained for the steady state workload distribution. The proof is of interest in itself and directly leads to extensions.

[1]  De Kok,et al.  Asymptotic results for buffer systems under heavy load , 1987 .

[2]  A. Wyner On the Probability of Buffer Overflow Under an Arbitrary Bounded Input-Output Distribution , 1974 .

[3]  R. Schassberger The insensitivity of stationary probabilities in networks of queues , 1978, Advances in Applied Probability.

[4]  Henk C. Tijms,et al.  A Two-Moment Approximation for a Buffer Design Problem Requiring a Small Rejection Probability , 1985, Perform. Evaluation.

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

[6]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[7]  Peter W. Jones,et al.  Stochastic Modelling and Analysis , 1988 .

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

[9]  S. Ross Bounds on the delay distribution in GI/G/1 queues , 1974, Journal of Applied Probability.

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

[11]  D. Iglehart Extreme Values in the GI/G/1 Queue , 1972 .

[12]  Exponential bounds for excess probabilities in systems with a finite capacity , 1987 .

[13]  Julian Keilson,et al.  A Gambler's Ruin Type Problem in Queuing Theory , 1963 .

[14]  A. W. Kemp,et al.  Applied Probability and Queues , 1989 .

[15]  A. Barbour Networks of queues and the method of stages , 1976, Advances in Applied Probability.

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

[17]  Kurt Geihs,et al.  Bounds on buffer overflow probabilities in communication systems , 1982, Perform. Evaluation.