Skip to Main Content
ASME Press Select Proceedings

International Conference on Mechanical and Electrical Technology, 3rd, (ICMET-China 2011), Volumes 1–3

By
Yi Xie
Yi Xie
Search for other works by this author on:
ISBN:
9780791859810
No. of Pages:
906
Publisher:
ASME Press
Publication date:
2011

Based on the Ford-Fulkerson labeling algorithm which can realize network maximum flow, combining with “edge split path” thought, and through the new understanding of “reused link” and “super critical nodes”, an improved algorithm of reducing the network encoding nodes is proposed in this paper. The algorithm can not only reduce the network encoding nodes to know the necessary encoding nodes, but also determine the information transmitted on the network links using simple linear coding method at coding nodes. Simulation shows that, the proposed algorithm reduces the number of encoding nodes obviously while achieving the multicast maximum flow.

Abstract
Keywords
1. Introduction
2. Algorithm Proposed Background
3. Improved Network Coding Nodes Reduction Algorithm
4. Simulation and Analysis
5. Conclusion
References
This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal