{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T14:10:03Z","timestamp":1742652603284,"version":"3.40.2"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T00:00:00Z","timestamp":1330992000000},"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":[[2012,4]]},"DOI":"10.1007\/s11134-012-9282-1","type":"journal-article","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T00:42:57Z","timestamp":1330994577000},"page":"369-409","source":"Crossref","is-referenced-by-count":0,"title":["Additive functionals with application to sojourn times in infinite-server and processor sharing systems"],"prefix":"10.1007","volume":"70","author":[{"given":"Manfred","family":"Brandt","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Brandt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,6]]},"reference":[{"key":"9282_CR1","series-title":"Applications of Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11657-9","volume-title":"Elements of Queueing Theory","author":"F. Baccelli","year":"2003","unstructured":"Baccelli, F., Br\u00e9maud, P.: Elements of Queueing Theory. Applications of Mathematics, vol.\u00a026. Springer, Berlin (2003)"},{"key":"9282_CR2","doi-asserted-by":"crossref","first-page":"4257","DOI":"10.1090\/S0002-9939-08-09504-X","volume":"136","author":"N.H. Bingham","year":"2008","unstructured":"Bingham, N.H., Ostaszewski, A.J.: Generic subadditive functions. Proc. Am. Math. Soc. 136, 4257\u20134266 (2008)","journal-title":"Proc. Am. Math. Soc."},{"key":"9282_CR3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0166-5316(02)00110-4","volume":"49","author":"T. Bonald","year":"2002","unstructured":"Bonald, T., Prouti\u00e8re, A.: Insensitivity in processor-sharing networks. Perform. Eval. 49, 193\u2013209 (2002)","journal-title":"Perform. Eval."},{"key":"9282_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1023237129453","volume":"43","author":"S. Borst","year":"2003","unstructured":"Borst, S., Boxma, O., Jelenkovic, P.: Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows. Queueing Syst. 43, 273\u2013306 (2003)","journal-title":"Queueing Syst."},{"key":"9282_CR5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s11134-006-6264-1","volume":"52","author":"A. Brandt","year":"2006","unstructured":"Brandt, A., Brandt, M.: A sample path relation for the sojourn times in G\/G\/1-PS systems and its applications. Queueing Syst. 52, 281\u2013286 (2006)","journal-title":"Queueing Syst."},{"key":"9282_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s11134-008-9086-5","volume":"59","author":"A. Brandt","year":"2008","unstructured":"Brandt, A., Brandt, M.: Waiting times for M\/M systems under state-dependent processor sharing. Queueing Syst. 59, 297\u2013319 (2008)","journal-title":"Queueing Syst."},{"key":"9282_CR7","unstructured":"Brandt, A., Brandt, M.: Approximations for the second moments of sojourn times in M\/GI systems under state-dependent processor sharing. Konrad\u2013Zuse\u2013Zentrum f\u00fcr Informationstechnik Berlin, ZIB-Report 09-25, 1\u201312 (2009). Available at http:\/\/opus.kobv.de\/zib\/volltexte\/2009\/1190\/"},{"key":"9282_CR8","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1239\/aap\/1269611152","volume":"42","author":"A. Brandt","year":"2010","unstructured":"Brandt, A., Brandt, M.: Insensitive bounds for the moments of the sojourn times in M\/GI systems under state-dependent processor sharing. Adv. Appl. Probab. 42, 246\u2013267 (2010)","journal-title":"Adv. Appl. Probab."},{"key":"9282_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s11134-009-9157-2","volume":"64","author":"M. Brandt","year":"2010","unstructured":"Brandt, M., Brandt, A.: On sojourn times in M\/GI systems under state-dependent processor sharing. Queueing Syst. 64, 167\u2013201 (2010)","journal-title":"Queueing Syst."},{"key":"9282_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9783112727515","volume-title":"Stationary Stochastic Models","author":"A. Brandt","year":"1990","unstructured":"Brandt, A., Franken, P., Lisek, B.: Stationary Stochastic Models. Akademie, Berlin. (1990) Wiley, Chichester (1990)"},{"key":"9282_CR11","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s11134-006-7583-y","volume":"53","author":"S.-K. Cheung","year":"2006","unstructured":"Cheung, S.-K., van\u00a0den Berg, H., Boucherie, R.J.: Insensitive bounds for the moments of the sojourn time distribution in the M\/G\/1 processor-sharing queue. Queueing Syst. 53, 7\u201318 (2006)","journal-title":"Queueing Syst."},{"key":"9282_CR12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/321556.321568","volume":"17","author":"E.G. Coffman","year":"1970","unstructured":"Coffman, E.G., Muntz, R.R., Trotter, H.: Waiting time distributions for processor-sharing systems. J.\u00a0Assoc. Comput. Mach. 17, 123\u2013130 (1970)","journal-title":"J.\u00a0Assoc. Comput. Mach."},{"key":"9282_CR13","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00264581","volume":"12","author":"J.W. Cohen","year":"1979","unstructured":"Cohen, J.W.: The multiple phase service network with generalized processor sharing. Acta Inform. 12, 245\u2013284 (1979)","journal-title":"Acta Inform."},{"key":"9282_CR14","volume-title":"An Introduction to the Theory of Point Processes","author":"D.J. Daley","year":"1988","unstructured":"Daley, D.J., Vere-Jones, D.: An Introduction to the Theory of Point Processes. Springer, New York (1988)"},{"key":"9282_CR15","volume-title":"Queues and Point Processes","author":"P. Franken","year":"1981","unstructured":"Franken, P., K\u00f6nig, D., Arndt, U., Schmidt, V.: Queues and Point Processes. Akademie, Berlin (1981). Wiley, Chichester (1982)"},{"key":"9282_CR16","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1239\/aap\/1086957584","volume":"36","author":"F. Guillemin","year":"2004","unstructured":"Guillemin, F., Robert, P., Zwart, B.: Tail asymptotics for processor-sharing queues. Adv. Appl. Probab. 36, 525\u2013543 (2004)","journal-title":"Adv. Appl. Probab."},{"key":"9282_CR17","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s11134-008-9081-x","volume":"59","author":"R.C. Hampshire","year":"2008","unstructured":"Hampshire, R.C., Massey, W.A.: A note on the event horizon for a processor sharing queue. Queueing Syst. 59, 185\u2013190 (2008)","journal-title":"Queueing Syst."},{"key":"9282_CR18","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s11134-006-7584-x","volume":"53","author":"R.C. Hampshire","year":"2006","unstructured":"Hampshire, R.C., Harchol-Balter, M., Massey, W.A.: Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates. Queueing Syst. 53, 19\u201330 (2006)","journal-title":"Queueing Syst."},{"key":"9282_CR19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00533102","volume":"25","author":"J. Horowitz","year":"1973","unstructured":"Horowitz, J.: Short proof of a \u201cRadon\u2013Nikodym theorem\u201d for additive functionals. Z. Wahrscheinlichkeitstheor. Verw. Geb. 25, 159\u2013162 (1973)","journal-title":"Z. Wahrscheinlichkeitstheor. Verw. Geb."},{"key":"9282_CR20","series-title":"Probability and Its Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4015-8","volume-title":"Foundations of Modern Probability","author":"O. Kallenberg","year":"2002","unstructured":"Kallenberg, O.: Foundations of Modern Probability, 2nd edn. Probability and Its Applications. Springer, New York (2002)","edition":"2"},{"key":"9282_CR21","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01158868","volume":"14","author":"M.Y. Kitaev","year":"1993","unstructured":"Kitaev, M.Y.: The M\/G\/1 processor-sharing model: transient behavior. Queueing Syst. 14, 239\u2013273 (1993)","journal-title":"Queueing Syst."},{"key":"9282_CR22","unstructured":"Lambert, A., Simatos, F., Zwart, B.: Scaling limits via excursion theory: interplay between Crump\u2013Mode\u2013Jagers branching processes and processor-sharing queues. arXiv:1102.5620v1 (2011), pp. 1\u201338"},{"key":"9282_CR23","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/3213654","volume":"21","author":"V. Ramaswami","year":"1984","unstructured":"Ramaswami, V.: The sojourn time in the GI\/M\/1 queue with processor sharing. J. Appl. Probab. 21, 437\u2013442 (1984)","journal-title":"J. Appl. Probab."},{"key":"9282_CR24","first-page":"283","volume-title":"Probability Theory and Applications","author":"A.L. Tolmachev","year":"1987","unstructured":"Tolmachev, A.L.: Insensitivity in queueing networks with generalized processor-sharing discipline. In: Probability Theory and Applications, Proc. World Congr. Bernoulli Soc., Tashkent 1986, Vol. 1, pp. 283\u2013286 (1987)"},{"issue":"9","key":"9282_CR25","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1134\/S0005117907090202","volume":"68","author":"S.F. Yashkov","year":"2007","unstructured":"Yashkov, S.F., Yashkova, A.S.: Processor sharing: a survey of the mathematical theory. Autom. Remote Control 68(9), 1662\u20131731 (2007)","journal-title":"Autom. Remote Control"},{"key":"9282_CR26","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1239\/jap\/1175267175","volume":"44","author":"S. Zachary","year":"2007","unstructured":"Zachary, S.: A note on insensitivity in stochastic networks. J. Appl. Probab. 44, 238\u2013248 (2007)","journal-title":"J. Appl. Probab."},{"key":"9282_CR27","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s00186-010-0328-z","volume":"72","author":"Q. Zhen","year":"2010","unstructured":"Zhen, Q., van Leeuwaarden, J.S.H., Knessl, C.: On a processor sharing queue that models balking. Math. Methods Oper. Res. 72, 453\u2013476 (2010)","journal-title":"Math. Methods Oper. Res."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-012-9282-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-012-9282-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-012-9282-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T13:36:12Z","timestamp":1742650572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-012-9282-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,6]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9282"],"URL":"https:\/\/doi.org\/10.1007\/s11134-012-9282-1","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"type":"print","value":"0257-0130"},{"type":"electronic","value":"1572-9443"}],"subject":[],"published":{"date-parts":[[2012,3,6]]}}}