{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T19:29:41Z","timestamp":1791142181885,"version":"4.1.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"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,6]]},"DOI":"10.1007\/s11134-006-7585-9","type":"journal-article","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T13:35:24Z","timestamp":1147354524000},"page":"31-51","source":"Crossref","is-referenced-by-count":36,"title":["Sojourn time asymptotics in processor-sharing queues"],"prefix":"10.1007","volume":"53","author":[{"given":"Sem","family":"Borst","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rudesindo","family":"N\u00fa\u00f1ez-Queija","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bert","family":"Zwart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"7585_CR1","doi-asserted-by":"crossref","unstructured":"E. Altman, K. Avrachenkov, and U. Ayesta, A survey on Discriminatory Processor Sharing (2006). In this special issue.","DOI":"10.1007\/s11134-006-7586-8"},{"key":"7585_CR2","volume-title":"Applied Probability and Queues","author":"S. Asmussen","year":"2003","unstructured":"S. Asmussen, Applied Probability and Queues (Springer-Verlag, New York, 2003)."},{"key":"7585_CR3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0304-4149(98)00064-7","volume":"79","author":"S. Asmussen","year":"1999","unstructured":"S. Asmussen, C. Kl\u00fcppelberg, and K. Sigman, Sampling at subexponential times, with queueing applications, Stoch. Proc. Appl. 79 (1999) 265\u2013286.","journal-title":"Stoch. Proc. Appl."},{"key":"7585_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.peva.2004.11.012","volume":"61","author":"R. Bekker","year":"2005","unstructured":"R. Bekker, S.C. Borst, and R. N\u00fa nez-Queija, Performance of TCP-friendly streaming sessions in the presence of heavy-tailed elastic flows, Perf. Evaluation 61 (2005) 143\u2013162.","journal-title":"Perf. Evaluation"},{"key":"7585_CR5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF01159223","volume":"9","author":"J.L. Berg van den","year":"1991","unstructured":"J.L. van den Berg and O.J. Boxma, The M\/G\/1 queue with processor sharing and its relation to a feedback queue, Queueing Systems 9 (1991) 365\u2013402.","journal-title":"Queueing Systems"},{"key":"7585_CR6","doi-asserted-by":"crossref","first-page":"711","DOI":"10.2307\/1426188","volume":"6","author":"N.H. Bingham","year":"1974","unstructured":"N.H. Bingham and R.A. Doney, Asymptotic properties of supercritical branching processes I: the Galton-Watson process, Adv. Appl. Prob. 6 (1974) 711\u2013731.","journal-title":"Adv. Appl. Prob."},{"key":"7585_CR7","doi-asserted-by":"crossref","unstructured":"N.H. Bingham, C.M. Goldie, and J.L. Teugels, Regular Variation (Cambridge University Press, 1987).","DOI":"10.1017\/CBO9780511721434"},{"key":"7585_CR8","doi-asserted-by":"crossref","unstructured":"T. Bonald and L. Massouli\u00e9, Impact of fairness on Internet performance, in: Proc. ACM Sigmetrics\/Performance (2001).","DOI":"10.1145\/378420.378438"},{"key":"7585_CR9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0166-5316(02)00110-4","volume":"49","author":"T. Bonald","year":"2002","unstructured":"T. Bonald and A. Prouti\u00e8re, Insensitivity in processor sharing networks, Perf. Evaluation 49 (2002) 193\u2013209.","journal-title":"Perf. Evaluation"},{"key":"7585_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1023\/A:1024094807532","volume":"44","author":"T. Bonald","year":"2003","unstructured":"T. Bonald and A. Prouti\u00e8re, Insensitive bandwidth sharing in data networks, Queueing Systems 44 (2003) 69\u2013100.","journal-title":"Queueing Systems"},{"key":"7585_CR11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/B:QUES.0000032802.41986.c6","volume":"47","author":"T. Bonald","year":"2004","unstructured":"T. Bonald and A. Prouti\u00e8re, On stochastic bounds for monotonic processor sharing networks, Queueing Systems 47 (2004) 81\u2013106.","journal-title":"Queueing Systems"},{"key":"7585_CR12","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 nez-Queija, The equivalence between processor sharing and service in random order, Oper. Res. Lett. 31 (2003) 254\u2013262.","journal-title":"Oper. Res. Lett."},{"key":"7585_CR13","first-page":"177","volume":"54","author":"S.C. Borst","year":"2003","unstructured":"S.C. Borst, O.J. Boxma, R. N\u00fa nez-Queija, and A.P. Zwart, The impact of the service discipline on delay asymptotics, Perf. Evaluation 54 (2003) 177\u2013206.","journal-title":"Perf. Evaluation"},{"key":"7585_CR14","doi-asserted-by":"crossref","unstructured":"S.C. Borst, R. N\u00fa nez-Queija, and M.J.G. van Uitert, User-level performance of elastic traffic in a differentiated-services environment, Proc. Performance (2002) 507\u2013519.","DOI":"10.1016\/S0166-5316(02)00117-7"},{"key":"7585_CR15","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1007\/BF03179722","volume":"59","author":"S.C. Borst","year":"2004","unstructured":"S.C. Borst, R. N\u00fa nez-Queija, and A.P. Zwart, Bandwidth sharing with heterogeneous service requirements, Ann. Telecommun. 59 (2004) 1297\u20131311.","journal-title":"Ann. Telecommun"},{"key":"7585_CR16","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.peva.2004.11.010","volume":"61","author":"S.C. Borst","year":"2005","unstructured":"S.C. Borst, D.T.M.B. van Ooteghem, and A.P. Zwart, Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements, Perf. Evaluation 61 (2005) 281\u2013298.","journal-title":"Perf. Evaluation"},{"key":"7585_CR17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1145\/277858.277881","volume":"26","author":"O.J. Boxma","year":"1998","unstructured":"O.J. Boxma and V. Dumas, The busy period in the fluid queue, Perf. Eval. Rev. 26 (1998) 100\u2013110.","journal-title":"Perf. Eval. Rev."},{"key":"7585_CR18","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/1110037","volume":"10","author":"L. Breiman","year":"1965","unstructured":"L. Breiman. On some limit theorems similar to the arc-sin law, Theory of Prob. Appl. 10 (1965) 351\u2013360.","journal-title":"Theory of Prob. Appl."},{"key":"7585_CR19","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 distribution for processor-sharing systems, J. ACM 17 (1970) 123\u2013130.","journal-title":"J. ACM"},{"key":"7585_CR20","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00264581","volume":"12","author":"J.W. Cohen","year":"1979","unstructured":"J.W. Cohen, The multiple phase service network with generalised processor sharing, Acta Informatica 12 (1979) 245\u2013284.","journal-title":"Acta Informatica"},{"key":"7585_CR21","doi-asserted-by":"crossref","unstructured":"M. Crovella and A. Bestavros, Self-similarity in World Wide Web traffic: Evidence and possible causes, in: Proc. ACM Sigmetrics (1996) pp. 160\u2013169.","DOI":"10.1145\/233013.233038"},{"key":"7585_CR22","unstructured":"F. Delcoigne, A. Prouti\u00e8re, and G. R\u00e9gni\u00e9, Modelling integration of streaming and data traffic, in: Proc. ITC Specialist Seminar (W\u00fcrzburg, Germany, 2002)."},{"key":"7585_CR23","doi-asserted-by":"crossref","unstructured":"R. Egorova, A.P. Zwart, and O.J. Boxma, Sojourn time tails in the M\/D\/1 processor sharing queue. SPOR-Report 2005-05, Eindhoven University of Technology, Prob. Eng. Inf. Sciences (2006) to appear.","DOI":"10.1017\/S0269964806060268"},{"key":"7585_CR24","doi-asserted-by":"crossref","unstructured":"P. Embrechts, C. Kl\u00fcppelberg, and T. Mikosch, Modeling Extremal Events (Springer, 1997).","DOI":"10.1007\/978-3-642-33483-2"},{"key":"7585_CR25","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/322203.322212","volume":"27","author":"G. Fayolle","year":"1980","unstructured":"G. Fayolle, I. Mitrani, and R. Iasnogorodski, Sharing a processor among many job classes, J. ACM 27 (1980) 519\u2013532.","journal-title":"J. ACM"},{"key":"7585_CR26","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, Ann. Appl. Prob. 7 (1997) 382\u2013409.","journal-title":"Ann. Appl. Prob."},{"key":"7585_CR27","first-page":"543","volume":"6","author":"S. Foss","year":"2000","unstructured":"S. Foss and D.A. Korshunov, Sampling at random time with a heavy-tailed distribution, Markov Proc. Rel. Fields 6 (2000) 543\u2013568.","journal-title":"Markov Proc. Rel. Fields"},{"key":"7585_CR28","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1239\/aap\/1086957584","volume":"36","author":"F. Guillemin","year":"2004","unstructured":"F. Guillemin, Ph. Robert, and A.P. Zwart, Tail asymptotics for processor sharing queues, Adv. Appl. Prob. 36 (2004) 525\u2013543.","journal-title":"Adv. Appl. Prob."},{"key":"7585_CR29","doi-asserted-by":"crossref","unstructured":"D.P. Heyman, T.V. Lakshman, and A.L. Neidhardt, A new method for analysing feedback-based protocols with applications to engineering Web traffic over the Internet, in: Proc. ACM Sigmetrics (1997) 24\u201338.","DOI":"10.1145\/258612.258670"},{"key":"7585_CR30","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1080\/15326349108807197","volume":"7","author":"D.L. Jagerman","year":"1991","unstructured":"D.L. Jagerman and B. Sengupta, The GI\/M\/1 processor-sharing queue and its heavy traffic analysis, Comm. Statist.\u2014Stoch. Models 7 (1991) 379\u2013395.","journal-title":"Comm. Statist.\u2014Stoch. Models"},{"key":"7585_CR31","doi-asserted-by":"crossref","unstructured":"P.R. Jelenkovi\u0107, Network multiplexer with truncated heavy-tailed arrival streams, in: Proc. IEEE Infocom (New York, NY, USA, 1999) pp. 625\u2013633.","DOI":"10.1109\/INFCOM.1999.751448"},{"key":"7585_CR32","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/moor.28.3.587.16396","volume":"28","author":"P.R. Jelenkovi\u0107","year":"2003","unstructured":"P.R. Jelenkovi\u0107 and P. Mom\u010cilovi\u0107, Large deviation analysis of subexponential waiting times in a processor sharing queue, Math. Oper. Res. 28 (2003) 587\u2013608.","journal-title":"Math. Oper. Res."},{"key":"7585_CR33","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/B:QUES.0000021143.87779.3f","volume":"46","author":"P.R. Jelenkovi\u0107","year":"2004","unstructured":"P.R. Jelenkovi\u0107, P. Mom\u010cilovi\u0107, and A.P. Zwart, Reduced load equivalence under subexponentiality, Queueing Systems 46 (2004) 97\u2013112.","journal-title":"Queueing Systems"},{"key":"7585_CR34","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800110105","volume":"11","author":"L. Kleinrock","year":"1964","unstructured":"L. Kleinrock, Analysis of a time-shared processor, Nav. Res. Log. Quarterly 11 (1964) 59\u201373.","journal-title":"Nav. Res. Log. Quarterly"},{"key":"7585_CR35","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/321386.321388","volume":"14","author":"L. Kleinrock","year":"1967","unstructured":"L. Kleinrock, Time-shared systems: A theoretical treatment, J. ACM 14 (1967) 242\u2013261.","journal-title":"J. ACM"},{"key":"7585_CR36","doi-asserted-by":"crossref","unstructured":"M.R.H. Mandjes and A.P. Zwart, Large deviations for sojourn times in processor sharing queues, Queueing Systems (to appear).","DOI":"10.1007\/s11134-006-5567-6"},{"key":"7585_CR37","doi-asserted-by":"crossref","unstructured":"L. Massouli\u00e9 and J.W. Roberts, Bandwidth sharing: Objectives and algorithms, in: Proc. IEEE Infocom (New York, NY, USA, 1999) 1395\u20131403.","DOI":"10.1109\/INFCOM.1999.752159"},{"key":"7585_CR38","first-page":"113","volume-title":"Proc. Performance","author":"D. Mitra","year":"1981","unstructured":"D. Mitra, Waiting time distributions from closed queueing network models of shared-processor systems, in: F.J. Kylstra (ed.), Proc. Performance, North-Holland, Amsterdam (1981) 113\u2013131."},{"key":"7585_CR39","doi-asserted-by":"crossref","first-page":"813","DOI":"10.2307\/1427326","volume":"15","author":"D. Mitra","year":"1983","unstructured":"D. Mitra and J.A. Morrison, Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes, Adv. Appl. Prob. 15 (1983) 813\u2013839.","journal-title":"Adv. Appl. Prob."},{"key":"7585_CR40","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 J. Appl. Math. 45 (1985) 152\u2013167.","journal-title":"SIAM J. Appl. Math."},{"key":"7585_CR41","doi-asserted-by":"crossref","first-page":"163","DOI":"10.2307\/1427058","volume":"17","author":"J.A. Morrison","year":"1985","unstructured":"J.A. Morrison and D. Mitra, Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes, Adv. Appl. Prob. 17 (1985) 163\u2013185.","journal-title":"Adv. Appl. Prob."},{"key":"7585_CR42","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0166-5316(98)00040-6","volume":"34","author":"M. Nabe","year":"1998","unstructured":"M. Nabe, M. Murata, and H. Miyahara, Analysis and modelling of World Wide Web traffic for capacity dimensioning of Internet access lines, Perf. Evaluation 34 (1998) 249\u2013271.","journal-title":"Perf. Evaluation"},{"key":"7585_CR43","unstructured":"R. N\u00fa nez-Queija, Processor-Sharing Models for Integrated-Services Networks, Ph.D. thesis, Eindhoven University of Technology (2000) ISBN 90-646-4667-8 (also available from the author upon request)."},{"key":"7585_CR44","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/A:1020905810996","volume":"113","author":"R. N\u00fanez-Queija","year":"2002","unstructured":"R. N\u00fa nez-Queija, Queues with equally heavy sojourn time and service requirement distributions, Ann. Oper. Res. 113 (2002) 101\u2013117.","journal-title":"Ann. Oper. Res."},{"key":"7585_CR45","unstructured":"M. Nuyens, A. Wierman, and A.P. Zwart, Preventing large sojourn times with SMART scheduling, (SPOR Report 2005-13, Eindhoven University of Technology, 2005). Submitted for publication."},{"key":"7585_CR46","doi-asserted-by":"crossref","unstructured":"M. Nuyens and A.P. Zwart, A large deviations analysis of the GI\/GI\/1 SRPT queue (SPOR Report 2005\u201306, Eindhoven University of Technology, 2005). Submitted for publication.","DOI":"10.1007\/s11134-006-8767-1"},{"key":"7585_CR47","unstructured":"D.T.M.B. van Ooteghem, A.P. Zwart, and S.C. Borst, A stochastic mean-value method for the derivation of delay asymptotics in heavy-tailed processor-sharing systems (SPOR Report 2004-11, Eindhoven University of Technology, 2004)."},{"key":"7585_CR48","doi-asserted-by":"crossref","first-page":"360","DOI":"10.2307\/3213646","volume":"21","author":"T.J. Ott","year":"1984","unstructured":"T.J. Ott, The sojourn time distributions in the M\/G\/1 queue with processor sharing, J. Appl. Prob. 21 (1984) 360\u2013378.","journal-title":"J. Appl. Prob."},{"key":"7585_CR49","unstructured":"Z. Palmowksi and T. Rolski, On busy period asymptotics in the GI\/GI\/1 queue, Available at http:\/\/www.math.uni.wroc.pl~zpalma\/publication.html. Submitted for publication."},{"key":"7585_CR50","first-page":"352","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) 352\u2013355.","journal-title":"Comptes Rendus Acad. Sci. Paris"},{"key":"7585_CR51","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. Prob. 21 (1984) 437\u2013442.","journal-title":"J. Appl. Prob."},{"key":"7585_CR52","unstructured":"M. Sakata, S. Noguchi, and J. Oizumi, Analysis of a processor-shared queueing model for time-sharing systems, in: Proc. 2nd Hawaii Int. Conf. System Sciences (1969) pp. 625\u2013628."},{"key":"7585_CR53","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1287\/opre.19.2.371","volume":"19","author":"M. Sakata","year":"1971","unstructured":"M. Sakata, S. Noguchi, and J. Oizumi, An analysis of the M\/G\/1 queue under round-robin scheduling, Oper. Res. 19 (1971) 371\u2013385.","journal-title":"Oper. Res."},{"key":"7585_CR54","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1002\/j.1538-7305.1985.tb00440.x","volume":"64","author":"B. Sengupta","year":"1985","unstructured":"B. Sengupta and D.L. Jagerman, A conditional response time of the M\/M\/1 processor-sharing queue, AT&T Techn. J. 64 (1985) 409\u2013421.","journal-title":"AT&T Techn. J."},{"key":"7585_CR55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01182931","volume":"2","author":"S.F. Yashkov","year":"1987","unstructured":"S.F. Yashkov, Processor-sharing queues: Some progress in analysis, Queueing Systems 2 (1987) 1\u201317.","journal-title":"Queueing Systems"},{"key":"7585_CR56","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01097426","volume":"58","author":"S.F. Yashkov","year":"1992","unstructured":"S.F. Yashkov, Mathematical problems in the theory of processor-sharing queueing systems, J. Soviet Math. 58 (1992) 101\u2013147.","journal-title":"J. Soviet Math."},{"key":"7585_CR57","first-page":"335","volume-title":"Teletraffic Engineering in a Competitive World, Proc.ITC-16, Edinburgh, UK","author":"A.P. Zwart","year":"1999","unstructured":"A.P. Zwart, Sojourn times in a multi-class processor sharing queue, in: P. Key and D. Smith (eds.), Teletraffic Engineering in a Competitive World, Proc. ITC-16, Edinburgh, UK, (North-Holland, Amsterdam) (1999) 335\u2013344."},{"key":"7585_CR58","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1287\/moor.26.3.485.10584","volume":"26","author":"A.P. Zwart","year":"2001","unstructured":"A.P. Zwart, Tail asymptotics for the busy period in the GI\/G\/1 queue, Math. Oper. Res. 26 (2001) 475\u2013483.","journal-title":"Math. Oper. Res."},{"key":"7585_CR59","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-7585-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-006-7585-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-006-7585-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T02:44:12Z","timestamp":1627353852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-006-7585-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":59,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["7585"],"URL":"https:\/\/doi.org\/10.1007\/s11134-006-7585-9","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}