Control for Inter-session Network Coding

We propose a dynamic routing-scheduling-coding strategy for serving multiple unicast sessions when linear network coding is allowed across sessions. Noting that the set of stabilizable throughput levels in this context is an open problem, we prove that our strategy supports any point in the non-trivial region of achievable rates recently characterized by Traskov et al. [1]. This work also provides a theoretical framework in which the gains of intersession network coding and pure routing can be compared.

[1]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-layer rate control in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Raymond W. Yeung,et al.  Multilevel diversity coding with distortion , 1995, IEEE Trans. Inf. Theory.

[3]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[4]  Tracey Ho.  Polynomial-time algorithms for coding across multiple unicasts , 2006, ArXiv.

[5]  Jon Crowcroft,et al.  Network Coding Made Practical , 2006 .

[6]  Fang Zhao,et al.  Minimum-cost multicast over coded packet networks , 2005, IEEE Transactions on Information Theory.

[7]  Yunnan Wu,et al.  Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast , 2004 .

[8]  Michael J. Neely,et al.  Dynamic power allocation and routing for satellite and wireless networks with time varying channels , 2003 .

[9]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[10]  Tracey Ho,et al.  Network Coding for Wireless Applications: A Brief Tutorial , 2005 .

[11]  Babak Hassibi,et al.  Capacity of wireless erasure networks , 2006, IEEE Transactions on Information Theory.

[12]  R. Koetter,et al.  Approaches to Network Coding for Multiple Unicasts , 2006, 2006 International Zurich Seminar on Communications.

[13]  R. Srikant,et al.  Joint Asynchronous Congestion Control and Distributed Scheduling for Multi-Hop Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[14]  R. Srikant,et al.  Resource Allocation in Multi-hop Wireless Networks , 2006, 2006 International Zurich Seminar on Communications.

[15]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[16]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[17]  Sachin Katti,et al.  The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments , 2005 .

[18]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[19]  Atilla Eryilmaz,et al.  Distributed Fair Resource Allocation in Cellular Networks in the Presence of Heterogeneous Delays , 2007, IEEE Trans. Autom. Control..

[20]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[21]  Matthew Andrews,et al.  Providing quality of service over a shared wireless link , 2001, IEEE Commun. Mag..

[22]  Eytan Modiano,et al.  Dynamic power allocation and routing for time-varying wireless networks , 2005 .

[23]  R. Dougherty,et al.  The Vámos Network , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[24]  Muriel Médard,et al.  Network Coding for Multiple Unicasts: An Approach based on Linear Optimization , 2006, 2006 IEEE International Symposium on Information Theory.

[25]  Randall Dougherty,et al.  Insufficiency of linear coding in network information flow , 2005, IEEE Transactions on Information Theory.

[26]  Muriel Médard,et al.  On coding for reliable communication over packet networks , 2005, Phys. Commun..