{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T07:09:47Z","timestamp":1718953787686},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,4,9]],"date-time":"2009-04-09T00:00:00Z","timestamp":1239235200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s00186-009-0290-9","type":"journal-article","created":{"date-parts":[[2009,4,8]],"date-time":"2009-04-08T06:55:02Z","timestamp":1239173702000},"page":"201-244","source":"Crossref","is-referenced-by-count":4,"title":["Asymptotic expansions for the sojourn time distribution in the M\/G\/1-PS queue"],"prefix":"10.1007","volume":"71","author":[{"given":"Qiang","family":"Zhen","sequence":"first","affiliation":[]},{"given":"Charles","family":"Knessl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,4,9]]},"reference":[{"key":"290_CR1","volume-title":"Asymptotic expansions of integrals","author":"N Bleistein","year":"1986","unstructured":"Bleistein N, Handelsman RA (1986) Asymptotic expansions of integrals. Dover, New York"},{"key":"290_CR2","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/S0167-6377(03)00006-3","volume":"31","author":"SC Borst","year":"2003","unstructured":"Borst SC, Boxma OJ, Morrison JA, N\u00fa\u00f1ez Queija R (2003) The equivalence between processor sharing and service in random order. Oper Res Lett 31: 254\u2013262","journal-title":"Oper Res Lett"},{"key":"290_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s11134-006-7585-9","volume":"53","author":"S Borst","year":"2006","unstructured":"Borst S, N\u00fa\u00f1ez-Queija R, Zwart B (2006) Sojourn time asymptotics in processor-sharing queues. Queueing Syst 53: 31\u201351","journal-title":"Queueing Syst"},{"key":"290_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/321556.321568","volume":"17","author":"EG Coffman Jr","year":"1970","unstructured":"Coffman EG Jr, Muntz RR, Trotter H (1970) Waiting time distributions for processor-sharing systems. J ACM 17: 123\u2013130","journal-title":"J ACM"},{"key":"290_CR5","doi-asserted-by":"crossref","first-page":"937","DOI":"10.2307\/3213712","volume":"21","author":"JW Cohen","year":"1984","unstructured":"Cohen JW (1984) On processor sharing and random service (letter to the editor). J Appl Probab 21: 937","journal-title":"J Appl Probab"},{"key":"290_CR6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s11134-006-9007-4","volume":"55","author":"R Egorova","year":"2007","unstructured":"Egorova R, Zwart B (2007) Tail behavior of conditional sojourn times in processor-sharing queues. Queueing Syst 55: 107\u2013121","journal-title":"Queueing Syst"},{"key":"290_CR7","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1017\/S0269964806060268","volume":"20","author":"R Egorova","year":"2006","unstructured":"Egorova R, Zwart AP, Boxma OJ (2006) Sojourn time tails in the M\/D\/1 processor sharing queue. Probab Eng Inf Sci 20: 429\u2013446","journal-title":"Probab Eng Inf Sci"},{"key":"290_CR8","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1214\/aoap\/1034625337","volume":"7","author":"L Flatto","year":"1997","unstructured":"Flatto L (1997) The waiting time distribution for the random order service M\/M\/1 queue. Ann Appl Probab 7: 382\u2013409","journal-title":"Ann Appl Probab"},{"key":"290_CR9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1023\/A:1013913827667","volume":"39","author":"F Guillemin","year":"2001","unstructured":"Guillemin F, Boyer J (2001) Analysis of M\/M\/1 queue with processor sharing via spectral theory. Queueing Syst 39: 377\u2013397","journal-title":"Queueing Syst"},{"key":"290_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800110105","volume":"11","author":"L Kleinrock","year":"1964","unstructured":"Kleinrock L (1964) Analysis of a time-shared processor. Nav Res Logist Q 11: 59\u201373","journal-title":"Nav Res Logist Q"},{"key":"290_CR11","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/321386.321388","volume":"14","author":"L Kleinrock","year":"1967","unstructured":"Kleinrock L (1967) Time-shared systems: a theoretical treatment. J ACM 14: 242\u2013261","journal-title":"J ACM"},{"key":"290_CR12","first-page":"1","volume":"8","author":"C Knessl","year":"1992","unstructured":"Knessl C (1992) Asymptotic approximations for the GI\/M\/1 queue with processor-sharing service. Stoch Models 8: 1\u201334","journal-title":"Stoch Models"},{"key":"290_CR13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s11134-006-5567-6","volume":"52","author":"MRH Mandjes","year":"2006","unstructured":"Mandjes MRH, Zwart AP (2006) Large deviations of sojourn times in processor sharing queues. Queueing Syst 52: 237\u2013250","journal-title":"Queueing Syst"},{"key":"290_CR14","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1137\/0145007","volume":"45","author":"JA Morrison","year":"1985","unstructured":"Morrison JA (1985) Response-time distribution for a processor-sharing system. SIAM J Appl Math 45: 152\u2013167","journal-title":"SIAM J Appl Math"},{"key":"290_CR15","doi-asserted-by":"crossref","first-page":"360","DOI":"10.2307\/3213646","volume":"21","author":"TJ Ott","year":"1984","unstructured":"Ott TJ (1984) The sojourn time distribution in the M\/G\/1 queue with processor sharing. J Appl Probab 21: 360\u2013378","journal-title":"J Appl Probab"},{"key":"290_CR16","first-page":"353","volume":"222","author":"F Pollaczek","year":"1946","unstructured":"Pollaczek F (1946) La loi d\u2019attente des appels t\u00e9l\u00e9phoniques. C R Acad Sci Paris 222: 353\u2013355","journal-title":"C R Acad Sci Paris"},{"key":"290_CR17","doi-asserted-by":"crossref","first-page":"445","DOI":"10.2307\/3213654","volume":"21","author":"V Ramaswami","year":"1984","unstructured":"Ramaswami V (1984) The sojourn time in the GI\/M\/1 queue with processor sharing. J Appl Probab 21: 445\u2013450","journal-title":"J Appl Probab"},{"key":"290_CR18","volume-title":"Stochastic service systems","author":"J Riordan","year":"1962","unstructured":"Riordan J (1962) Stochastic service systems. Wiley, New York"},{"key":"290_CR19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/15326349208807213","volume":"8","author":"B Sengupta","year":"1992","unstructured":"Sengupta B (1992) An approximation for the sojourn-time distribution for the GI\/G\/1 processor-sharing queue. Stoch Models 8: 35\u201357","journal-title":"Stoch Models"},{"key":"290_CR20","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1002\/j.1538-7305.1985.tb00440.x","volume":"64","author":"B Sengupta","year":"1985","unstructured":"Sengupta B, Jagerman DL (1985) A conditional response time of the M\/M\/1 processor-sharing queue. AT&T Tech J 64: 409\u2013421","journal-title":"AT&T Tech J"},{"key":"290_CR21","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719260","volume-title":"Asymptotic approximation of integrals","author":"R Wong","year":"2001","unstructured":"Wong R (2001) Asymptotic approximation of integrals. SIAM, Philadelphia"},{"key":"290_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01182931","volume":"2","author":"SF Yashkov","year":"1987","unstructured":"Yashkov SF (1987) Processor-sharing queues: some progress in analysis. Queueing Syst 2: 1\u201317","journal-title":"Queueing Syst"},{"key":"290_CR23","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01097426","volume":"58","author":"SF Yashkov","year":"1992","unstructured":"Yashkov SF (1992) Mathematical problems in the theory of processor-sharing queueing systems. J Sov Math 58: 101\u2013147","journal-title":"J Sov Math"},{"key":"290_CR24","first-page":"256","volume":"6","author":"SF Yashkov","year":"2006","unstructured":"Yashkov SF (2006) On asymptotic property of the sojourn time in the M\/G\/1-EPS queue. Inf Process (Russian) 6: 256\u2013257","journal-title":"Inf Process (Russian)"},{"key":"290_CR25","unstructured":"Yashkov SF, Yashkova AS (1997) The M\/G\/1 processor-sharing system: the transient solutions. In: Proceedings of the 2nd international conference on distributed computer communication networks (DCCN\u201997), Tel-Aviv. Inst. Problem Peredachi Inf., Moscow, pp 261\u2013272"},{"key":"290_CR26","first-page":"175","volume":"4","author":"SF Yashkov","year":"2004","unstructured":"Yashkov SF, Yashkova AS (2004) The time-dependent solution of the M\/G\/1-FBPS queue. Inf Process 4: 175\u2013187","journal-title":"Inf Process"},{"key":"290_CR27","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1134\/S0005117907090202","volume":"68","author":"SF Yashkov","year":"2007","unstructured":"Yashkov SF, Yashkova AS (2007) Processor sharing: a survey of the mathematical theory. Autom Remote Control 68: 1662\u20131731","journal-title":"Autom Remote Control"},{"key":"290_CR28","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s11134-007-9054-5","volume":"57","author":"Q Zhen","year":"2007","unstructured":"Zhen Q, Knessl C (2007) Asymptotic expansions for the conditional sojourn time distribution in the M\/M\/1-PS queue. Queueing Syst 57: 157\u2013168","journal-title":"Queueing Syst"},{"key":"290_CR29","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1019142010994","volume":"35","author":"AP Zwart","year":"2000","unstructured":"Zwart AP, Boxma OJ (2000) Sojourn time asymptotics in the M\/G\/1 processor sharing queue. Queueing Syst 35: 141\u2013166","journal-title":"Queueing Syst"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-009-0290-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-009-0290-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-009-0290-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T10:33:28Z","timestamp":1558607608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-009-0290-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,9]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["290"],"URL":"https:\/\/doi.org\/10.1007\/s00186-009-0290-9","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,9]]}}}