Abstract
Following a wish expressed by the organizers of this meeting the aim of this presentation has initially been a survey on the available closed-form results about residence time distributions for networks of queues, more precisely: results providing more information than just expected values. The consent to give such a survey was given lightheartedly, since the scarcity of such results promised an easy job. However, a closer look revealed that there is really only one such result, if one defines a network as something involving more than two nodes. It was therefore felt that the original aim had to be broadened to include the available closed-form results on expected residence times in networks of queues. However, here too, there seems to exist just one such result, excluding again mini-networks. Thus, chapters 2 and 3, which are devoted to the description of these two results, are followed by a chapter 4 on remarks about exact algorithms for computing residence time results for certain mini-networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baskett,F.,Chandy,K.M.,Muntz,R.R.,Palacios,F.G.: Open, closed, and mixed networks of queues with different classes of customers. J. Assoc.Comput.Mach. 22 (1975), 248–260
Kelly,F.P.,Pollett,P.K.: Sojourn times in closed queuing networks. Adv.Appl.Prob. 15 (1983), 638–658
Kelly,F.P.: The dependence of sojourn times in closed queuing networks. Math.Comp.Perf.Rel.,G.Iazeolla et al.(ed.),Elsevier,1984
Kelly,F.P.: Reversibility and stochastic networks. Wiley,1979
Daduna,H.,Schassberger,R.: Sojourn times in queuing networks with multiserver nodes. Techn.Report,TU Berlin,1984
Melamed,B.: Sojourn times in queuing networks. Math.Oper.Res. 7 (1982), 233–244
Walrand,J.,Varaiya,P.P.: Sojourn times and the overtaking condition in Jacksonian networks. Adv.Appl.Prob. 12 (1980), 1000–1018
Daduna,H.: Cycle times in a starlike network with state-dependent routing. Techn.Report,U.Hamburg,1985
Towsley,D.: Queuing network models with state-dependent routing. J.Assoc.Comput.Mach. 27 (1980), 323–337
Barbour,A.D.,Schassberger,R.: Insensitive average residence times in generalized semi-Markov processes. Adv.Appl.Prob. 13 (1981), 720–735
Barbour,A.D.: Networks of queues and the method of stages. Adv. Appl.Prob. 8 (1976), 584–591
Jansen,U.: Conditional expected sojourn times in insensitive queuing systems and networks. Adv.Appl.Prob. 16 (1984), 906–919
Cohen,J.W.: The multiple phase service network with generalized processor sharing. Acta Informatica 12 (1979), 245–284
Daduna,H.,Schassberger,R.: Networks of queues in discrete time, Zeitschr.Oper.Res. 27 (1983), 159–175
Schassberger,R.,Daduna,H.: A discrete-time technique for solving closed queuing network models of computer systems. Messung, Modellierung and Bewertung von Rechensystemen, Kühn,P.,Schulz,K.M. (edts),Springer,1983
Kemeny,J.G.,Snell,J.L.: Finite Markov Chains. Springer,1976
Melamed,B.: Randomization procedures for numerical computation of delay time distributions in queuing systems. Bull.Int.Statist. Inst., 1983, 755–775
König,D.,Gnedenko,B.W.: Handbuch der Bedienungstheorie II, Akademie Verlag Berlin,1984
Daduna,H.: Two-stage cyclic queues with non-exponential servers: steady-state and cycle time, Op.Res.,to appear
Boxma,O.J.: The cyclic queue with one general and one exponential server. Adv.Appl.Prob. 15 (1983), 857–873
Boxma,O.J.: Analysis of successive cycles in a cyclic queue. Perf. Comp.Comm.Syst.,Bux,W.,Rudin,H. (edts.), North-Holland, 1984, 293–306
Daduna,H.: Cycle times in closed queuing networks, with applications to multiprogrammed computer systems with virtual memory. Op.Res.,in print
Daduna,H.: A closed tandem of processor sharing queues: residence time and cycle time distribution.
Coffman,E.G.,Fayolle,G.,Mitrani,I.: Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem. Techn.Report,1984
Fayolle,G.,Iasnogorodski,R.,Mitrani,I.: The distribution of sojourn times in a queuing network with overtaking: reduction to a boundary problem. Performance 83,North-Holland,1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schassberger, R. (1985). Exact Results on Response Time Distributions in Networks of Queues. In: Beilner, H. (eds) Messung, Modellierung und Bewertung von Rechensystemen. Informatik—Fachberichte, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87472-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-87472-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15969-8
Online ISBN: 978-3-642-87472-7
eBook Packages: Springer Book Archive