Network Coding for Time-Varying Topologies
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network coding techniques struggle with time-varying network topologies, requiring known network topologies for encoding and decoding, and fail to provide Quality of Service (QoS) differentiation across different subsets of information, especially in delay-free and acyclic networks.
Innovation Solution
The method decomposes time-varying network topologies into virtual graphs for distinct traffic classes, selects network codes for each virtual graph, and processes packets using virtual buffer systems to implement these codes, ensuring QoS requirements are met through scheduler-based transmission scheduling.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If network coding is applied over time-varying network topologies, then throughput and information delivery efficiency are improved, but the complexity of managing and adapting to topology changes increases
Solution Approach 1:
The patent implements dynamic adaptation to time-varying network topologies by continuously monitoring topology changes and updating network code parameters accordingly. The system transitions from static to dynamic operation, allowing the network coding scheme to adapt its encoding/decoding parameters in response to changing connectivity conditions, thereby maintaining high throughput despite topology fluctuations.
Solution Approach 2:
The patent changes key parameters of the network coding scheme based on detected topology changes. When topology changes are detected, the system modifies coding parameters such as encoding/decoding functions, buffer management strategies, and routing decisions to match the current network configuration, enabling the system to maintain optimal performance under varying conditions.
2Productivity
If traditional routing strategies are used, then device complexity is reduced, but throughput is limited by bottleneck nodes
Solution Approach 1:
The patent merges traditional routing with network coding by combining copy-and-forward mechanisms with linear coding operations at bottleneck nodes. This hybrid approach allows the system to leverage the simplicity of routing while adding the throughput-enhancing benefits of network coding, achieving higher multicast rates without completely redesigning the forwarding mechanism.
Solution Approach 2:
The patent introduces network coding as an intermediary layer between traditional routing and data transmission. By inserting coding operations at strategic bottleneck nodes, the system transforms the limiting copy-and-forward process into a more efficient coded transmission process, thereby increasing throughput without requiring complete redesign of the routing infrastructure.
3Productivity
If network coding achieves maximum jointly attainable throughput, then information delivery efficiency is improved, but QoS differentiation across different traffic classes becomes difficult to maintain
Solution Approach 1:
The patent segments the network coding process into separate queues and processing channels for different traffic classes. By implementing class-specific queues at bottleneck nodes and applying different coding strategies to different classes, the system maintains QoS differentiation while achieving high throughput for each class according to its requirements.
Solution Approach 2:
The patent applies different network coding strategies and parameters to different traffic classes based on their specific QoS requirements. Each traffic class receives customized encoding/decoding operations tailored to its needs, allowing the system to simultaneously optimize for multiple quality requirements while maintaining overall high throughput efficiency.
Data Source
AI summary
A method and apparatus is disclosed herein for information delivery with network coding over time-varying network topologies. In one embodiment, the method comprises decomposing a sequence of topology graphs that model a time-varying network topology into a plurality of virtual graphs, where each virtual graph of the plurality of virtual graphs corresponds to a distinct traffic class, and the virtual topology graph representing a partial topology of a time-varying network. The method also includes selecting a network code for each virtual graph in the plurality of the virtual graphs to meet requirements of the distinct traffic class corresponding to said each topology graph, where the network code is used to encode packets of the associated traffic class, and processing packets of each traffic class using the network code determined by its corresponding virtual topology and the requirements of said each traffic class, including using a virtual buffer system to implement the network code corresponding to each traffic class over the physical network topology. The method also includes using a scheduler to determine the transmission schedules for each output packet from the virtual buffer system of each traffic class where the scheduling decisions are based, at least in part, on the QoS requirements of each class.