Unified construction algorithm of network coding in cyclic networks

Authors:
Jiaqing Huang;Liang Wang;Tiyuan Zhang;Hui Li
Affiliations:
Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Hubei Key Lab of Smart Internet Tech., Wuhan, China;Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Hubei Key Lab of Smart Internet Tech., Wuhan, China;Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Hubei Key Lab of Smart Internet Tech., Wuhan, China;The Key Laboratory of Integrated Microsystems, Shenzhen Graduate School of Peking University, Shenzhen, China
Venue:
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Year:
2009

Citing 10
Cited 0

Polynomial time algorithms for network information flow

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Cycle-logical treatment for "Cyclopathic" networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Network Coding Theory (Foundations and Trends(R) in Communications and Information Theory)

Network Coding Theory (Foundations and Trends(R) in Communications and Information Theory)
Polynomial Time Construction Algorithm of BCNC for Network Coding in Cyclic Networks

ICIS '09 Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science
Applying network coding to cyclic networks

INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory
Information flow decomposition for network coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network coding in cyclic networks may have better performance than network coding in acyclic networks with regard to the multi-unicast scenarios. Harvey et al. showed that network coding in cyclic networks can be strictly better than fractional routing in conservative networks which have widely practical scenarios such as P2P networks. Hence, we motivated investigating how to achieve that better performance of network coding in cyclic networks by a general construction algorithm. Li et al. presented there are four levels for network code in cyclic networks, including Basic Convolutional Network Code(BCNC),Convolutional Dispersion(CD), Convolutional Broadcast( CB) and Convolutional Multicast(CM). Subsequently, it is interesting to investigate how to construct all four levels of network coding in cyclic networks. Based on our previous work of construction algorithm of BCNC, we proposed a unified algorithm to construct network coding in cyclic networks using notion of flow set. Our contributions were as follows:(1)we showed insights of the essential difference between two classes(i.e. BCNC and CD/CB/CM) of network codes in cyclic networks. (2)we showed insights how to uniformly handle cycles for these two classes of network codes in cyclic networks by proposing the unified construction algorithm. Here, we used the cycles classifications defined by Barbero et al., including link cycles but flow-acyclic, simple flow cycles and flow knots(simply knots).