{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:28:58Z","timestamp":1725892138511},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540159698"},{"type":"electronic","value":"9783642874727"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/978-3-642-87472-7_9","type":"book-chapter","created":{"date-parts":[[2012,7,28]],"date-time":"2012-07-28T20:47:46Z","timestamp":1343508466000},"page":"115-126","source":"Crossref","is-referenced-by-count":0,"title":["Exact Results on Response Time Distributions in Networks of Queues"],"prefix":"10.1007","author":[{"given":"R.","family":"Schassberger","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321879.321887","volume":"22","author":"F Baskett","year":"1975","unstructured":"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\u2013260","journal-title":"J. Assoc.Comput.Mach"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"638","DOI":"10.2307\/1426623","volume":"15","author":"FP Kelly","year":"1983","unstructured":"Kelly,F.P.,Pollett,P.K.: Sojourn times in closed queuing networks. Adv.Appl.Prob. 15 (1983), 638\u2013658","journal-title":"Adv.Appl.Prob"},{"key":"9_CR3","unstructured":"Kelly,F.P.: The dependence of sojourn times in closed queuing networks. Math.Comp.Perf.Rel.,G.Iazeolla et al.(ed.),Elsevier,1984"},{"key":"9_CR4","unstructured":"Kelly,F.P.: Reversibility and stochastic networks. Wiley,1979"},{"key":"9_CR5","unstructured":"Daduna,H.,Schassberger,R.: Sojourn times in queuing networks with multiserver nodes. Techn.Report,TU Berlin,1984"},{"key":"9_CR6","first-page":"233","volume":"7","author":"B Melamed","year":"1982","unstructured":"Melamed,B.: Sojourn times in queuing networks. Math.Oper.Res. 7 (1982), 233\u2013244","journal-title":"Math.Oper.Res"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.2307\/1426753","volume":"12","author":"J Walrand","year":"1980","unstructured":"Walrand,J.,Varaiya,P.P.: Sojourn times and the overtaking condition in Jacksonian networks. Adv.Appl.Prob. 12 (1980), 1000\u20131018","journal-title":"Adv.Appl.Prob"},{"key":"9_CR8","unstructured":"Daduna,H.: Cycle times in a starlike network with state-dependent routing. Techn.Report,U.Hamburg,1985"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322186.322196","volume":"27","author":"D Towsley","year":"1980","unstructured":"Towsley,D.: Queuing network models with state-dependent routing. J.Assoc.Comput.Mach. 27 (1980), 323\u2013337","journal-title":"J.Assoc.Comput.Mach"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"720","DOI":"10.2307\/1426969","volume":"13","author":"AD Barbour","year":"1981","unstructured":"Barbour,A.D.,Schassberger,R.: Insensitive average residence times in generalized semi-Markov processes. Adv.Appl.Prob. 13 (1981), 720\u2013735","journal-title":"Adv.Appl.Prob"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"584","DOI":"10.2307\/1426145","volume":"8","author":"Barbour,A.D.","year":"1976","unstructured":"Barbour,A.D.: Networks of queues and the method of stages. Adv. Appl.Prob. 8 (1976), 584\u2013591","journal-title":"Adv. Appl.Prob"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"906","DOI":"10.2307\/1427346","volume":"16","author":"Jansen,U.","year":"1984","unstructured":"Jansen,U.: Conditional expected sojourn times in insensitive queuing systems and networks. Adv.Appl.Prob. 16 (1984), 906\u2013919","journal-title":"Adv.Appl.Prob"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00264581","volume":"12","author":"Cohen,J.W.","year":"1979","unstructured":"Cohen,J.W.: The multiple phase service network with generalized processor sharing. Acta Informatica 12 (1979), 245\u2013284","journal-title":"Acta Informatica"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01916912","volume":"27","author":"H Daduna","year":"1983","unstructured":"Daduna,H.,Schassberger,R.: Networks of queues in discrete time, Zeitschr.Oper.Res. 27 (1983), 159\u2013175","journal-title":"Zeitschr.Oper.Res"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Schassberger,R.,Daduna,H.: A discrete-time technique for solving closed queuing network models of computer systems. Messung, Modellierung and Bewertung von Rechensystemen, K\u00fchn,P.,Schulz,K.M. (edts),Springer,1983","DOI":"10.1007\/978-3-642-68830-0_9"},{"key":"9_CR16","volume-title":"Finite Markov Chains. Springer","author":"JG Snell","year":"1976","unstructured":"Kemeny,J.G.,Snell,J.L.: Finite Markov Chains. Springer,1976"},{"key":"9_CR17","unstructured":"Melamed,B.: Randomization procedures for numerical computation of delay time distributions in queuing systems. Bull.Int.Statist. Inst., 1983, 755\u2013775"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"K\u00f6nig,D.,Gnedenko,B.W.: Handbuch der Bedienungstheorie II, Akademie Verlag Berlin,1984","DOI":"10.1515\/9783112614747"},{"key":"9_CR19","unstructured":"Daduna,H.: Two-stage cyclic queues with non-exponential servers: steady-state and cycle time, Op.Res.,to appear"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"857","DOI":"10.2307\/1427328","volume":"15","author":"Boxma,O.J.","year":"1983","unstructured":"Boxma,O.J.: The cyclic queue with one general and one exponential server. Adv.Appl.Prob. 15 (1983), 857\u2013873","journal-title":"Adv.Appl.Prob"},{"key":"9_CR21","unstructured":"Boxma,O.J.: Analysis of successive cycles in a cyclic queue. Perf. Comp.Comm.Syst.,Bux,W.,Rudin,H. (edts.), North-Holland, 1984, 293\u2013306"},{"key":"9_CR22","unstructured":"Daduna,H.: Cycle times in closed queuing networks, with applications to multiprogrammed computer systems with virtual memory. Op.Res.,in print"},{"key":"9_CR23","unstructured":"Daduna,H.: A closed tandem of processor sharing queues: residence time and cycle time distribution."},{"key":"9_CR24","volume-title":"Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem Techn.Report","author":"EG Coffman","year":"1984","unstructured":"Coffman,E.G.,Fayolle,G.,Mitrani,I.: Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem. Techn.Report,1984"},{"key":"9_CR25","volume-title":"The distribution of sojourn times in a queuing network with overtaking: reduction to a boundary problem","author":"G Fayolle","year":"1983","unstructured":"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."}],"container-title":["Messung, Modellierung und Bewertung von Rechensystemen"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-87472-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T20:03:43Z","timestamp":1687637023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-87472-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540159698","9783642874727"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-87472-7_9","relation":{},"subject":[],"published":{"date-parts":[[1985]]}}}