Multicast Routing Path Cost Adjustment
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current multicast routing methods often result in unnecessary data replication and inefficient network usage, as they typically build trees based solely on shortest paths without considering current and predicted network performance, leading to potential congestion and suboptimal Quality of Service (QoS).
Innovation Solution
A method that determines the cost of routing paths by combining unicast link costs with predicted performance costs, adjusted by relative weighting factors, to select the most suitable path for joining a multicast transmission, allowing the multicast tree to evolve based on traffic considerations and network performance, thereby optimizing the tree structure to prevent data replication and ensure QoS.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If multicast routing trees are built based solely on shortest paths, then the tree structure is simple and easy to maintain, but network performance deteriorates due to congestion and suboptimal QoS
Solution Approach 1:
The patent changes the routing parameters from static shortest-path metrics to dynamic performance-based metrics. It introduces a cost function that combines link cost, predicted performance cost, and relative weighting factors to dynamically select optimal paths. This allows the multicast tree to adapt to changing network conditions while maintaining a manageable structure through automated path selection.
Solution Approach 2:
The patent makes the multicast tree dynamic by allowing paths to be reselected based on current and predicted network performance. The system continuously evaluates alternative paths using performance metrics and adjusts the tree structure accordingly, enabling adaptation to congestion and changing QoS requirements without manual intervention.
2Adaptability or versatility
If data is broadcast by flooding the whole network, then all hosts can potentially receive the data, but significant amounts of unwanted data are generated in network branches without interested hosts
Solution Approach 1:
The patent segments the network into a structured multicast tree where data is transmitted only along necessary paths to interested hosts. By organizing the network into hierarchical branches based on actual receiver locations, it eliminates unnecessary data transmission in segments of the network without interested hosts, reducing bandwidth consumption while maintaining comprehensive coverage for all interested receivers.
3Productivity
If multicast routing paths are selected without considering predicted network performance, then routing decisions are simple and fast, but the paths may fail to provide required QoS levels
Solution Approach 1:
The patent performs preliminary actions by pre-calculating and storing performance metrics for multiple alternative paths before routing decisions are needed. It maintains a database of predicted performance costs and uses this pre-computed information to make rapid routing decisions, combining the benefits of advance preparation with fast real-time selection to ensure both speed and QoS reliability.
4Stability of the object's composition
If the multicast tree structure remains static, then the tree is stable and easy to manage, but it cannot adapt to changing network conditions and usage patterns
Solution Approach 1:
The patent introduces dynamics into the multicast tree by implementing periodic reevaluation of paths based on updated network performance metrics. While the overall tree structure remains stable, individual paths can be dynamically adjusted to adapt to changing conditions. This balanced approach maintains structural stability for easy management while enabling adaptation through automated path optimization.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
There is described a method of managing routing paths, in particular multicast routing paths, in a content delivery network. The method includes determining, according to a unicast routing protocol, a first link cost for a first routing path and determining a second link cost for a second routing path, the second routing path comprising a first component comprising a link cost to a router that is part of a multicast group and a second component comprising a link cost for the multicast tree from the router. An adjustment factor is then determined based on information received from the content delivery network. The adjustment factor is applied to the second link cost. The adjusted second link cost and the first link cost are analysed to determine an adjusted least cost path in the content delivery network and the adjusted second link cost is selectively output to a routing database to influence routing in the content delivery network.