{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:48:15Z","timestamp":1649137695646},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008,1]]},"DOI":"10.1007\/s11134-007-9058-1","type":"journal-article","created":{"date-parts":[[2008,1,4]],"date-time":"2008-01-04T11:43:32Z","timestamp":1199447012000},"page":"57-64","source":"Crossref","is-referenced-by-count":3,"title":["Concavity of the conditional mean sojourn time in\u00a0the\u00a0M\/G\/1 processor-sharing queue with batch arrivals"],"prefix":"10.1007","volume":"58","author":[{"given":"Jeongsim","family":"Kim","sequence":"first","affiliation":[]},{"given":"Bara","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,1,5]]},"reference":[{"key":"9058_CR1","doi-asserted-by":"crossref","first-page":"910","DOI":"10.2307\/3213604","volume":"20","author":"B.K. Asare","year":"1983","unstructured":"Asare, B.K., Foster, F.G.: Conditional response time in the M\/G\/1 processor-sharing system. J. Appl. Probab. 20, 910\u2013915 (1983)","journal-title":"J. Appl. Probab."},{"key":"9058_CR2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s11134-005-1666-z","volume":"50","author":"K. Avrachenkov","year":"2005","unstructured":"Avrachenkov, K., Ayesta, U., Brown, P.: Batch arrival processor-sharing queue with application to multilevel processor-sharing scheduling. Queueing Syst. 50, 459\u2013480 (2005)","journal-title":"Queueing Syst."},{"key":"9058_CR3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/S0167-6377(03)00029-4","volume":"31","author":"N. Bansal","year":"2003","unstructured":"Bansal, N.: Analysis of the M\/G\/1 processor-sharing queue with bulk arrivals. Oper. Res. Lett. 31, 401\u2013405 (2003)","journal-title":"Oper. Res. Lett."},{"key":"9058_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/321556.321568","volume":"17","author":"E.G. Coffman Jr.","year":"1970","unstructured":"Coffman, E.G. Jr., Muntz, R.R., Trotter, H.: Waiting time distribution for processor-sharing systems. J. ACM. 17, 123\u2013130 (1970)","journal-title":"J. ACM."},{"key":"9058_CR5","unstructured":"Feng, H., Misra, V.: Asymptotic bounds for M X \/G\/1 processor sharing queues. Tech. Rep., CUCS-006-04, Columbia University (2003)"},{"key":"9058_CR6","doi-asserted-by":"crossref","first-page":"539","DOI":"10.2307\/1427450","volume":"26","author":"S. Grishechkin","year":"1994","unstructured":"Grishechkin, S.: GI\/G\/1 processor sharing queue in heavy traffic. Adv. Appl. Probab. 26, 539\u2013555 (1994)","journal-title":"Adv. Appl. Probab."},{"key":"9058_CR7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1080\/15326349108807197","volume":"7","author":"D.L. Jagerman","year":"1991","unstructured":"Jagerman, D.L., Sengupta, B.: The GI\/M\/1 processor-sharing queue and its heavy-traffic analysis. Stoch. Models 7, 379\u2013396 (1991)","journal-title":"Stoch. Models"},{"key":"9058_CR8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.peva.2006.05.006","volume":"64","author":"J. Kim","year":"2007","unstructured":"Kim, J., Kim, B.: The processor-sharing queue with bulk arrivals and phase-type services. Perform. Eval. 64, 277\u2013297 (2007)","journal-title":"Perform. Eval."},{"key":"9058_CR9","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/321386.321388","volume":"14","author":"L. Kleinrock","year":"1967","unstructured":"Kleinrock, L.: Time-shared systems: A theoretical treatment. J. ACM. 14, 242\u2013261 (1967)","journal-title":"J. ACM."},{"key":"9058_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230010103","volume":"1","author":"L. Kleinrock","year":"1971","unstructured":"Kleinrock, L., Muntz, R.R., Rodemich, E.: The processor-sharing queueing model for time-shared systems with bulk arrivals. Networks 1, 1\u201313 (1971)","journal-title":"Networks"},{"key":"9058_CR11","first-page":"1","volume":"8","author":"C. Knessl","year":"1992","unstructured":"Knessl, C.: Asymptotic approximation for the GI\/M\/1 queue with processor-sharing service. Stoch. Models 8, 1\u201334 (1992)","journal-title":"Stoch. Models"},{"key":"9058_CR12","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0167-6377(03)00028-2","volume":"31","author":"H. Masuyama","year":"2003","unstructured":"Masuyama, H., Takine, T.: Sojourn time distribution in MAP\/M\/1 processor-sharing queue. Oper. Res. Lett. 31, 406\u2013412 (2003)","journal-title":"Oper. Res. Lett."},{"key":"9058_CR13","doi-asserted-by":"crossref","first-page":"360","DOI":"10.2307\/3213646","volume":"21","author":"T.J. Ott","year":"1984","unstructured":"Ott, T.J.: The sojourn time distribution in the M\/G\/1 queue with processor sharing. J. Appl. Probab. 21, 360\u2013378 (1984)","journal-title":"J. Appl. Probab."},{"key":"9058_CR14","doi-asserted-by":"crossref","first-page":"445","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, 445\u2013450 (1984)","journal-title":"J. Appl. Probab."},{"key":"9058_CR15","first-page":"417","volume-title":"Modelling and Performance Evaluation of ATM Technology","author":"K.M. Rege","year":"1993","unstructured":"Rege, K.M., Sengupta, B.: The M\/G\/1 processor-sharing queue with bulk arrivals. In: Modelling and Performance Evaluation of ATM Technology, pp. 417\u2013432. Elsevier, Amsterdam (1993)"},{"key":"9058_CR16","doi-asserted-by":"crossref","first-page":"202","DOI":"10.2307\/1427231","volume":"16","author":"R. Schassberger","year":"1984","unstructured":"Schassberger, R.: A new approach to the M\/G\/1 processor-sharing queue. Adv. Appl. Probab. 16, 202\u2013213 (1984)","journal-title":"Adv. Appl. Probab."},{"key":"9058_CR17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/15326349208807213","volume":"8","author":"B. Sengupta","year":"1992","unstructured":"Sengupta, B.: An approximation for the sojourn-time distribution for the GI\/G\/1 processor-sharing queue. Stoch. Models 8, 35\u201357 (1992)","journal-title":"Stoch. Models"},{"key":"9058_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01182931","volume":"2","author":"S.F. Yashkov","year":"1987","unstructured":"Yashkov, S.F.: Processor-sharing queues: Some progress in analysis. Queueing Syst. 2, 1\u201317 (1987)","journal-title":"Queueing Syst."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-007-9058-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-007-9058-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-007-9058-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:44:38Z","timestamp":1559360678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-007-9058-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["9058"],"URL":"https:\/\/doi.org\/10.1007\/s11134-007-9058-1","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1]]}}}