{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:12:02Z","timestamp":1774926722681,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,8,15]],"date-time":"2011-08-15T00:00:00Z","timestamp":1313366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,8,15]]},"DOI":"10.1145\/2018436.2018443","type":"proceedings-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T11:22:45Z","timestamp":1314789765000},"page":"50-61","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":353,"title":["Better never than late"],"prefix":"10.1145","author":[{"given":"Christo","family":"Wilson","sequence":"first","affiliation":[{"name":"University of California at Santa Barbara, Santa Barbara, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hitesh","family":"Ballani","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Karagiannis","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ant","family":"Rowtron","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,8,15]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851191"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797706"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851192"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.259431"},{"key":"e_1_3_2_2_6_1","volume-title":"Proc. of OSDI","author":"Beaver D.","year":"2010","unstructured":"D. Beaver , S. Kumar , H. C. Li , J. Sobel , and P. Vajgel . Finding a Needle in Haystack: Facebook's Photo Storage . In Proc. of OSDI , 2010 . D. Beaver, S. Kumar, H. C. Li, J. Sobel, and P. Vajgel. Finding a Needle in Haystack: Facebook's Photo Storage. In Proc. of OSDI, 2010."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2007.102"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592681.1592693"},{"key":"e_1_3_2_2_9_1","volume-title":"USENIX OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified Data Processing on Large Clusters . In USENIX OSDI , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In USENIX OSDI, 2004."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294281"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7552(94)90101-5"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.125"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402968"},{"key":"e_1_3_2_2_16_1","unstructured":"T. Hoff. 10 eBay Secrets for Planet Wide Scaling Nov. 2009. http:\/\/highscalability.com\/blog\/2009\/11\/17\/10-ebay-secrets-for-planet-wide-scaling.html.  T. Hoff. 10 eBay Secrets for Planet Wide Scaling Nov. 2009. http:\/\/highscalability.com\/blog\/2009\/11\/17\/10-ebay-secrets-for-planet-wide-scaling.html."},{"key":"e_1_3_2_2_17_1","volume-title":"July","author":"Hoff T.","year":"2009","unstructured":"T. Hoff . Latency is Everywhere and it Costs You Sales - How to Crush it , July 2009 . http:\/\/highscalability.com\/blog\/2009\/7\/25\/latency-is-everywhere-and-it-costs-you-sales-how-to-crush-it.html. T. Hoff. Latency is Everywhere and it Costs You Sales - How to Crush it, July 2009. http:\/\/highscalability.com\/blog\/2009\/7\/25\/latency-is-everywhere-and-it-costs-you-sales-how-to-crush-it.html."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633035"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0114-1"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/321738.321743"},{"key":"e_1_3_2_2_22_1","volume-title":"Dec.","author":"Saab P.","year":"2008","unstructured":"P. Saab . Scaling memcached at Facebook , Dec. 2008 . http:\/\/www.facebook.com\/note.php?note_id=39391378919. P. Saab. Scaling memcached at Facebook, Dec. 2008. http:\/\/www.facebook.com\/note.php?note_id=39391378919."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592604"},{"key":"e_1_3_2_2_24_1","volume-title":"Apr.","author":"Vogels W.","year":"2009","unstructured":"W. Vogels . Performance and Scalability , Apr. 2009 . http:\/\/www.thingsdistributed.com\/2006\/04\/performance_and_scalability.html. W. Vogels. Performance and Scalability, Apr. 2009. http:\/\/www.thingsdistributed.com\/2006\/04\/performance_and_scalability.html."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502057"}],"event":{"name":"SIGCOMM '11: ACM SIGCOMM 2011 Conference","location":"Toronto Ontario Canada","acronym":"SIGCOMM '11","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2011 conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2018436.2018443","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2018436.2018443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:46Z","timestamp":1750225726000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2018436.2018443"}},"subtitle":["meeting deadlines in datacenter networks"],"short-title":[],"issued":{"date-parts":[[2011,8,15]]},"references-count":24,"alternative-id":["10.1145\/2018436.2018443","10.1145\/2018436"],"URL":"https:\/\/doi.org\/10.1145\/2018436.2018443","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2043164.2018443","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,8,15]]},"assertion":[{"value":"2011-08-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}