{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:47:04Z","timestamp":1750308424734,"version":"3.41.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T00:00:00Z","timestamp":1566259200000},"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":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2019,9,30]]},"abstract":"<jats:p>\n            We study the broadcast transmission of a single file to an arbitrary number of receivers using Random Linear Network Coding (RLNC) in a network with unreliable channels. Due to the increased computational complexity of the decoding process (especially for large files), we apply\n            <jats:italic>chunked<\/jats:italic>\n            RLNC (i.e., RLNC is applied within non-overlapping subsets of the file).\n          <\/jats:p>\n          <jats:p>\n            In our work, we show the\n            <jats:italic>optimality<\/jats:italic>\n            of the\n            <jats:italic>Least Received (LR)<\/jats:italic>\n            batch scheduling policy with regards to the expected file transfer completion time. The\n            <jats:italic>LR<\/jats:italic>\n            policy strives to keep the receiver queues\n            <jats:italic>balanced<\/jats:italic>\n            . This is done by transmitting packets (corresponding to\n            <jats:italic>encoded<\/jats:italic>\n            batches) that are needed by the receivers with the shortest queues of successfully received packets. Furthermore, we provide formulas for the expected time for the file transmission to all receivers using the LR batch scheduling policy and the minimum achievable coding window size in the case of a pre-defined delay constraint. Moreover, we evaluate through simulations a modification of the LR policy in a more realistic system setting with reduced feedback from the receivers. Finally, we provide an initial analysis and further modifications to the\n            <jats:italic>LR<\/jats:italic>\n            policy for time-correlated channels and asymmetric channels.\n          <\/jats:p>","DOI":"10.1145\/3340242","type":"journal-article","created":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T19:51:56Z","timestamp":1566330716000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling for Optimal File-Transfer Delay using Chunked Random Linear Network Coding Broadcast"],"prefix":"10.1145","volume":"4","author":[{"given":"Emmanouil","family":"Skevakis","sequence":"first","affiliation":[{"name":"Carleton University, Ottawa, Ontario, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Lambadaris","sequence":"additional","affiliation":[{"name":"Carleton University, Ottawa, Ontario, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hassan","family":"Halabian","sequence":"additional","affiliation":[{"name":"Carleton University, Ottawa, Ontario, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,8,20]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Peter J. Acklam. 2003. An algorithm for computing the inverse normal cumulative distribution function. Peter\u2019s Page (2003).  Peter J. Acklam. 2003. An algorithm for computing the inverse normal cumulative distribution function. Peter\u2019s Page (2003)."},{"volume-title":"Military Communications Conference (MILCOM). IEEE, 1--7.","author":"Ahmed Ebad","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/03610919908813542"},{"volume-title":"Proceedings of the Workshop on Network Coding, Theory 8 Applications. IEEE, 1--9.","author":"Eryilmaz Atilla","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006454"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.2384251"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CAMAD.2013.6708082"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.284"},{"key":"e_1_2_1_9_1","unstructured":"Tracey Ho. 2004. Networking from a Network Coding Perspective. Ph.D. Dissertation. Citeseer.  Tracey Ho. 2004. Networking from a Network Coding Perspective. Ph.D. Dissertation. Citeseer."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620725"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923722"},{"volume-title":"IEEE Information Theory Workshop (ITW\u201911)","author":"Koller Christian","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2204031"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01149166"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567038"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/IWQOS.2007.376547"},{"volume-title":"Workshop on Network Coding, Theory, and Applications (NetCod\u201909)","author":"Silva Danilo","key":"e_1_2_1_18_1"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2016.7510782"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7842079"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996438"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2271895"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.212277"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.130"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2007.907460"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.2307\/2347330"},{"volume-title":"Information Theory and Applications Workshop (ITA)","year":"2013","author":"Xie Nan","key":"e_1_2_1_27_1"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2295608"}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340242","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340242","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:32Z","timestamp":1750268972000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,20]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9,30]]}},"alternative-id":["10.1145\/3340242"],"URL":"https:\/\/doi.org\/10.1145\/3340242","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"type":"print","value":"2376-3639"},{"type":"electronic","value":"2376-3647"}],"subject":[],"published":{"date-parts":[[2019,8,20]]},"assertion":[{"value":"2018-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}