{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:45:08Z","timestamp":1648831508080},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2001,12]]},"abstract":"\n We consider the following stochastic bin packing process: the items of different sizes arrive at times\n t<\/jats:italic>\n = 0, 1, 2, \u2026 and are packed into unit size bins using \"largest first\" rule. The unpacked items form queues. Coffman and Stolyar [3] introduced this system and posed the following question: under which conditions expected queue lengths are bounded (system is stable)? We provide exact computable conditions for stability of this system using Lyapunov function technique. The result holds for a very general class of distributions of the arrival processes.\n <\/jats:p>","DOI":"10.1145\/507553.507566","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"30-31","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic online binpacking problem"],"prefix":"10.1145","volume":"29","author":[{"given":"David","family":"Gamarnik","sequence":"first","affiliation":[{"name":"T.J. Watson Research Center, IBM Yorktown Heights, NY"}]}],"member":"320","reference":[{"key":"e_1_2_1_1_1","volume-title":"Proc. 9th ACM-SIAM Symposium on Discrete Algorithms","author":"Albers S.","year":"1998"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103446"},{"key":"e_1_2_1_3_1","unstructured":"E. G. Coffman Jr. and A. L. Stolyar. Bandwith packing. To appear in Algorithmica 1999. E. G. Coffman Jr. and A. L. Stolyar. Bandwith packing. To appear in Algorithmica 1999."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511984020"},{"key":"e_1_2_1_5_1","volume-title":"Proc. 11th ACM-SIAM Symposium on Discrete Algorithms. To appear in Mathematics of Operations Research","author":"Gamarnik D.","year":"2000"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0203025"},{"key":"e_1_2_1_7_1","volume-title":"Proc. 7th ACM-SIAM Symposium on Discrete Algorithms","author":"Kenyon C.","year":"1995"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02124678"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1550713"},{"key":"e_1_2_1_10_1","first-page":"4","article-title":"Computable bounds for geometric convergence rates of Markov chains","author":"Meyn S. P.","year":"1994","journal-title":"Ann. of Appl. Prob."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579171"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/507553.507566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T08:53:51Z","timestamp":1614848031000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/507553.507566"}},"subtitle":["exact conditions for bounded expected queue lengths under the best fit packing heuristic"],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["10.1145\/507553.507566"],"URL":"http:\/\/dx.doi.org\/10.1145\/507553.507566","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":["Computer Networks and Communications","Hardware and Architecture","Software"],"published":{"date-parts":[[2001,12]]}}}