Host-Specific Network Path Calculation for Media Traffic
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing protocols struggle to efficiently route media flows through complex networks with loops and multi-links while maintaining sequence, leading to suboptimal bandwidth utilization and synchronization of audio and video streams.
Innovation Solution
A method that determines whether media data traffic already flows between network switches, applies weightings based on this traffic, and uses a least cost path generation algorithm to calculate new routes, ensuring all flows within a bundle take the same route and optimizing network performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If spanning-tree protocol is used to break loops and remove multi-links, then network stability is improved, but bandwidth utilization deteriorates due to disabled links and wasted bandwidth
Solution Approach 1:
The patent applies dynamic weighting to links based on whether they carry media data traffic. Links that already carry media traffic are given higher weight priority, allowing the system to dynamically adapt the routing tree to utilize available bandwidth while maintaining loop prevention. This resolves the contradiction by making the spanning tree dynamic rather than static, enabling bandwidth optimization without sacrificing network stability.
Solution Approach 2:
The patent changes the parameter of link weighting dynamically based on traffic patterns. By adjusting the weight parameter according to whether media data flows already use a link, the system optimizes bandwidth utilization while maintaining the spanning-tree structure for stability. This parameter change allows the same spanning-tree protocol to achieve both reliability and efficient bandwidth use.
2Loss of energy
If equal cost multi-path routing is used to load balance traffic, then bandwidth utilization is improved, but flow synchronization deteriorates because packets can take different routes
Solution Approach 1:
The patent segments the network routing problem by creating host-specific spanning trees for each endpoint rather than using a single global routing table. This segmentation allows different endpoints to have optimized paths while maintaining consistency for flows within the same bundle, achieving both load balancing and synchronization.
Solution Approach 2:
The patent applies local quality by giving different weight priorities to links based on local traffic patterns. Links carrying media data traffic receive higher priority weights locally, ensuring that flows within a bundle consistently use the same high-priority paths. This local optimization maintains synchronization while achieving overall load balancing across the network.
3Loss of energy
If a least cost path algorithm with dynamic weighting is used to calculate routes, then bandwidth utilization is improved, but computational complexity increases
Solution Approach 1:
The patent applies partial action by calculating host-specific spanning trees only when needed (when hosts are connected or disconnected) rather than continuously recalculating for all possible scenarios. The dynamic weighting is applied selectively based on traffic patterns, reducing unnecessary computational overhead while still achieving optimal bandwidth utilization.
Solution Approach 2:
The patent uses feedback from observed traffic patterns to adjust link weights dynamically. By monitoring whether media data flows already use certain links and adjusting weights accordingly, the system achieves efficient bandwidth utilization through adaptive learning rather than complex predictive algorithms, reducing computational complexity.
Data Source
AI summary
A method of calculating a new route for a media data traffic flow on a computer network when a device is connected to the network, the network comprising a first and a second network switch connected by a link, the method comprising: determining whether media data traffic already flows between the first and second network switch over the link; applying a weighting to the link whose value is based on whether media data traffic already flows over the link; and determining the new route for media data traffic by using a least cost path generation algorithm using the weighting.