Network Coding Sub-Structure for Shared Media Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network coding techniques fail to effectively handle shared media networks with multiple sources and delays, leading to inefficient information transmission and decoding issues.
Innovation Solution
A method is developed to determine a sub-network with a reduced number of source nodes, optimizing network coding by using a modified Ford Fulkerson algorithm and finite field coding, ensuring the number of sources is less than or equal to the multicast capacity, and accounting for sequence access order in shared media networks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If network coding is implemented in shared media networks with multiple sources, then information transmission capacity is improved, but decoding reliability deteriorates due to delays and multiple sources
Solution Approach 1:
The patent segments the network coding problem by identifying and isolating a specific sub-network structure (butterfly network topology) where coding operations are performed. This segmentation allows the system to apply network coding benefits while controlling the complexity and reliability concerns through structured path selection and source identification.
Solution Approach 2:
The patent performs preliminary identification of disjointed paths and source nodes before executing network coding operations. By pre-determining the sub-network structure and validating path disjunction, the system ensures that decoding reliability is maintained even in shared media environments with delays and multiple sources.
2Productivity
If a sub-network is determined with reduced source nodes, then network coding efficiency is improved, but the number of participating nodes is reduced
Solution Approach 1:
The patent extracts and identifies a specific subset of source nodes that actually participate in the network coding operation within the determined sub-network. By taking out only the relevant sources and paths needed for coding, the system improves efficiency by reducing unnecessary computations while maintaining the essential number of participating nodes through precise path identification.
3Adaptability or versatility
If disjointed paths are identified for each destination node, then information retrieval capability is improved, but computational complexity increases
Solution Approach 1:
The patent applies a universal algorithm (modified Ford-Fulkerson) that can identify disjointed paths for multiple destination nodes simultaneously. This multi-functional approach allows the system to improve information retrieval capability across all destinations while reducing computational complexity by avoiding separate path-finding operations for each node.
Data Source
AI summary
A method provides for building a network coding scheme for the transmission of data between multiple source nodes and multiple destination nodes in a communications network having multiple nodes. The method includes the steps of: for each destination node, determining a first set of source nodes from which there exist disjointed paths, in the communications network, to reach the destination node; determining a second set of source nodes which is the intersection of the first determined sets for the destination nodes; and determining a sub-network for implementing the network coding. The sub-network includes source nodes which belong only to the second set of source nodes, the multiple destination nodes, and nodes included in the disjointed paths connecting the source nodes of the second set of source nodes and the destination nodes. The method also includes the step of building a network coding scheme based on the determined sub-network.