{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:14:14Z","timestamp":1773656054626,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,4,1]],"date-time":"2006-04-01T00:00:00Z","timestamp":1143849600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s11134-006-6264-1","type":"journal-article","created":{"date-parts":[[2006,5,5]],"date-time":"2006-05-05T10:27:27Z","timestamp":1146824847000},"page":"281-286","source":"Crossref","is-referenced-by-count":9,"title":["A sample path relation for the sojourn times in G\/G\/1\u2212PS systems and its applications"],"prefix":"10.1007","volume":"52","author":[{"given":"Andreas","family":"Brandt","sequence":"first","affiliation":[]},{"given":"Manfred","family":"Brandt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6264_CR1","doi-asserted-by":"crossref","unstructured":"F. Baccelli and P. Br\u00e9maud, Elements of Queueing Theory. Applications of Mathematics 26, (Springer-Verlag, Berlin, 2003).","DOI":"10.1007\/978-3-662-11657-9"},{"key":"6264_CR2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01154546","volume":"7","author":"F. Baccelli","year":"1990","unstructured":"F. Baccelli and D. Towsley, The customer response times in the processor sharing queue are associated, Queueing Systems 7 (1990) 269\u2013282.","journal-title":"Queueing Systems"},{"key":"6264_CR3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/S0167-6377(03)00029-4","volume":"31","author":"N. Bansal","year":"2003","unstructured":"N. Bansal, Analysis of the M\/G\/1 processor-sharing queue with bulk arrivals, Oper. Res. Lett. 31 (2003) 401\u2013405.","journal-title":"Oper. Res. Lett."},{"key":"6264_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1023237129453","volume":"43","author":"S. Borst","year":"2003","unstructured":"S. Borst, O. Boxma, and P. Jelenkovi\u0107, Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows, Queueing Systems 43 (2003) 273\u2013306.","journal-title":"Queueing Systems"},{"key":"6264_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01194397","volume":"47","author":"A. Brandt","year":"1998","unstructured":"A. Brandt and M. Brandt, On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers, Math. Methods Oper. Res. 47 (1998) 181\u2013220.","journal-title":"Math. Methods Oper. Res."},{"key":"6264_CR6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/A:1019155524681","volume":"32","author":"A. Brandt","year":"1999","unstructured":"A. Brandt and M. Brandt, A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers, Queueing Systems 32 (1999) 363\u2013381.","journal-title":"Queueing Systems"},{"key":"6264_CR7","doi-asserted-by":"crossref","unstructured":"A. Brandt, P. Franken, and B. Lisek, Stationary Stochastic Models (Akademie-Verlag, Berlin; Wiley, Chichester, 1990).","DOI":"10.1515\/9783112727515"},{"key":"6264_CR8","volume-title":"Queues and Point Processes","author":"P. Franken","year":"1982","unstructured":"P. Franken, D. K\u00f6nig, U. Arndt, and V. Schmidt, Queues and Point Processes (Akademie-Verlag, Berlin; Wiley, Chichester, 1982)."},{"key":"6264_CR9","unstructured":"D. Gross and C.M. Harris, Fundamentals of Queueing Theory (Wiley, New York, 1998)."},{"key":"6264_CR10","doi-asserted-by":"crossref","unstructured":"L. Kleinrock, R.R. Muntz and E. Rodemich, The processor-sharing queueing model for time-shared systems with bulk arrivals, Networks 1 (1971) 1\u201313.","DOI":"10.1002\/net.3230010103"},{"key":"6264_CR11","unstructured":"W. Kr\u00e4mer and M. Langenbach-Belz, Approximate formulae for the delay in the queueing system GI\/G\/1, in: Proc. ITC 8, Melbourne, Australia, (1976) pp.235."},{"key":"6264_CR12","doi-asserted-by":"crossref","unstructured":"R. N\u00f9\u00f1ez-Queija, Sojourn times in a processor sharing queue with service interruptions, Queueing Systems 34 (2000) 351\u2013386.","DOI":"10.1023\/A:1019173523289"},{"key":"6264_CR13","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/3213654","volume":"21","author":"V. Ramaswami","year":"1984","unstructured":"V. Ramaswami, The sojourn time in the GI\/M\/1 queue with processor sharing, J. Appl. Probab. 21 (1984) 437\u2013442.","journal-title":"J. Appl. Probab."},{"key":"6264_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/15326349208807213","volume":"8","author":"B. Sengupta","year":"1992","unstructured":"B. Sengupta, An approximation for the sojourn-time distribution for the GI\/G\/1 processor-sharing queue, Commun. Statist. Stochastic Models 8 (1992) 35\u201357.","journal-title":"Commun. Statist. Stochastic Models"},{"key":"6264_CR15","unstructured":"H.C. Tijms, Stochastic Models: An Algorithmic Approach (Wiley, Chichester, 1994)."},{"key":"6264_CR16","doi-asserted-by":"crossref","unstructured":"M. van Uitert and S.C. Borst, A reduced-load equivalence for generalised processor sharing networks with long-tailed input flows, Queueing Systems 41 (2002) 123\u2013163.","DOI":"10.1023\/A:1015785919268"},{"key":"6264_CR17","volume-title":"Stochastic Modeling and the Theory of Queues","author":"R.W. Wolff","year":"1989","unstructured":"R.W. Wolff, Stochastic Modeling and the Theory of Queues (Prentice-Hall International, Englewood Cliffs, N.J., 1989)."},{"key":"6264_CR18","unstructured":"S.F. Yashkov, Mathematical problems in the theory of shared-processor systems, J. Soviet Math. 58 (1992) 101\u2013147. (Original Russian version in: Itogi Nauki i Tekhniki, Seriya Teoriya Veroyatnostei, Matematicheskaya Statistika, Teoreticheskaya Kibernetika 29 (1990) 3\u201382.)"},{"key":"6264_CR19","doi-asserted-by":"crossref","unstructured":"A.P. Zwart and O.J. Boxma, Sojourn time asymptotics in the M\/G\/1 processor sharing queue, Queueing Systems 35 (2000) 141\u2013166.","DOI":"10.1023\/A:1019142010994"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-006-6264-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-006-6264-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-006-6264-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T20:42:53Z","timestamp":1736368973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-006-6264-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["6264"],"URL":"https:\/\/doi.org\/10.1007\/s11134-006-6264-1","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}