{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T14:51:39Z","timestamp":1673707899089},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,1,30]],"date-time":"2010-01-30T00:00:00Z","timestamp":1264809600000},"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":[[2010,5]]},"DOI":"10.1007\/s11134-010-9164-3","type":"journal-article","created":{"date-parts":[[2010,1,29]],"date-time":"2010-01-29T17:53:14Z","timestamp":1264787594000},"page":"1-18","source":"Crossref","is-referenced-by-count":4,"title":["Storage allocation under processor sharing\u00a0I: exact solutions and asymptotics"],"prefix":"10.1007","volume":"65","author":[{"given":"Eunju","family":"Sohn","sequence":"first","affiliation":[]},{"given":"Charles","family":"Knessl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,30]]},"reference":[{"key":"9164_CR1","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-4149(86)90007-4","volume":"22","author":"D. Aldous","year":"1986","unstructured":"Aldous, D.: Some interesting processes arising as heavy traffic limits in an M\/M\/\u221e storage process. Stoch. Process. Their Appl. 22, 291\u2013313 (1986)","journal-title":"Stoch. Process. Their Appl."},{"key":"9164_CR2","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1080\/15326349508807357","volume":"11","author":"L. Bright","year":"1995","unstructured":"Bright, L., Taylor, P.G.: Calculating the equilibrium distribution in level-dependent quasi-birth-and-death processes. Commun. Stat. Stoch. Models 11, 497\u2013525 (1995)","journal-title":"Commun. Stat. Stoch. Models"},{"key":"9164_CR3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(89)90031-7","volume":"8","author":"E.G. Coffman Jr.","year":"1989","unstructured":"Coffman, E.G. Jr., Leighton, F.T.: A provably efficient algorithm for dynamic storage allocation. J.\u00a0Comput. Syst. Sci. 8, 2\u201335 (1989)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9164_CR4","series-title":"CWI Monogr.","first-page":"193","volume-title":"Queueing Theory and Its Applications, Liber Amicorum for J.W. Cohen","author":"E.G. Coffman Jr.","year":"1988","unstructured":"Coffman, E.G. Jr., Mitrani, I.: Storage of the single-server queue. In: Boxma, O.J., Syski, R. (eds.) Queueing Theory and Its Applications, Liber Amicorum for J.W. Cohen. CWI Monogr., vol.\u00a07, pp.\u00a0193\u2013205. Amsterdam, North-Holland (1988)"},{"key":"9164_CR5","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0214032","volume":"14","author":"E.G. Coffman Jr.","year":"1985","unstructured":"Coffman, E.G. Jr. , Kadota, T.T., Shepp, L.A.: A stochastic model of fragmentation in dynamic storage allocation. SIAM J. Comput. 14, 416\u2013425 (1985)","journal-title":"SIAM J. Comput."},{"key":"9164_CR6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-4149(90)90098-D","volume":"36","author":"E.G. Coffman Jr.","year":"1990","unstructured":"Coffman, E.G. Jr. , Flatto, L., Leighton, F.T.: First fit allocation of queues: tight probabilistic bounds on wasted space. Stoch. Process. Their Appl. 36, 311\u2013330 (1990)","journal-title":"Stoch. Process. Their Appl."},{"key":"9164_CR7","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1214\/aoap\/1019487357","volume":"10","author":"C. Knessl","year":"2000","unstructured":"Knessl, C.: Asymptotic expansions for a stochastic model of queue storage. Ann. Appl. Probab. 10, 592\u2013615 (2000)","journal-title":"Ann. Appl. Probab."},{"key":"9164_CR8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1111\/1467-9590.t01-1-00232","volume":"111","author":"C. Knessl","year":"2003","unstructured":"Knessl, C.: Geometrical optics and models of computer memory fragmentation. Stud. Appl. Math. 111, 185\u2013238 (2003)","journal-title":"Stud. Appl. Math."},{"key":"9164_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/B:QUES.0000035314.35882.5b","volume":"47","author":"C. Knessl","year":"2004","unstructured":"Knessl, C.: Some asymptotic results for the M\/M\/\u221e queue with ranked servers. Queueing Syst. 47, 201\u2013250 (2004)","journal-title":"Queueing Syst."},{"key":"9164_CR10","first-page":"5","volume":"14","author":"L. Kosten","year":"1937","unstructured":"Kosten, L.: Uber Sperrungswahrscheinlichkeiten bei Staffelschaltungen. Elektr. Nachr. Techn. 14, 5\u201312 (1937)","journal-title":"Elektr. Nachr. Techn."},{"key":"9164_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-45576-6","volume-title":"The M\/M\/\u221e Service System with Ranked Servers in Heavy Traffic","author":"G.F. Newell","year":"1984","unstructured":"Newell, G.F.: The M\/M\/\u221e Service System with Ranked Servers in Heavy Traffic. Springer, New York (1984)"},{"key":"9164_CR12","doi-asserted-by":"crossref","first-page":"508","DOI":"10.2307\/3215389","volume":"34","author":"J. Preater","year":"1997","unstructured":"Preater, J.: A perpetuity and the M\/M\/\u221e ranked server system. J. Appl. Probab. 34, 508\u2013513 (1997)","journal-title":"J. Appl. Probab."},{"key":"9164_CR13","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.aml.2007.03.006","volume":"21","author":"E. Sohn","year":"2008","unstructured":"Sohn, E., Knessl, C.: A simple direct solution to a storage allocation model. Appl. Math. Lett. 21, 172\u2013175 (2008)","journal-title":"Appl. Math. Lett."},{"key":"9164_CR14","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1239\/aap\/1222868188","volume":"40","author":"E. Sohn","year":"2008","unstructured":"Sohn, E., Knessl, C.: The distribution of wasted spaces in the M\/M\/\u221e queue with ranked servers. Adv. Appl. Probab. 40, 835\u2013855 (2008)","journal-title":"Adv. Appl. Probab."},{"key":"9164_CR15","unstructured":"Sohn, E., Knessl, C.: Storage allocation under processor sharing II: Further asymptotic results (submitted). Available at http:\/\/arxiv.org\/abs\/0907.3683"},{"key":"9164_CR16","volume-title":"Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach","author":"M.F. Neuts","year":"1994","unstructured":"Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Dover, New York (1994)"},{"key":"9164_CR17","series-title":"Probab. Stochastics Ser.","first-page":"337","volume-title":"Advances in Queueing","author":"I. Mitrani","year":"1995","unstructured":"Mitrani, I.: The spectral expansion solution method for Markov processes on lattice strips. In: Advances in Queueing. Probab. Stochastics Ser., pp. 337\u2013352. CRC Press, Boca Raton (1995)"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-010-9164-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-010-9164-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-010-9164-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T07:44:40Z","timestamp":1559375080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-010-9164-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,30]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["9164"],"URL":"https:\/\/doi.org\/10.1007\/s11134-010-9164-3","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,30]]}}}