{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T04:13:08Z","timestamp":1743307988285,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642292095"},{"type":"electronic","value":"9783642292101"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29210-1_82","type":"book-chapter","created":{"date-parts":[[2012,6,6]],"date-time":"2012-06-06T14:47:55Z","timestamp":1338994075000},"page":"515-520","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Cost-Equation Analysis of General-Input General-Service Processor Sharing System"],"prefix":"10.1007","author":[{"given":"Kentaro","family":"Hoshi","sequence":"first","affiliation":[]},{"given":"Naohisa","family":"Komatsu","sequence":"additional","affiliation":[]},{"given":"Yoshitaka","family":"Takahashi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,14]]},"reference":[{"key":"82_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/1243401.1243409","volume":"34","author":"S Aalto","year":"2007","unstructured":"Aalto, S., Ayesta, U., Borst, S.,Misra, V., Nunez-Queija, R.: Beyond processor sharing. ACM SIGMETRICS Performance Evaluation Review, vol.34, pp.36\u201343 (2007)","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"82_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF01159223","volume":"9","author":"JL Berg","year":"1991","unstructured":"Berg, J.L., Boxma, O.J.: The M\/G\/1 queue with processor sharing and its relation to a feedback queue. Queueing Systems, vol.9, pp.365\u2013402 (1991)","journal-title":"Queueing Systems"},{"key":"82_CR3","doi-asserted-by":"crossref","unstructured":"Brandt, A., Franken, P., Lisek, B.: Stationary Stochastic Models. Wiley, Chichester (1990) 4. Baccelli, F., Bremaud, P.: Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurrences, Springer, New York (1994)","DOI":"10.1515\/9783112727515"},{"key":"82_CR4","doi-asserted-by":"publisher","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. Queuing Systems, vol.52, pp.281\u2013286 (2006)","journal-title":"Queuing Systems"},{"key":"82_CR5","doi-asserted-by":"publisher","first-page":"508","DOI":"10.2307\/3212174","volume":"8","author":"SL Brumelle","year":"1971","unstructured":"Brumelle, S.L.: On the relation between customer and time averages in queues. J. Applied Probability, vol.8, pp.508\u2013520 (1971)","journal-title":"J. Applied Probability"},{"key":"82_CR6","volume-title":"Queues and Point Process","author":"P Franken","year":"1982","unstructured":"Franken, P., Koenig, D., Arndt, U., Schmidt, V.: Queues and Point Process. Akademie-Verlag, Berlin (1982)"},{"key":"82_CR7","unstructured":"Hoshi, K., Shikata, Y., Takahashi, Y., Komatsu, N.: Mean approximate formulas for GI\/G\/1 processor-sharing system. Proc. International Conference on Operations Research (OR 2010 Munich), I.6, WE-15-1 (2010)"},{"key":"82_CR8","doi-asserted-by":"publisher","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. of the ACM, vol.14, pp.242\u2013261 (1967)","journal-title":"J. of the ACM"},{"key":"82_CR9","unstructured":"Kleinrock, L.: Queueing Systems : Computer Applications. vol.II, Wiley, New York (1976)"},{"key":"82_CR10","doi-asserted-by":"publisher","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. Applied Probability, vol.21, pp.437\u2013442 (1984)","journal-title":"J. Applied Probability"},{"key":"82_CR11","volume-title":"Introduction to Probability Models","author":"S Ross","year":"1993","unstructured":"Ross, S.: Introduction to Probability Models, Academic Press, San Diego (1993)"},{"issue":"2","key":"82_CR12","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1287\/opre.19.2.371","volume":"19","author":"M Sakata","year":"1971","unstructured":"Sakata, M., Noguchi, S., Oizumi, J.: An analysis of the M\/G\/1 queue under round-robin scheduling. Operations Research, vol.19, no.2, pp.371\u2013385 (1971)","journal-title":"Operations Research"},{"key":"82_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/opre.18.1.185","volume":"18","author":"L Schrage","year":"1970","unstructured":"Schrage, L.: An alternative proof of a conservation law for the queue G\/G\/1. Operations Research, vol.18, pp.185\u2013187 (1970)","journal-title":"Operations Research"},{"issue":"1","key":"82_CR14","first-page":"3","volume":"8","author":"B Sengupta","year":"1992","unstructured":"Sengupta, B.: An approximation for the sojourn-time distribution for the GI\/G\/1 processorsharing queue. Stochastic Models, vol.8(1), pp.3\u201357 (1992)","journal-title":"Stochastic Models"},{"issue":"2","key":"82_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1080\/15326349508807344","volume":"11","author":"Y Takahashi","year":"1995","unstructured":"Takahashi, Y., Miyazawa, M.: Relationship between queue length and waiting time in a stationary discrete-time queue. Stochastic Models, 11(2), pp.249\u2013271, (1995)","journal-title":"Stochastic Models"},{"key":"82_CR16","doi-asserted-by":"crossref","unstructured":"Takahashi, Y.: Shikata, Y., Frey, A.: A single-server queueing system with modified service mechanism. Proceedings of IEEE International Conference on Ultra Modern Telecommunications (ICUMT 2009), IEEE, pp.1\u20136 (2009)","DOI":"10.1109\/ICUMT.2009.5345501"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2011"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29210-1_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T16:07:55Z","timestamp":1743264475000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29210-1_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642292095","9783642292101"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29210-1_82","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2012]]},"assertion":[{"value":"14 April 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}