Dynamic coding and rate-control for serving deadline-constrained traffic over fading channels

We study the problem of optimal dynamic coding and rate-control for broadcasting deadline-constrained traffic with average delivery ratio constraints over time-varying wireless channels. In particular, we propose and analyze a novel policy that utilizes a combination of pricing and finite-horizon dynamic programming strategies to jointly optimize the operation of the following two components: (i) a dynamic rate allocation policy, which manages the incoming traffic flow rates so as to maximize their weighted sum; (ii) and a dynamic coding window selection policy, which satisfies the flows' individual delivery ratio requirements. Our heuristic fluid analysis of the resulting stochastic network operation indicates that our joint policy maximizes the weighted sum of the deadline-constrained flow throughput subject to heterogeneous delivery ratio requirements imposed on them. We also apply these general results to an important cellular downlink scenario with and without network coding capabilities to study its behavior under various conditions. Our simulations reveal that the dynamic coding strategy outperforms the optimal static coding strategy by opportunistically exploiting the statistical variations in the arrival and channel processes.

[1]  Demosthenis Teneketzis,et al.  Stochastic Scheduling in Priority Queues with Strict Deadlines , 1993 .

[2]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[3]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[4]  Donald F. Towsley,et al.  Queueing performance with impatient customers , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[5]  R. Srikant,et al.  Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control , 2005, IEEE/ACM Transactions on Networking.

[6]  Vivek S. Borkar,et al.  A Theory of QoS for Wireless , 2009, IEEE INFOCOM 2009.

[7]  R. Srikant,et al.  Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control , 2007, TNET.

[8]  Demosthenis Teneketzis,et al.  Optimal Multiserver Stochastic Scheduling of two Interconnected Priority Queues , 1994, Advances in Applied Probability.

[9]  Ashutosh Sabharwal,et al.  Delay-bounded packet scheduling of bursty traffic over wireless channels , 2004, IEEE Transactions on Information Theory.

[10]  Tara Javidi,et al.  Optimal code length for bursty sources with deadlines , 2009, 2009 IEEE International Symposium on Information Theory.

[11]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[12]  M. Medard,et al.  On Delay Performance Gains From Network Coding , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[13]  Anthony Ephremides,et al.  Optimal scheduling with strict deadlines , 1989 .

[14]  R. Srikant,et al.  Network Optimization and Control , 2008, Found. Trends Netw..

[15]  R. Srikant,et al.  Optimal Scheduling for Fair Resource Allocation in Ad Hoc Networks With Elastic and Inelastic Traffic , 2011, IEEE/ACM Transactions on Networking.

[16]  Sean P. Meyn,et al.  Stability and convergence of moments for multiclass queueing networks via fluid limit models , 1995, IEEE Trans. Autom. Control..

[17]  Harshavardhana J. Gangammanavar.  OPTIMAL CODING AND SCHEDULING TECHNIQUES FOR BROADCASTING DEADLINE CONSTRAINT TRAFFIC OVER UNRELIABLE WIRELESS CHANNELS , 2009 .