An Achievable Region for the Double Unicast Problem Based on a Minimum Cut Analysis
作者： Shurui Huang , A. Ramamoorthy
DOI: 10.1109/TCOMM.2013.053013.120542
关键词:
摘要: We consider the multiple unicast problem under network coding over directed acyclic networks when there are two source-terminal pairs, s1-t1 and s2-t2. The capacity region for this is not known; furthermore, outer bounds on have a large number of inequalities which makes them hard to explicitly evaluate. In work we related problem. assume that only know certain minimum cut values network, e.g., mincut(Si, Tj), where Si ⊆ {s1, s2} Tj {t1, t2} different subsets Tj. Based these values, propose an achievable rate using linear codes. Towards end, begin by defining multicast both sources terminals. Following enlarge appropriately encoding information at source nodes, such terminal ti guaranteed decode from intended si, while decoding function other source. depends upon relationship in network.
sci-hub.se 参考文章(23)
Yong Zeng, Tracey Ho, Xiaoli Xu, Yong Liang Guan, On the Capacity Region of Two-User Linear Deterministic Interference Channel and Its Application to Multi-Session Network Coding. arXiv: Information Theory. ,(2012)
Xijin Yan, Raymond W. Yeung, Zhen Zhang, The Capacity Region for Multi-source Multi-sink Network Coding international symposium on information theory. pp. 116- 120 ,(2007) , 10.1109/ISIT.2007.4557213
Sudeep U. Kamath, David N. C. Tse, Venkat Anantharam, Generalized Network Sharing Outer Bound and the Two-Unicast Problem 2011 International Symposium on Networking Coding. pp. 1- 6 ,(2011) , 10.1109/ISNETCOD.2011.5978909
Abhik Das, Sriram Vishwanath, Syed Jafar, Athina Markopoulou, Network coding for multiple unicasts: An interference alignment approach international symposium on information theory. pp. 1878- 1882 ,(2010) , 10.1109/ISIT.2010.5513311
Shurui Huang, Aditya Ramamoorthy, On the Multiple-Unicast Capacity of 3-Source, 3-Terminal Directed Acyclic Networks IEEE ACM Transactions on Networking. ,vol. 22, pp. 285- 299 ,(2014) , 10.1109/TNET.2013.2270438
T. Ho, M. Medard, R. Koetter, D.R. Karger, M. Effros, J. Shi, B. Leong, A Random Linear Network Coding Approach to Multicast IEEE Transactions on Information Theory. ,vol. 52, pp. 4413- 4430 ,(2006) , 10.1109/TIT.2006.881746
Shurui Huang, Aditya Ramamoorthy, A Note on the Multiple Unicast Capacity of Directed Acyclic Networks 2011 IEEE International Conference on Communications (ICC). pp. 1- 6 ,(2011) , 10.1109/ICC.2011.5962872
Weifei Zeng, Viveck R. Cadambe, Muriel Medard, An Edge Reduction Lemma for linear network coding and an application to two-unicast networks allerton conference on communication, control, and computing. pp. 509- 516 ,(2012) , 10.1109/ALLERTON.2012.6483261
Shurui Huang, Aditya Ramamoorthy, An achievable region for the double unicast problem based on a minimum cut analysis information theory workshop. pp. 120- 124 ,(2011) , 10.1109/ITW.2011.6089359
Jaemin Han, Chih-Chun Wang, Ness B. Shroff, Analysis of precoding-based intersession network coding and the corresponding 3-unicast interference alignment scheme allerton conference on communication, control, and computing. pp. 1033- 1040 ,(2011) , 10.1109/ALLERTON.2011.6120281