{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T04:11:08Z","timestamp":1777349468513,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T00:00:00Z","timestamp":1344816000000},"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":[[2012,8,13]]},"DOI":"10.1145\/2342356.2342432","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"371-382","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":73,"title":["Optimizing cost and performance for content multihoming"],"prefix":"10.1145","author":[{"given":"Hongqiang Harry","family":"Liu","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]},{"given":"Ye","family":"Wang","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]},{"given":"Yang Richard","family":"Yang","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]},{"given":"Hao","family":"Wang","sequence":"additional","affiliation":[{"name":"Google, San Francisco , CA, USA"}]},{"given":"Chen","family":"Tian","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,8,13]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"01box. http:\/\/cdn.01box.net.  01box. http:\/\/cdn.01box.net."},{"key":"e_1_3_2_2_2_1","volume-title":"IEEE INFOCOM'12","author":"Adhikari V. K.","unstructured":"V. K. Adhikari , Y. Guo , F. Hao , M. Varvello , V. Hilt , M. Steiner , and Z.-L. Zhang . Unreeling netflix : Understanding and improving multi-CDN movie delivery . In IEEE INFOCOM'12 . V. K. Adhikari, Y. Guo, F. Hao, M. Varvello, V. Hilt, M. Steiner, and Z.-L. Zhang. Unreeling netflix: Understanding and improving multi-CDN movie delivery. In IEEE INFOCOM'12."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2019643.2019644"},{"key":"e_1_3_2_2_4_1","volume-title":"USENIX OSDI'10","author":"Beaver D.","unstructured":"D. Beaver , S. Kumar , H. C. Li , J. Sobel , and P. Vajgel . Finding a needle in haystack: Facebook's photo storage . In USENIX OSDI'10 . D. Beaver, S. Kumar, H. C. Li, J. Sobel, and P. Vajgel. Finding a needle in haystack: Facebook's photo storage. In USENIX OSDI'10."},{"key":"e_1_3_2_2_5_1","volume-title":"IETF Draft","author":"Bertrand G.","year":"2012","unstructured":"G. Bertrand , E. Stephan , G. Watson , T. Burbridge , P. Eardley , and K. Ma . Use cases for CDNi . IETF Draft , Jan. 2012 . G. Bertrand, E. Stephan, G. Watson, T. Burbridge, P. Eardley, and K. Ma. Use cases for CDNi. IETF Draft, Jan. 2012."},{"key":"e_1_3_2_2_6_1","volume-title":"Convex Analysis and Optimization","author":"Bertsekas D.","year":"2003","unstructured":"D. Bertsekas . Convex Analysis and Optimization . 2003 . D. Bertsekas. Convex Analysis and Optimization. 2003."},{"key":"e_1_3_2_2_7_1","unstructured":"CDN expert. http:\/\/cdnexpertonline.com\/node\/45.  CDN expert. http:\/\/cdnexpertonline.com\/node\/45."},{"key":"e_1_3_2_2_8_1","volume-title":"Cisco Visual Networking Index: Forecast and Methodology","author":"Systems Cisco","year":"2011","unstructured":"Cisco Systems . Cisco Visual Networking Index: Forecast and Methodology , 2011 --2016. Cisco Systems. Cisco Visual Networking Index: Forecast and Methodology, 2011--2016."},{"key":"e_1_3_2_2_9_1","unstructured":"Conviva. http:\/\/www.conviva.com.  Conviva. http:\/\/www.conviva.com."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018478"},{"key":"e_1_3_2_2_11_1","unstructured":"Dyn CDN manager. http:\/\/dyn.com\/.  Dyn CDN manager. http:\/\/dyn.com\/."},{"key":"e_1_3_2_2_12_1","unstructured":"Geo best-of YouTube. http:\/\/geobestofyoutube.gmapify.fr\/.  Geo best-of YouTube. http:\/\/geobestofyoutube.gmapify.fr\/."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015478"},{"key":"e_1_3_2_2_14_1","volume-title":"Theory of Extremal Problems","author":"Ioffe A.","year":"1979","unstructured":"A. Ioffe and V. Tihomirov . Theory of Extremal Problems . Elsevier Science Ltd , 1979 . A. Ioffe and V. Tihomirov. Theory of Extremal Problems. Elsevier Science Ltd, 1979."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644917"},{"key":"e_1_3_2_2_16_1","unstructured":"Level 3 Intelligent Traffic Management. http:\/\/www.level3.com\/ \/media\/Assets\/brochures\/brochure_intelligent_traffic_management.pdf.  Level 3 Intelligent Traffic Management. http:\/\/www.level3.com\/ \/media\/Assets\/brochures\/brochure_intelligent_traffic_management.pdf."},{"key":"e_1_3_2_2_17_1","unstructured":"Limelight Traffic Load Balancer. http:\/\/www.limelight.com\/traffic-load-balancer\/.  Limelight Traffic Load Balancer. http:\/\/www.limelight.com\/traffic-load-balancer\/."},{"key":"e_1_3_2_2_19_1","unstructured":"MetaCDN. http:\/\/www.metacdn.com\/.  MetaCDN. http:\/\/www.metacdn.com\/."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.17487\/rfc6707"},{"key":"e_1_3_2_2_21_1","unstructured":"OnePica. http:\/\/www.magentocommerce.com.  OnePica. http:\/\/www.magentocommerce.com."},{"key":"e_1_3_2_2_22_1","volume-title":"NSDI'09","author":"Peterson R. S.","unstructured":"R. S. Peterson and E. G. Sirer . Antfarm: efficient content distribution with managed swarms . In NSDI'09 . R. S. Peterson and E. G. Sirer. Antfarm: efficient content distribution with managed swarms. In NSDI'09."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018474"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879145"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653687"},{"key":"e_1_3_2_2_26_1","first-page":"137","article-title":"Output-sensitive cell enumeration in hyperplane arrangements","volume":"6","author":"Sleumer N. H.","year":"1999","unstructured":"N. H. Sleumer . Output-sensitive cell enumeration in hyperplane arrangements . Nordic J. of Computing , 6 : 137 -- 147 , June 1999 . N. H. Sleumer. Output-sensitive cell enumeration in hyperplane arrangements. Nordic J. of Computing, 6:137--147, June 1999.","journal-title":"Nordic J. of Computing"},{"key":"e_1_3_2_2_27_1","unstructured":"XDN. http:\/\/www.xdn.com.  XDN. http:\/\/www.xdn.com."}],"event":{"name":"SIGCOMM '12: ACM SIGCOMM 2012 Conference","location":"Helsinki Finland","acronym":"SIGCOMM '12","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2342356.2342432","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2342356.2342432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:23Z","timestamp":1750238483000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2342356.2342432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,13]]},"references-count":26,"alternative-id":["10.1145\/2342356.2342432","10.1145\/2342356"],"URL":"https:\/\/doi.org\/10.1145\/2342356.2342432","relation":{},"subject":[],"published":{"date-parts":[[2012,8,13]]},"assertion":[{"value":"2012-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}