NETWORK CODING THE CASE OF MULTIPLE UNICAST SESSIONS
暂无分享,去创建一个
[1] Lap Chi Lau,et al. An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem* , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[2] Zongpeng Li,et al. On Achieving Optimal End-to-End Throughput in Data Networks: Theoretical and Empirical Studies , 2004 .
[3] Zongpeng Li,et al. Network Coding in Undirected Networks , 2004 .
[4] K. Onaga,et al. On feasibility conditions of multicommodity flows in networks , 1971 .
[5] Philip A. Chou,et al. A comparison of network coding and tree packing , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[6] Baochun Li,et al. How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.
[7] Muriel Médard,et al. An algebraic approach to network coding , 2003, TNET.
[8] April Rasala Lehman. Network coding , 2005 .
[9] Peter Sanders,et al. Polynomial time algorithms for network information flow , 2003, SPAA '03.
[10] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[11] Shuo-Yen Robert Li,et al. Linear network coding , 2003, IEEE Trans. Inf. Theory.
[12] Ying Zhu,et al. Multicast with network coding in application-layer overlay networks , 2004, IEEE Journal on Selected Areas in Communications.