Network Alignment: Treating Networks as Wireless Interference Channel Chun Meng Univ, of california Irvine
Network Alignment: Treating Networks as Wireless Interference Channel Chun Meng Univ. of California, Irvine
Outline o Motivation Network a Wireless Interference Channel approaches NA in the middle, Precoding- Based NA O PBNA Feasibility of PBna Conclusion
o Motivation: Network ≈ Wireless Interference Channel o Approaches: NA in the middle, Precoding-Based NA o PBNA Feasibility of PBNA o Conclusion 2 Outline
State of the art-I Intra-Session Nc Achievable rate min-cut[,] LP-formulation[31 v Code design: RNCI4], deterministic[5] 1R Ahlswede, et al, " Network information flow [2]R Koetter and M. M'edard, "An algebraic approach to network coding BJZ. Li, et al, "On Achieving Maximum Multicast Throughput in Undirected Networks 4]T Ho, et al, a random linear network coding approach to multicast [5]S Jaggi, et al, "Polynomial Time algorithms for Multicast Network Code Construction
Intra-Session NC ✓ Achievable rate = min-cut[1,2] LP-formulation[3] ✓ Code design: RNC[4], deterministic[5] 3 State of the Art - I [1] R. Ahlswede, et al, “Network information flow” [2] R. Koetter and M. M′edard, “An algebraic approach to network coding” [3] Z. Li, et al, “On Achieving Maximum Multicast Throughput in Undirected Networks” [4] T. Ho, et al, “A random linear network coding approach to multicast” [5] S. Jaggi, et al, “Polynomial Time Algorithms for Multicast Network Code Construction
State of the Art-工I Inter-session nc v Only approximation of bounds [I Exponential number of variables v Code design: NP-hard[5] LP evolutionary approach 1]N. Harvey, et al, "On the Capacity of Information Networks [2JAR Lehman and E Lehman, " Complexity classification of network information flow problems 3]D. Traskov, et al, "Network coding for multiple unicasts: An approach based on linear optimization 4 4]M. Kim, et al, " An evolutionary approach to inter-session network coding
Inter-Session NC ✓ Only approximation of bounds [1] Exponential number of variables ✓ Code design: NP-hard[5] LP, evolutionary approach 4 State of the Art - II [1] N. Harvey, et al, “On the Capacity of Information Networks” [2] A. R. Lehman and E. Lehman, “Complexity classification of network information flow problems” [3] D. Traskov, et al, “Network coding for multiple unicasts: An approach based on linear optimization” [4] M. Kim, et al, “An evolutionary approach to inter-session network coding
Restrictive Framework 1 1 Z1=m11x)X1+m21(x)X2+m31(x)X3 Interference must be canceled out 5 R Koetter and M. M'edard, "An algebraic approach to network coding
5 Restrictive Framework 𝑋1 𝑋2 𝑋3 𝑍2 𝑍1 𝑍3 R. Koetter and M. M′edard, “An algebraic approach to network coding” Interference must be canceled out