APPLICATIONS OF SINGULAR PERTURBATION METHODS IN QUEUEING

A survey is presented describing the application of singular perturbation techniques to queueing systems. The goal is to compute performance measures by constructing approximate solutions to specific problems involving either the Kolmogorov forward or backward equation which contain a small parameter. These techniques are particularly useful on problems for which exact solutions are not available. Four different classes of problems are surveyed: (i) state-dependent queues; (ii) systems with a processor-sharing server; (iii) queueing networks; (iv) time dependent behavior. For each class, an illustrative example is presented along with the direction of current research.

[1]  D. Cox.  The analysis of non-Markovian stochastic processes by the inclusion of supplementary variables , 1955, Mathematical Proceedings of the Cambridge Philosophical Society.

[2]  J. Hunter.  Two Queues in Parallel , 1969 .

[3]  H. Weitzner,et al.  Perturbation Methods in Applied Mathematics , 1969 .

[4]  Edward G. Coffman,et al.  Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.

[5]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[6]  H. McKean,et al.  Two queues in parallel , 1977 .

[7]  S. Orszag,et al.  Advanced Mathematical Methods For Scientists And Engineers , 1979 .

[8]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[9]  J. Harrison,et al.  ON THE DISTRIBUTION OF MULTIDIMENSIONAL REFLECTED , 1981 .

[10]  A. Konheim,et al.  Processor-sharing of two parallel lines , 1981, Journal of Applied Probability.

[11]  J. Keller.  TIME-DEPENDENT QUEUES* , 1982 .

[12]  J. McKenna,et al.  Integral representations and asymptotic expansions for closed Markovian queueing networks: Normal usage , 1982, The Bell System Technical Journal.

[13]  Isi Mitrani,et al.  The Distribution of Sojourn Times in a Queueing Network with Overtaking: Reduction to a Boundary Problem , 1983, International Symposium on Computer Modeling, Measurement and Evaluation.

[14]  Guy Fayolle,et al.  On Functional Equations for One or Two Complex Variables Arising in the Analysis of Stochastic Models , 1983, Computer Performance and Reliability.

[15]  Debasis Mitra,et al.  Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes , 1983, Advances in Applied Probability.

[16]  L. Flatto,et al.  Two parallel queues created by arrivals with two demands. II , 1984 .

[17]  Debasis Mitra,et al.  Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks , 1984, JACM.

[18]  J. Morrison.  Response-Time Distribution for a Processor-Sharing System , 1985 .

[19]  J. Morrison,et al.  Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes , 1985, Advances in Applied Probability.

[20]  Nicolas D. Georganas,et al.  RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks , 1986, JACM.

[21]  Charles Knessl,et al.  Asymptotic analysis of a state dependent M/G/1 queueing system , 1985 .

[22]  C. Knessl,et al.  On the performance of state-dependent single server queues , 1986 .

[23]  J. Morrison.  Asymptotic analysis of the waiting-time distribution for a large closed processor-sharing system , 1986 .

[24]  J. Morrison.  Moments of the conditioned waiting time in a large closed processor-sharing system , 1986 .

[25]  G. Fayolle,et al.  Sojourn Times in a Tandem Queue with Overtaking: Reduction to a Boundary Value Problem , 1986 .

[26]  Charles Knessl,et al.  Two Parallel Queues with Dynamic Routing , 1986, IEEE Trans. Commun..

[27]  C. Knessl,et al.  A finite capacity single-server queue with customer loss , 1986 .

[28]  C. Knessl,et al.  System crash in a finite capacity m/g/1 queue , 1986 .

[29]  Charles Knessl,et al.  A Markov-modulated M/G/1 queue II: Busy period and time for buffer overflow , 1986, Queueing Syst. Theory Appl..

[30]  Debasis Mitra,et al.  Asymptotic expansions for closed Markovian networks with state-dependent service rates , 1984, JACM.

[31]  Charles Knessl,et al.  A Markov-modulated M/G/1 queue I: Stationary distribution , 1986, Queueing Syst. Theory Appl..

[32]  C. Knessl,et al.  Distribution of the maximum buffer content during a busy period for state-dependent m/g/1 queues , 1987 .

[33]  C. Knessl,et al.  The two repairman problem: a finite source M/G/2 queue , 1987 .

[34]  Charles Knessl,et al.  Asymptotic Expansions for a Closed Multiple Access System , 1987, SIAM J. Comput..

[35]  J. Morrison.  Conditioned response-time distribution for a large closed processor-sharing system in very heavy usage , 1987 .

[36]  J. Morrison.  Conditioned response-time distribution for a large closed processor-sharing system with multiple classes in very heavy usage , 1988 .

[37]  J. McKenna.  Extensions and applications of recal in the solution of closed product-form queueing networks , 1988 .

[38]  C. Knessl,et al.  Response times in processor-shared queuses with state-dependent arrival rates , 1989 .

[39]  C. Knessl.  On the transient behavior of the m/m/m/m loss model , 1990 .

[40]  K. Charles,et al.  Approximations to the moments of the sojourn time in a tandem queue with overtaking , 1990 .

[41]  C. Knessl.  On finite capacity processor-shared queues , 1990 .

[42]  A. Bersani,et al.  Asymptotic analysis for a closed processor-sharing system with switching times: normal usage , 1991 .

[43]  C. Knessl.  The WKB approximation to the G/M/m queue , 1991 .

[44]  C. Knessl.  On the diffusion approximation to two parallel queues with processor sharing , 1991 .

[45]  C. Knessl.  On the diffusion approximation to a fork and join queueing model , 1991 .

[46]  C. Knessl,et al.  Heavy traffic analysis of the sojourn time in tandem queues with overtaking , 1991 .

[47]  Charles Knessl,et al.  Heavy-traffic analysis of the sojourn time in a three node Jackson network with overtaking , 1991, Queueing Syst. Theory Appl..

[48]  C. Knessl,et al.  A processor-shared queue that models switching times: normal usage , 1992 .

[49]  Yaakov Kogan.  Another approach to asymptotic expansions for large closed queueing networks , 1992, Oper. Res. Lett..

[50]  Charles Knessl,et al.  Asymptotic Expansions for Large Closed Queueing Networks with Multiple Job Classes , 1992, IEEE Trans. Computers.

[51]  K. Charles.  Asymptotic approximations for the GI/M/1 queue with processor-sharing service , 1992 .

[52]  C. Knessl,et al.  Sojourn time distribution in some processor-shared queues , 1993, European Journal of Applied Mathematics.

[53]  Charles Knessl,et al.  A Finite Capacity PS Queue Which Models Switching Times , 1993, SIAM J. Appl. Math..

[54]  Charles Knessl,et al.  On the Transient Behavior of the Erlang Loss Model: Heavy Usage asymptotics , 1993, SIAM J. Appl. Math..

[55]  C. Knessl,et al.  On the transient behavior of the M/M/1 and M/M/1/K queues , 1993 .

[56]  Giuseppe Serazzi,et al.  A Survey of Bottleneck Analysis in Closed Networks of Queues , 1993, Performance/SIGMETRICS Tutorials.

[57]  C. Knessl,et al.  Conditional sojourn time moments in the finite capacity GI/M/1 queue with processor-sharing service , 1993 .

[58]  Charles Knessl,et al.  The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic , 1993, SIAM J. Appl. Math..

[59]  Charles Knessl,et al.  On the sojourn time distribution in a finite capacity processor shared queue , 1993, JACM.

[60]  C. Knessl,et al.  A state-dependent GI/G/1 queue , 1994 .

[61]  Charles Knessl,et al.  A Processor-Shared Queue that Models Switching Times: Heavy Usage Asymptotics , 1994, SIAM J. Appl. Math..

[62]  Charles Tier,et al.  Asymptotic Approximations for a Queueing Network with Multiple Classes , 1994, SIAM J. Appl. Math..

[63]  C. Knessl,et al.  The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service , 1994 .

[64]  C. Knessl,et al.  Asymptotic properties of first passage times for tandem jackson networks I: buildup of large queue lengths , 1995 .