Fast Resource Allocation for Network-Coded Traffic - A Coded-Feedback Approach

In this paper, we develop a fast resource allocation algorithm that takes advantage of intra-session network coding. The algorithm maximizes the total utility of multiple unicast (or multicast) sessions subject to capacity constraints, where packets are coded within each session. Our solution is a primal solution that does not use duality or congestion prices. Thus, it does not require building up queues to achieve the optimal resource allocation. Hence, the queueing delay of the packets can be tightly controlled. The existing primal solution in the literature requires a separate graph-theoretic algorithm to find the min-cut of each session, whose complexity grows quadratically with the total number of nodes. In contrast, we provide a new coded-feedback approach whose complexity grows only linearly with the total number of nodes. More explicitly, by letting the ACK/feedback packets on the return paths also carry coding coefficients as does the forward coded traffic, key network information can be obtained more efficiently, which leads to a fast resource allocation scheme fully integrated with the network coding operation.

[1]  Jörg Widmer,et al.  Network coding: an instant primer , 2006, CCRV.

[2]  Ness B. Shroff,et al.  Optimization Based Rate Control for Communication Networks with Inter-Session Network Coding , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[3]  Yunnan Wu,et al.  Distributed utility maximization for network coding based multicasting: a shortest path approach , 2006, IEEE Journal on Selected Areas in Communications.

[4]  Yunnan Wu,et al.  Distributed Utility Maximization for Network Coding Based Multicasting: A Critical Cut Approach , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[5]  Ness B. Shroff,et al.  Utility maximization for communication networks with multipath routing , 2006, IEEE Transactions on Automatic Control.

[6]  Chih-Chun Wang Pruning Network Coding Traffic by Network Coding—A New Class of Max-Flow Algorithms , 2010, IEEE Transactions on Information Theory.

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

[8]  Muriel Médard,et al.  XORs in the air: practical wireless network coding , 2008, TNET.

[9]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[10]  K. Jain,et al.  Practical Network Coding , 2003 .

[11]  Chih-Chun Wang Pruning network coding traffic by network coding — A new max-flow algorithm , 2008, 2008 IEEE International Symposium on Information Theory.

[12]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[13]  Xiaojun Lin,et al.  Joint rate control and scheduling in multihop wireless networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

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

[15]  Yufang Xi,et al.  Distributed Algorithms for Minimum Cost Multicast With Network Coding , 2010, IEEE/ACM Transactions on Networking.

[16]  Harish Viswanathan,et al.  Dynamic Algorithms for Multicast With Intra-Session Network Coding , 2009, IEEE Transactions on Information Theory.

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

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

[19]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[20]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.