{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:55:08Z","timestamp":1780386908634,"version":"3.54.1"},"reference-count":34,"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-5567-6","type":"journal-article","created":{"date-parts":[[2006,5,5]],"date-time":"2006-05-05T10:27:27Z","timestamp":1146824847000},"page":"237-250","source":"Crossref","is-referenced-by-count":31,"title":["Large deviations of sojourn times in processor sharing queues"],"prefix":"10.1007","volume":"52","author":[{"given":"Michel","family":"Mandjes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bert","family":"Zwart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5567_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6377(94)90081-7","volume":"15","author":"J. Abate","year":"1994","unstructured":"J. Abate and W. Whitt, A heavy-traffic expansion for the asymptotic decay rates of tail probabilities in multi-channel queues, Operations Research Letters 15 (1994) 223\u2013230.","journal-title":"Operations Research Letters"},{"key":"5567_CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1019104402024","volume":"25","author":"J. Abate","year":"1997","unstructured":"J.Abate and W. Whitt, Asymptotics for M\/G\/1 low-priority waiting-time tail probabilities, Queueing Systems 25 (1997) 173\u2013233.","journal-title":"Queueing Systems"},{"key":"5567_CR3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0167-6377(97)00016-3","volume":"20","author":"J. Abate","year":"1997","unstructured":"J. Abate and W. Whitt, Limits and approximations for the M\/G\/1 LIFO waiting-time distribution, Operations Research Letters 20 (1997) 199\u2013206.","journal-title":"Operations Research Letters"},{"key":"5567_CR4","volume-title":"Applied Probability and Queues","author":"S. Asmussen","year":"2003","unstructured":"S. Asmussen, Applied Probability and Queues. Springer New York, (2003)."},{"key":"5567_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.2307\/1427918","volume":"28","author":"J. Bertoin","year":"1996","unstructured":"J. Bertoin and R. Doney, Some asymptotic results for transient random walks, Advances in Applied Probability 28 (1996) 207\u2013226.","journal-title":"Advances in Applied Probability"},{"key":"5567_CR6","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/S0167-6377(03)00006-3","volume":"31","author":"S.C. Borst","year":"2003","unstructured":"S.C. Borst, O.J. Boxma, J.A. Morrison and R. N\u00fa\u00f1ez-Queija, The equivalence between processor sharing and service in random order, Operations Research Letters 31 (2003) 254\u2013262.","journal-title":"Operations Research Letters"},{"key":"5567_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0166-5316(03)00071-3","volume":"54","author":"S.C. Borst","year":"2003","unstructured":"S.C. Borst, O.J. Boxma, R. Nunez-Queija and A.P. Zwart, The impact of the service discipline on delay asymptotics, Performance Evaluation 54 (2003) 177\u2013206.","journal-title":"Performance Evaluation"},{"key":"5567_CR8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1023\/B:QUES.0000021141.02821.6d","volume":"46","author":"O.J. Boxma","year":"2004","unstructured":"O.J. Boxma, S. Foss, J.-M. Lasgouttes and R. N\u00fa\u00f1ez-Queija, Waiting time asymptotics in the single server queue with service in random order, Queueing Systems 46 (2004) 35\u201373.","journal-title":"Queueing Systems"},{"key":"5567_CR9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/321556.321568","volume":"17","author":"E.G. Coffman Jr.","year":"1970","unstructured":"E.G. Coffman, Jr., R.R. Muntz and H. Trotter, Waiting time distributions for processor-sharing systems, Journal of the ACM 17 (1970) 123\u2013130.","journal-title":"Journal of the ACM"},{"key":"5567_CR10","first-page":"55","volume":"1","author":"P. Embrechts","year":"1982","unstructured":"P. Embrechts and N. Veraverbeke, Estimates for the probability of ruin with special emphasis on the possibility of large claims, Insurance: Mathematics and Economics 1 (1982) 55\u2013 72.","journal-title":"Insurance: Mathematics and Economics"},{"key":"5567_CR11","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1214\/aoap\/1034625337","volume":"7","author":"L. Flatto","year":"1997","unstructured":"L. Flatto, The waiting time distribution for the random order service M\/M\/1 queue. Annals of Applied Probability 7 (1997) 382\u2013 409.","journal-title":"Annals of Applied Probability"},{"key":"5567_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.2307\/3214953","volume":"31A","author":"P. Glynn","year":"1994","unstructured":"P. Glynn and W. Whitt, Logarithmic asymptotics for steady-state tail probabilities in a single-server queue. Journal of Applied Probability 31A (1994) 131\u2013156.","journal-title":"Journal of Applied Probability"},{"key":"5567_CR13","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1023\/A:1013913827667","volume":"39","author":"F. Guillemin","year":"2002","unstructured":"F. Guillemin and J. Boyer, Analysis of M\/M\/1 queue with processor sharing via spectral theory. Queueing Systems 39 (2002) 377\u2013397.","journal-title":"Queueing Systems"},{"key":"5567_CR14","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1239\/aap\/1086957584","volume":"36","author":"F. Guillemin","year":"2004","unstructured":"F. Guillemin, P. Robert and A.P. Zwart, Asymptotic results for processor sharing queues. Advances in Applied Probability 36 (2004) 525\u2013543.","journal-title":"Advances in Applied Probability"},{"key":"5567_CR15","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1214\/105051604000000035","volume":"14","author":"C. Gromoll","year":"2004","unstructured":"C. Gromoll, Diffusion approximation for a processor sharing queue in heavy traffic. Annals of Applied Probability 14 (2004) 555\u2013611.","journal-title":"Annals of Applied Probability"},{"key":"5567_CR16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01158692","volume":"17","author":"A. Jean-Marie","year":"1994","unstructured":"A. Jean-Marie and P. Robert, On the transient behavior of the processor sharing queue. Queueing Systems 17 (1994) 129\u2013136.","journal-title":"Queueing Systems"},{"key":"5567_CR17","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/moor.28.3.587.16396","volume":"28","author":"P. Jelenkovi\u0107","year":"2003","unstructured":"P. Jelenkovi\u0107 and P. Mom\u010dilovi\u0107, Large deviation analysis of subexponential waiting times in a processor-sharing queue. Mathematics of Operations Research 28 (2003) 587\u2013608.","journal-title":"Mathematics of Operations Research"},{"key":"5567_CR18","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0304-4149(97)00060-4","volume":"72","author":"D.A. Korshunov","year":"1997","unstructured":"D.A. Korshunov, On distribution tail of the maximum of a random walk. Stochastic Processes and their Applications 72 (1997) 97\u2013103.","journal-title":"Stochastic Processes and their Applications"},{"key":"5567_CR19","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1017\/S0269964805050205","volume":"19","author":"M. Mandjes","year":"2005","unstructured":"M. Mandjes and M. Nuyens, Sojourn times in the M\/G\/1 FB queue with light-tailed service times. Probability in the Engineering and Informational Sciences 19 (2005) 351\u2013361.","journal-title":"Probability in the Engineering and Informational Sciences"},{"key":"5567_CR20","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1137\/0145007","volume":"45","author":"J.A. Morrison","year":"1985","unstructured":"J.A. Morrison, Response-time distribution for a processor-sharing system. SIAM Journal of Applied Mathematics 45 (1985) 152\u2013167.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"5567_CR21","doi-asserted-by":"crossref","unstructured":"R. N\u00fa\u00f1ez-Queija, Queues with equally heavy sojourn time and service requirement distributions. Annals of Operations Research 113, 101\u2013117.","DOI":"10.1023\/A:1020905810996"},{"key":"5567_CR22","doi-asserted-by":"crossref","unstructured":"M. Nuyens and B. Zwart, A large deviations analysis of the GI\/GI\/1 SRPT queue. Submitted for publication (2005).","DOI":"10.1007\/s11134-006-8767-1"},{"key":"5567_CR23","doi-asserted-by":"crossref","first-page":"360","DOI":"10.2307\/3213646","volume":"21","author":"T. Ott","year":"1984","unstructured":"T. Ott, The sojourn-time distribution in the M\/G\/1 queue with processor sharing. Journal of Applied Probability 21 (1984) 360\u2013378.","journal-title":"Journal of Applied Probability"},{"key":"5567_CR24","unstructured":"Z. Palmowksi and T. Rolski, On the busy period asymptotics of GI\/G\/1 queues. (2004) Submitted for publication. Available at http:\/\/www.math.uni.wroc.pl\/~zpalma\/publication.html"},{"key":"5567_CR25","first-page":"353","volume":"222","author":"F. Pollaczek","year":"1946","unstructured":"F. Pollaczek, La loi d'attente des appels t\u00e9l\u00e9phoniques. Comptes Rendus Acad. Sci. Paris 222 (1946) 353\u2013355.","journal-title":"Comptes Rendus Acad. Sci. Paris"},{"key":"5567_CR26","unstructured":"A. Puha, A. Stolyar and R. Williams, The fluid limit of an overloaded processor sharing queue. Mathematics of Operations Research, (2004) to appear."},{"key":"5567_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aoap\/998926986","volume":"11","author":"K. Ramanan","year":"2001","unstructured":"K. Ramanan and A. Stolyar, Largest weighted delay first scheduling: large deviations and optimality. Annals of Applied Probability 11 (2001) 1\u201348.","journal-title":"Annals of Applied Probability"},{"key":"5567_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-13052-0","volume-title":"Stochastic Networks and Queues\u2014A probabilistic approach","author":"P. Robert","year":"2003","unstructured":"P. Robert, Stochastic Networks and Queues\u2014A probabilistic approach, Springer, New York, (2003)."},{"key":"5567_CR29","doi-asserted-by":"crossref","DOI":"10.1002\/9780470317044","volume-title":"Stochastic Processes for Insurance and Finance","author":"T. Rolski","year":"1999","unstructured":"T. Rolski, H. Schmidli, V. Schmidt and J. Teugels, Stochastic Processes for Insurance and Finance. Wiley, New York, (1999)."},{"key":"5567_CR30","volume-title":"Stochastic Processes","author":"S. Ross","year":"1996","unstructured":"S. Ross, Stochastic Processes. Wiley, New York, (1996)."},{"key":"5567_CR31","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/opre.14.4.670","volume":"14","author":"L.E. Schrage","year":"1966","unstructured":"L.E. Schrage and L.W. Miller, The queue M\/G\/1 with the shortest remaining processing time discipline, Operations Research 14 (1966) 670\u2013684.","journal-title":"Operations Research"},{"key":"5567_CR32","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02109851","volume":"2","author":"W. Whitt","year":"1993","unstructured":"W. Whitt, Tail probabilities with statistical multiplexing and effective bandwidths in multi-class queues, Telecommunication Systems 2 (1993) 71\u2013107.","journal-title":"Telecommunication Systems"},{"key":"5567_CR33","doi-asserted-by":"crossref","unstructured":"A. Wierman and M. Harchol-Balter, Classifying scheduling policies with respect to unfairness in an M\/GI\/1. Proceedings of ACM Sigmetrics, San Diego, CA (2003).","DOI":"10.1145\/781027.781057"},{"key":"5567_CR34","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1019142010994","volume":"35","author":"A.P. Zwart","year":"2000","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.","journal-title":"Queueing Systems"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-006-5567-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-006-5567-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-006-5567-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T17:47:56Z","timestamp":1627321676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-006-5567-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["5567"],"URL":"https:\/\/doi.org\/10.1007\/s11134-006-5567-6","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}