{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:18:49Z","timestamp":1740133129649,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2016,3,1]]},"DOI":"10.1109\/tpds.2015.2417163","type":"journal-article","created":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T17:04:23Z","timestamp":1427475863000},"page":"627-639","source":"Crossref","is-referenced-by-count":0,"title":["Achieving Optimal Block Pipelining in Organized Network Coded Gossip"],"prefix":"10.1109","volume":"27","author":[{"given":"Majid","family":"Khabbazian","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Alberta"}]},{"given":"Di","family":"Niu","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Alberta"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.129"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498511"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375477"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1998476.1998484"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.112"},{"key":"ref14","first-page":"19","article-title":"Understanding\n the performance gap between pull-based mesh streaming protocols and fundamental limits","author":"feng","year":"0","journal-title":"Proc IEEE InfoCom"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68880-8_32"},{"key":"ref11","article-title":"Mutualcast: An efficient\n mechanism for content distribution in a peer-to-peer (P2P) network","author":"li","year":"0","journal-title":"Proc ACM SIGCOMM Asia Workshop"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2007.071205"},{"key":"ref10","first-page":"1","article-title":"Can network coding help in P2P networks?","author":"chiu","year":"0","journal-title":"Proc Int Workshop Netw Coding"},{"key":"ref21","article-title":"Practical\n network coding","author":"chou","year":"0","journal-title":"Proc 41st Annu Allerton Conf Commun Control Comput"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.247"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90001-9"},{"key":"ref17","first-page":"19","article-title":"Hedera: Dynamic flow scheduling for data center networks","author":"al-fares","year":"0","journal-title":"Proc 7th USENIX Conf Netw Syst Des Implementation"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-007-0017-9"},{"journal-title":"The Elements of Statistical Learning Data Mining Inference and Prediction","year":"2009","author":"hastie","key":"ref19"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.25"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"ref7","first-page":"10","article-title":"Spark: Cluster computing with working sets","author":"zaharia","year":"0","journal-title":"Proc 2nd USENIX Conf Hot Topics Cloud Comput"},{"key":"ref9","first-page":"98","article-title":"Managing data transfers in computer clusters with orchestra","author":"chowdhuryand","year":"0","journal-title":"Proc ACM Sigcomm"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993676"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874532"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref5","article-title":"Asymptotic optimality of randomized peer-to-peer broadcast with network coding","author":"niu","year":"0","journal-title":"Proc IEEE InfoCom"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/7403835\/07069277.pdf?arnumber=7069277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T22:57:46Z","timestamp":1682636266000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7069277\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,1]]},"references-count":24,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2015.2417163","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"type":"print","value":"1045-9219"},{"type":"electronic","value":"1558-2183"},{"type":"electronic","value":"2161-9883"}],"subject":[],"published":{"date-parts":[[2016,3,1]]}}}