Link Layer Path Management for Mesh Network Load Distribution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing protocols for the data link layer in local networks, such as Spanning Tree and destination-based switching, fail to efficiently manage multiple flows between a source and destination node, leading to path overload and oscillation issues, as all flows follow the same path, which can result in saturated links and deteriorated service quality.
Innovation Solution
The method allocates different paths to flows based on their categories, such as classes of service, using a unique flow identifier to manage load efficiently, allowing flows from the same source to destination to use distinct paths, and reassigns paths when load conditions change.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If all flows between source and destination follow the same path (traditional link layer routing), then path selection is simple, but path overload occurs and service quality deteriorates
Solution Approach 1:
The patent segments flows into different categories (e.g., video, voice, data) and assigns each category to different paths. This segmentation allows multiple flows between the same source and destination to use different paths, preventing any single path from becoming overloaded while maintaining simple routing decisions within each category.
Solution Approach 2:
The patent implements dynamic path selection based on flow category and network conditions. The routing table is dynamically updated with category-specific path information, allowing the system to adapt to changing network conditions and flow patterns while maintaining organized, category-based routing decisions.
2Productivity
If multiple paths are available between source and destination, then load distribution is possible, but path management complexity increases
Solution Approach 1:
The patent applies local quality by creating category-specific routing entries in the routing table. Each flow category has its own designated path, allowing the system to optimize for different traffic types (e.g., low-latency paths for voice, high-bandwidth paths for video) while maintaining simple, deterministic routing decisions based on flow classification.
Solution Approach 2:
The patent changes the routing parameter from destination-only to category-based destination routing. By introducing flow category as an additional routing parameter, the system can distribute different categories of traffic across multiple paths while maintaining simple, rule-based routing logic that doesn't require complex real-time optimization.
3Device complexity
If a single path is used for all flows, then routing tables are simple, but link saturation occurs and oscillation problems arise
Solution Approach 1:
The patent segments the routing table into category-specific entries, where each flow category has its own designated path. This segmentation allows the routing table to maintain a simple, deterministic structure while supporting multiple paths for different traffic types, preventing link saturation by distributing traffic across multiple category-specific paths.
Data Source
Figure 1~2
Figure 3~4
AI summary
The invention relates to a method for managing paths between at least one source node and at least one destination node within the link layer in a mesh communication network including a plurality of intermediate nodes, characterized in that, at a given moment, at least two separate paths between said source node and said destination node are defined for distributing streams to be transmitted between said source node and said destination node, and in that said method includes the following steps that are carried out in said source node: allocating a stream identifier to said streams; associating information representing a stream category to said streams; allocating one of said paths to one of said streams while taking into account said stream identifier and said stream category information.