N-Tree Routing for Fair Bandwidth and Low Delay
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional N-tree algorithms fail to ensure fair bandwidth distribution and minimize end-to-end delay in multipoint communication networks, leading to traffic congestion and suboptimal AV quality in applications like video conferencing.
Innovation Solution
A terminal apparatus and method that employs a 'water-spread' policy to construct N-trees by measuring link bandwidth and round-trip times, forming packet transmission paths to ensure equal bandwidth distribution, and dynamically updating forwarding tables to optimize route convergence and minimize latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If conventional N-tree algorithms are used for route construction, then the routing mechanism is simple to implement, but fair bandwidth distribution cannot be ensured and traffic congestion occurs
Solution Approach 1:
The patent changes the routing parameters from simple shortest-path metrics to composite metrics that include available bandwidth, delay, and load information. The route construction algorithm uses these modified parameters to select paths that ensure fair bandwidth distribution while avoiding congestion, thereby resolving the contradiction between simplicity and fairness.
Solution Approach 2:
The patent implements a feedback mechanism where nodes continuously exchange information about link bandwidth, delay, and current load. This feedback is used to dynamically adjust route constructions, ensuring that bandwidth is distributed fairly across all participants while preventing traffic congestion, thus improving reliability without significantly increasing operational complexity.
2Speed
If conventional routing algorithms prioritize shortest path, then transmission speed is maximized, but end-to-end delay increases and AV quality degrades
Solution Approach 1:
The patent modifies the routing parameters from simple hop count or geometric distance to composite metrics that include transmission speed, available bandwidth, and delay information. This allows the algorithm to select routes that maintain high transmission speed while minimizing end-to-end delay, thereby improving AV quality without sacrificing transmission efficiency.
3Reliability
If dynamic route adjustment is implemented to minimize delay, then AV quality is improved, but network complexity and computational overhead increase
Solution Approach 1:
The patent segments the route construction process into distinct phases: metric collection, metric evaluation, and route selection. Each phase handles specific tasks independently, which simplifies the overall complexity while enabling dynamic route adjustment to minimize delay and improve AV quality. The segmentation allows for modular implementation and reduces computational overhead.
4Ease of manufacture
If existing unicast route control methods are used, then implementation is straightforward, but equal bandwidth sharing and minimal delay routes cannot be achieved
Solution Approach 1:
The patent enhances existing unicast route control methods by integrating multiple functions into a unified algorithm. The same routing mechanism handles both bandwidth fairness and delay minimization simultaneously, maintaining implementation ease while achieving superior reliability in terms of bandwidth distribution and AV quality.
Data Source
AI summary
A terminal apparatus minimizes traffic congestion by reducing end-to-end delay and maximizes the bandwidth available in shared N-tree ALM nodes. In this terminal apparatus, an optimal stream path information table stores N-tree session information for all nodes. A server forwarding table stores bandwidth-fair ALM route information for all nodes in a specific N-tree session. An ALM forwarding table constructor updates N-tree session information stored in an optimal stream path information table using network metrics and heuristic rules stored in a heuristic rule database, executes ALM_N-tree algorithm using updated N-tree session information, and thereby generates bandwidth-fair ALM route information.