Error Bounds for Perturbing Nonexponential Queues

References

• Daley D. J., Moran P. A. P. Two-sided inequalities for waiting time and queue size in GI/G/1. Theory Probab. Appl. (1968) 13:356–358Crossref, Google Scholar
• Jacobs D. R., Schach S. Stochastic order relationships between GI/G/k systems. Ann. Math. Statist. (1972) 43:1623–1632Crossref, Google Scholar
• Keilson J., Kester A. Monotone matrices and monotone Markov processes. Stochastic Processes Their Appl. (1977) 5:231–241Crossref, Google Scholar
• Kimura T. Approximations for multi-server queues: System interpolations. Queueing Systems (1994) 17:347–382Crossref, Google Scholar
• Massey W. A. Strong orderings for Markov processes on partially ordered spaces. Math. Oper. Res. (1987) 12:350–367Link, Google Scholar
• Miyazawa M. A generalized Pollaczek-Khinchine formula for the GI/GI/1/k queue and its application to approximation. Stochastic Models (1987) 3:53–65Crossref, Google Scholar
• Miyazawa M. Rate conservation laws: A survey. Queueing Systems (1994) 15:1–58Crossref, Google Scholar
• Miyazawa M., Van Dijk N. M. A note on bounds and error bounds for nonexponential batch arrival systems. Probab. Engrg. Inform. Sci. (1997) 11:189–201Crossref, Google Scholar
• Shaked M., Shanthikumar J. G.Stochastic Orders and Their Applications (1994) (Academic Press, San Diego, CA) Google Scholar
• Sonderman D. Comparison results for stochastic processes arising in queueing systems. (1978) . Ph.D. dissertation, Yale University, New Haven, CTGoogle Scholar
• Sonderman D. Comparing multi-server queues with finite waiting rooms I: Same number of servers. Adv. Appl. Probab. (1979a) 11:439–447Crossref, Google Scholar
• Sonderman D. Comparing multi-server queues with finite waiting rooms II: Different number of servers. Adv. Appl. Probab. (1979b) 11:448–455Crossref, Google Scholar
• Stidham S. On the optimality of single-server queueing systems. Oper. Res. (1970) 18:708–732Link, Google Scholar
• Stoyan D. Bounds and approximations in queueing through monotonicity and continuity. Oper. Res. (1977) 25:851–863Link, Google Scholar
• Stoyan D.Comparison Method for Queues and Other Stochastic Models (1983) (Wiley, Chichester U.K) Google Scholar
• Tijms H. C.Stochastic Modeling and Analysis: A Computational Approach (1986) (Wiley, Chichester U.K) Google Scholar
• Van Dijk N. M. A note on extended uniformization for nonexponential stochastic networks. J. Appl. Probab. (1989) 28:955–961Crossref, Google Scholar
• Van Dijk N. M., Stewart W. J. The importance of bias-terms for error bounds and comparison results. Numerical Solutions of Markov Chains (1991) (Marcel Dekker, New York) Google Scholar
• Van Dijk N. M. Bounds and error bounds for queueing networks. Ann. Oper. Res. (1998) 79:295–319Crossref, Google Scholar
• Van Dijk N. M., Korezlioglu H. On product form approximations for communication networks with losses: Error bounds. Ann. Oper. Res. (1992) 35:60–94Crossref, Google Scholar
• Van Dijk N. M., Puterman N. L. Perturbation theory for Markov reward processes with applications to queueing systems. Adv. Appl. Probab. (1988) 20:79–89Crossref, Google Scholar
• Van Dijk N. M., Taylor P. G. Strong stochastic bounds for the stationary distribution of a class of multicomponent performability models. Oper. Res. (1998) 46:665–674Link, Google Scholar
• Van Dijk N. M., Van de Wal J. Simple bounds and monotonicity results for multi-server exponential tandem queues. Queueing Systems (1989) 4:1–16Crossref, Google Scholar
• Wolff R. W.Stochastic Modeling and the Theory of Queues (1989) (Prentice-Hall, Englewood Cliffs NJ) Google Scholar
• Yu O. S. Stochastic bounds for heterogeneous-server queues with Erlang service-times. J. Appl. Probab. (1974) 11:785–796Crossref, Google Scholar