{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:17Z","timestamp":1750306877291,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,12,10]],"date-time":"2012-12-10T00:00:00Z","timestamp":1355097600000},"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,12,10]]},"DOI":"10.1145\/2413176.2413182","type":"proceedings-article","created":{"date-parts":[[2012,12,17]],"date-time":"2012-12-17T15:12:21Z","timestamp":1355757141000},"page":"37-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Datacast"],"prefix":"10.1145","author":[{"given":"Jiaxin","family":"Cao","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"given":"Chuanxiong","family":"Guo","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Guohan","family":"Lu","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Yongqiang","family":"Xiong","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Yixin","family":"Zheng","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Yongguang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Yibo","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA, USA"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,12,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402984"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945474"},{"key":"e_1_3_2_1_4_1","volume-title":"Cohen. Incentives Build Robustness in BitTorrent. In Workshop on Economics of Peer-to-Peer Systems","author":"Bram","year":"2003","unstructured":"Bram Cohen. Incentives Build Robustness in BitTorrent. In Workshop on Economics of Peer-to-Peer Systems , 2003 . Bram Cohen. Incentives Build Robustness in BitTorrent. In Workshop on Economics of Peer-to-Peer Systems, 2003."},{"key":"e_1_3_2_1_5_1","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified Data Processing on Large Clusters . In OSDI , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI, 2004."},{"key":"e_1_3_2_1_6_1","first-page":"91","volume-title":"Combinatorial Algorithms","author":"Edmonds J.","year":"1972","unstructured":"J. Edmonds . Edge-disjoint branchings . In R. Rustin, editor, Combinatorial Algorithms , pages 91 -- 96 . Algorithmics Press , New York , 1972 . J. Edmonds. Edge-disjoint branchings. In R. Rustin, editor, Combinatorial Algorithms, pages 91--96. Algorithmics Press, New York, 1972."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592577"},{"key":"e_1_3_2_1_8_1","volume-title":"ServerSwitch: A Programmable and High Performance Platform for Data Center Networks. In NSDI","author":"Guohan","year":"2011","unstructured":"Guohan Lu et al . ServerSwitch: A Programmable and High Performance Platform for Data Center Networks. In NSDI , 2011 . Guohan Lu et al. ServerSwitch: A Programmable and High Performance Platform for Data Center Networks. In NSDI, 2011."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851191"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018448"},{"key":"e_1_3_2_1_12_1","volume-title":"Aug","author":"M. Handley","year":"2000","unstructured":"M. Handley et al. The Reliable Multicast Design Space for Bulk Data Transfer , Aug 2000 . RFC 2887. M. Handley et al. The Reliable Multicast Design Space for Bulk Data Transfer, Aug 2000. RFC2887."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.650139"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658941"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(82)90125-0"},{"key":"e_1_3_2_1_17_1","volume-title":"Special reports 10 emerging technologies","author":"Greene K.","year":"2009","unstructured":"K. Greene . Special reports 10 emerging technologies 2009 . MIT Technology Review , 2009. http:\/\/www.technologyreview.com\/biotech\/22120\/. K. Greene. Special reports 10 emerging technologies 2009. MIT Technology Review, 2009. http:\/\/www.technologyreview.com\/biotech\/22120\/."},{"key":"e_1_3_2_1_18_1","volume-title":"IEEE JSAC","author":"Chu Yang","year":"2002","unstructured":"Yang hua Chu , Sanjay G. Rao , Srinivasan Seshan , and Hui Zhang . A Case for End System Multicast . IEEE JSAC , Oct 2002 . Yang hua Chu, Sanjay G. Rao, Srinivasan Seshan, and Hui Zhang. A Case for End System Multicast. IEEE JSAC, Oct 2002."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272998.1273005"},{"key":"e_1_3_2_1_20_1","unstructured":"Force10 networks. Force10 s7000. www.force10networks.com.  Force10 networks. Force10 s7000. www.force10networks.com."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/347057.347390"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.98"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/231699.231701"},{"key":"e_1_3_2_1_24_1","author":"Tong Po","year":"1983","unstructured":"Po Tong and E. L. Lawler . A Fast Algorithm for Finding Edge-disjoint Branchings. Information Processing Letters , Aug 1983 . Po Tong and E. L. Lawler. A Fast Algorithm for Finding Edge-disjoint Branchings. Information Processing Letters, Aug 1983.","journal-title":"A Fast Algorithm for Finding Edge-disjoint Branchings. Information Processing Letters"},{"key":"e_1_3_2_1_25_1","volume-title":"Active Reliable Multicast. In INFOCOM","author":"Lehman Li","year":"1998","unstructured":"Li wei H. Lehman , Stephen J. Garland , and David L . Tennenhouse . Active Reliable Multicast. In INFOCOM , 1998 . Li wei H. Lehman, Stephen J. Garland, and David L. Tennenhouse. Active Reliable Multicast. In INFOCOM, 1998."},{"key":"e_1_3_2_1_26_1","first-page":"4654","author":"Widmer J.","year":"2006","unstructured":"J. Widmer and M. Handley . TCP-Friendly Multicast Congestion Control (TFMCC): Protocol Specification, Auguest 2006 . RFC 4654 . J. Widmer and M. Handley. TCP-Friendly Multicast Congestion Control (TFMCC): Protocol Specification, Auguest 2006. RFC 4654.","journal-title":"TCP-Friendly Multicast Congestion Control (TFMCC): Protocol Specification, Auguest"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2006.12.001"}],"event":{"name":"CoNEXT '12: Conference on emerging Networking Experiments and Technologies","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Nice France","acronym":"CoNEXT '12"},"container-title":["Proceedings of the 8th international conference on Emerging networking experiments and technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2413176.2413182","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2413176.2413182","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:27Z","timestamp":1750234707000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2413176.2413182"}},"subtitle":["a scalable and efficient reliable group data delivery service for data centers"],"short-title":[],"issued":{"date-parts":[[2012,12,10]]},"references-count":26,"alternative-id":["10.1145\/2413176.2413182","10.1145\/2413176"],"URL":"https:\/\/doi.org\/10.1145\/2413176.2413182","relation":{},"subject":[],"published":{"date-parts":[[2012,12,10]]},"assertion":[{"value":"2012-12-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}