Delay optimal scheduling for network coding broadcast

We study the broadcast transmission of a single file to an arbitrary number of receivers in a wireless one-hop setting, using random linear network coding (RLNC). In contrast to similar studies, we apply RLNC within segments of the file. In a previous study, we showed that this method can achieve near optimal file transfer completion time while tackling the main drawbacks of RLNC; increased decoding delay and increased storage and complexity requirements at the receivers. Towards that end we developed and evaluated a packet scheduling policy, namely the Least Received (LR) batches policy. In our previous work, we proved the optimality of the LR policy, with regards to the completion time, in systems with two receivers. In this work we will show that the LR policy is optimal, in the same sense, regardless of the number of the receivers.

[1]  Eytan Modiano,et al.  Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity , 2007, IEEE Transactions on Information Theory.

[2]  Donald F. Towsley,et al.  Reliability Gain of Network Coding in Lossy Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[3]  Sanjay Shakkottai,et al.  Looking at Large Networks: Coding vs. Queueing , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[4]  Atilla Eryilmaz,et al.  Throughput-Delay Analysis of Random Linear Network Coding for Wireless Broadcasting , 2013, IEEE Transactions on Information Theory.

[5]  Srikanth V. Krishnamurthy,et al.  A Framework for Joint Network Coding and Transmission Rate Control in Wireless Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[6]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[7]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[8]  Jörg Kliewer,et al.  On the optimal block length for joint channel and network coding , 2011, 2011 IEEE Information Theory Workshop.

[9]  Parastoo Sadeghi,et al.  Enabling a Tradeoff between Completion Time and Decoding Delay in Instantly Decodable Network Coded Systems , 2014, IEEE Transactions on Communications.

[10]  Ioannis Lambadaris,et al.  Decoding and file transfer delay balancing in network coding broadcast , 2016, 2016 IEEE International Conference on Communications (ICC).

[11]  Jörg Widmer,et al.  Efficient broadcasting using network coding , 2008, IEEE/ACM Trans. Netw..

[12]  Asuman E. Ozdaglar,et al.  On the Delay and Throughput Gains of Coding in Unreliable Networks , 2008, IEEE Transactions on Information Theory.

[13]  Parastoo Sadeghi,et al.  An Optimal Adaptive Network Coding Scheme for Minimizing Decoding Delay in Broadcast Erasure Channels , 2010, EURASIP J. Wirel. Commun. Netw..

[14]  Parastoo Sadeghi,et al.  On Throughput and Decoding Delay Performance of Instantly Decodable Network Coding , 2013, ArXiv.

[15]  Parastoo Sadeghi,et al.  Instantly decodable network coding for delay reduction in cooperative data exchange systems , 2013, 2013 IEEE International Symposium on Information Theory.

[16]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[17]  Ioannis Lambadaris,et al.  Optimal Control for Network Coding Broadcast , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[18]  Tracey Ho,et al.  Networking from a network coding perspective , 2004 .

[19]  Donald F. Towsley,et al.  Sample path methods in the control of queues , 1995, Queueing Syst. Theory Appl..

[20]  Anthony Ephremides,et al.  Stable Throughput for Multicast With Random Linear Coding , 2011, IEEE Transactions on Information Theory.

[21]  Milica Stojanovic,et al.  Random Linear Network Coding For Time Division Duplexing: When To Stop Talking And Start Listening , 2008, IEEE INFOCOM 2009.