{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:56Z","timestamp":1750307156551,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,8,23]],"date-time":"2011-08-23T00:00:00Z","timestamp":1314057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSA","award":["H 98230-08-1-0102H 98230-11-1-0184"],"award-info":[{"award-number":["H 98230-08-1-0102H 98230-11-1-0184"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,8,23]]},"DOI":"10.1145\/2021216.2021240","type":"proceedings-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T15:22:45Z","timestamp":1314804165000},"page":"161-168","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On some simple single server models of dynamic storage"],"prefix":"10.1145","author":[{"given":"Eunju","family":"Sohn","sequence":"first","affiliation":[{"name":"University of Georgia, Athens, GA"}]},{"given":"Charles","family":"Knessl","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago, IL"}]}],"member":"320","published-online":{"date-parts":[[2011,8,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Some interesting processes arising as heavy traffic limits in an M\/M\/\u221e storage process, Stochastic Processes and their Applications 22","author":"Aldous D.","year":"1986","unstructured":"Aldous , D. , Some interesting processes arising as heavy traffic limits in an M\/M\/\u221e storage process, Stochastic Processes and their Applications 22 ( 1986 ), 291--313. Aldous, D., Some interesting processes arising as heavy traffic limits in an M\/M\/\u221e storage process, Stochastic Processes and their Applications 22 (1986), 291--313."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1025074"},{"key":"e_1_3_2_1_3_1","volume-title":"First fit allocation of queues: tight probabilistic bounds on wasted space, Stochastic Processes and their Applications 36","author":"Coffman E. G., Jr.","year":"1990","unstructured":"Coffman , E. G., Jr. , Flatto , L. and Leighton , F. T. , First fit allocation of queues: tight probabilistic bounds on wasted space, Stochastic Processes and their Applications 36 ( 1990 ), 311--330. Coffman, E. G., Jr., Flatto, L. and Leighton, F. T., First fit allocation of queues: tight probabilistic bounds on wasted space, Stochastic Processes and their Applications 36 (1990), 311--330."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the first annual ACM -- SIAM symposium on discrete algorithms, Society for Industrial and Applied Mathematics","author":"Coffman E. G., Jr.","year":"1990","unstructured":"Coffman , E. G., Jr. , Flatto , L. and Leighton , F. T ., First-fit storage of linear lists: tight probabilistic bounds on wasted space , Proceedings of the first annual ACM -- SIAM symposium on discrete algorithms, Society for Industrial and Applied Mathematics , Philadelphia, PA ( 1990 ), 272--279. Coffman, E. G., Jr., Flatto, L. and Leighton, F. T., First-fit storage of linear lists: tight probabilistic bounds on wasted space, Proceedings of the first annual ACM -- SIAM symposium on discrete algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA (1990), 272--279."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964800000644"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214032"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1985.232200"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90031-7"},{"key":"e_1_3_2_1_9_1","volume-title":"Queueing Theory and its Applications, Liber Amicorum for J. W. Cohen","author":"Coffman E. G., Jr.","year":"1988","unstructured":"Coffman , E. G., Jr. and Mitrani , I. , Storage of the single-server queue , in Queueing Theory and its Applications, Liber Amicorum for J. W. Cohen , edited by O. J. Boxma and R. Syski, CWI Monogr., 7, North-Holland , Amsterdam ( 1988 ), 193--205. Coffman, E. G., Jr. and Mitrani, I., Storage of the single-server queue, in Queueing Theory and its Applications, Liber Amicorum for J. W. Cohen, edited by O. J. Boxma and R. Syski, CWI Monogr., 7, North-Holland, Amsterdam (1988), 193--205."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1019487357"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9590.t01-1-00232"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:QUES.0000035314.35882.5b"},{"key":"e_1_3_2_1_13_1","volume-title":"Electra Nachrichten - Technik 14","author":"Kosten L.","year":"1937","unstructured":"Kosten , L. , Uber Sperrungswahrscheinlichkeiten bei Staffelschaltungen , Electra Nachrichten - Technik 14 ( 1937 ), 5--12. Kosten, L., Uber Sperrungswahrscheinlichkeiten bei Staffelschaltungen, Electra Nachrichten - Technik 14 (1937), 5--12."},{"key":"e_1_3_2_1_14_1","volume-title":"Fundamental Algorithms","author":"Knuth D. E.","year":"1997","unstructured":"Knuth , D. E. , Fundamental Algorithms , Vol. 1 , 3 rd ed. Addison-Wesley , Reading, MA ( 1997 ). Knuth, D. E., Fundamental Algorithms, Vol. 1, 3rd ed. Addison-Wesley, Reading, MA (1997).","edition":"3"},{"key":"e_1_3_2_1_15_1","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":"Newell G. F.","year":"1984","unstructured":"Newell , G. F. , The M\/M\/\u221e Service System with Ranked Servers in Heavy Traffic , Springer , New York ( 1984 ). Newell, G. F., The M\/M\/\u221e Service System with Ranked Servers in Heavy Traffic, Springer, New York (1984)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.2307\/3215389"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2007.03.006"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1222868188"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-010-9164-3"},{"key":"e_1_3_2_1_20_1","volume-title":"Storage allocation under processor sharing II: Further asymptotic results European Journal of Applied Math, 22","author":"Sohn E.","year":"2010","unstructured":"Sohn , E. and Knessl , C. , Storage allocation under processor sharing II: Further asymptotic results European Journal of Applied Math, 22 ( 2010 ), 45--82 http:\/\/arxiv.org\/PS_cache\/arxiv\/pdf\/0907\/0907.3683v1.pdf. Sohn, E. and Knessl, C., Storage allocation under processor sharing II: Further asymptotic results European Journal of Applied Math, 22 (2010), 45--82 http:\/\/arxiv.org\/PS_cache\/arxiv\/pdf\/0907\/0907.3683v1.pdf."},{"key":"e_1_3_2_1_21_1","unstructured":"Sohn E. and Knessl C. Some exact and asymptotic solutions to single server models of dynamic storage submitted to Stochastic Models.  Sohn E. and Knessl C. Some exact and asymptotic solutions to single server models of dynamic storage submitted to Stochastic Models ."},{"key":"e_1_3_2_1_22_1","volume-title":"Reading, MA","author":"Standish T. A.","year":"1980","unstructured":"Standish , T. A. , Data Structure Techniques Addison-Wesley , Reading, MA ( 1980 ). Standish, T. A., Data Structure Techniques Addison-Wesley, Reading, MA (1980)."}],"event":{"name":"QTNA '11: 6th International Conference on Queueing Theory and Network Applications","sponsor":["Korea University","SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"],"location":"Seoul Korea","acronym":"QTNA '11"},"container-title":["Proceedings of the 6th International Conference on Queueing Theory and Network Applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2021216.2021240","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2021216.2021240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:23Z","timestamp":1750240463000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2021216.2021240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,23]]},"references-count":22,"alternative-id":["10.1145\/2021216.2021240","10.1145\/2021216"],"URL":"https:\/\/doi.org\/10.1145\/2021216.2021240","relation":{},"subject":[],"published":{"date-parts":[[2011,8,23]]},"assertion":[{"value":"2011-08-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}