×

zbMATH — the first resource for mathematics

The generalized expansion method for open finite queueing networks. (English) Zbl 0691.60088
An open queueing network is analyzed approximately by superposing arrival streams, splitting departure streams and artificial nodes to allow for blocked customers. Renewal processes are assumed (not necessarily Poisson). Extensive numerical examples are given, which compare favorably with simulation results.
Reviewer: B.D.Craven

MSC:
60K25 Queueing theory (aspects of probability theory)
90B22 Queues and service in operations research
65C99 Probabilistic methods, stochastic differential equations
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Albin, S.L., Approximating superposition arrival processes of queues, (1980), Bell Laboratories Holmdel Englewood Cliffs, NJ · Zbl 0486.60094
[2] Albin, S.L., On Poisson approximations for superposition arrival processes in queues, Management science, 28, 2, 126-137, (1982), (1982) · Zbl 0486.60094
[3] Allen, A.O., ()
[4] Altiok, T., Approximate analysis of exponential tandem queues with blocking, European journal of operations research, 11, 390-398, (1982) · Zbl 0497.60096
[5] Bouanaka, B., Approximating queueing networks and facility planning, ()
[6] Boxma, O.; Konheim, A., Approximate analysis of exponential queuing systems with blocking, Acta informatica, 15, 19-26, (1981)
[7] Buzacott, J.; Shanthikumar, J., Approximate queueing models of dynamic job shops, Management science, 31, 7, 870-887, (1985)
[8] Chandy, K.M.; Sauer, C.H., Approximate methods for analyzing queueing network models of computing systems, Computer surveys, 10, 3, (1978) · Zbl 0385.68039
[9] Cox, D.R.; Miller, H.D., ()
[10] Disney, R.L.; Farrell, R.L.; de Morais, P.R., A characterization of M/G/1/N queues with renewal departure processes, Management science, 18, 1222-1228, (1973) · Zbl 0272.60060
[11] Finch, P.D., The output process of the queueing system M/G/1, Journal of the royal statistical society, B 21, 375-380, (1959) · Zbl 0091.30301
[12] Gross, D.; Harris, C.M., ()
[13] Halfin, S., Distribution of the interoverflow time for the GI/G/1 loss system, Mathematics of operations research, 6, 4, 563-570, (1981) · Zbl 0497.60090
[14] Hillier, F.S.; Boling, R.W., Finite queues in series with exponential or Erlang service times — A numerical approach, Operations research, 15, 286-303, (1967) · Zbl 0171.16302
[15] Kerbache, L.; MacGregor Smith, J., Asymptotic behaviour of the expansion method for open finite queueing networks, (), and submitted for publication in 1986
[16] Khintchine, A.Y.A., Erlang’s formulas in the theory of mass service, Theory of probability and its application VII, 320-325, (1963) · Zbl 0124.34302
[17] Khintchine, A.Y.A., ()
[18] King, R.A., The covariance structure of the departure process from M/G/1 queues with finite waiting lines, Journal of the royal statistical society, B 33, 401-406, (1971) · Zbl 0234.60113
[19] Kleinrock, L., ()
[20] Kobayashi, H., Application of the diffusion approximation to queueing networks I: equilibrium queue distributions, Journal of the ACM, 21, 2, 316-328, (1974) · Zbl 0278.60074
[21] Kuehn, P.J., Approximate analysis of general networks by decomposition, IEEE transactions on communications, 27, 1, 113-126, (1979) · Zbl 0392.60070
[22] Marshall, K.T., Some inequalities in queueing, Operations research, 16, 651-665, (1968) · Zbl 0186.24601
[23] Palm, C., Research on telephone traffic control by full availability groups, Tele, 1, 1-107, (1968)
[24] Pritsker, A.A.B., ()
[25] Labetoulle, J.; Pujolle, G., Isolation method in a network of queues, IEEE transactions on software engineering, 6, 4, 373-381, (1980)
[26] Pyke, R., On renewal processes related to type I and type II counter models, Annual mathematical statistics, 29, 737-754, (1958) · Zbl 0086.33702
[27] Shanbhag, D.N.; Tambouratzis, D.S., Erlang’s formula and some results on the departure process of a loss system, Journal of applied probability, 10, 233-240, (1975) · Zbl 0258.60080
[28] Smith, J.M.; Bouanaka, B., Queueing network decomposition in facilities planning, Computers and operations research, 12, 1, 1-16, (1985)
[29] Smith, W.L., Regenerative stochastic processing, (), 6-31 · Zbl 0067.36301
[30] Smith, W.L., On renewal theory, counter problems, and quasi-Poisson processes, (), 175-193 · Zbl 0085.34803
[31] Smith, W.L., Renewal theory and its ramifications, Journal of the royal statistical soc ser. B, 20, 243-302, (1958) · Zbl 0091.30101
[32] Sonderman, D., An analytical model for recirculating conveyors with stochastic input and outputs, International journal of production research, 20, 591-605, (1982)
[33] Takacs, L., On Erlang’s formula, Annual mathematical statistics, 40, 71-78, (1956) · Zbl 0177.22001
[34] Takahashi, Y.; Miyahara, H.; Hasegawa, T., An approximation method for open restricted queueing networks, Operations research, 28, 3, 594-602, (1980), Part I · Zbl 0442.90025
[35] Whitt, W., Approximating a point process by a renewal process: the view through a queue, an indirect approach, Management science, 27, 6, 619-636, (1982) · Zbl 0457.60073
[36] Whitt, W., Approximations for networks of queues: A simple two-parameter linear algorithm, (1981), Bell Laboratories New York
[37] Whitt, W., The queueing network analyzer, The Bell system technical journal, 62, 9, 2779-2815, (1983)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.