Dynamic P2MP Tree Extension via Leaf Node Path Requests

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Current point-to-multipoint (P2MP) multicast tree configurations require manual and cumbersome static configuration of leaf nodes, necessitating complete recomputation when new leaves are added, which is inefficient and labor-intensive.

Innovation Solution

A dynamic mechanism is introduced to add new leaves to P2MP tunnels by having leaf nodes request paths from the root node, using the root node as a path computation element to compute and establish additional tunnel segments, thereby allowing dynamic extension of the multicast tree without manual intervention.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Use of energy by moving object

If static configuration of leaf nodes is used, then bandwidth management is optimized, but configuration complexity and manual intervention increase

Engineering Contradiction:

Improvebandwidth management efficiencyVSAvoidconfiguration complexity

Core Design Contradiction:

Use of energy by moving objectVSDevice complexity

Solution Approach 1:

The patent transforms the static configuration model into a dynamic one where leaf nodes can autonomously join and leave the multicast tree. The root node continuously receives join/leave requests and dynamically recomputes the P2MP tree topology, eliminating manual configuration while maintaining bandwidth optimization through on-demand path computation.

Inventive Principle:

Principle #15Dynamics

Solution Approach 2:

Leaf nodes are empowered to autonomously request joins and leave the multicast group without administrator intervention. The system enables self-service by allowing end devices to dynamically participate in multicast traffic, with the root node automatically handling path computation and tree reconstruction.

Inventive Principle:

Principle #25Self-service

2Manufacturing precision

If complete recomputation is performed when new leaves are added, then optimal path selection is achieved, but computation time and signaling overhead increase

Engineering Contradiction:

Improvepath computation accuracyVSAvoidrecomputation time

Core Design Contradiction:

Manufacturing precisionVSLoss of time

Solution Approach 1:

Instead of always performing complete P2MP tree recomputation when leaves join or leave, the system selectively triggers full recomputation only when necessary. The root node evaluates whether partial updates or incremental adjustments suffice, performing complete recomputation only when topology changes significantly impact the optimal tree structure, thereby reducing unnecessary computation time and signaling overhead.

Inventive Principle:

Principle #16Partial or excessive action

Data Source

PatentUS7801137B2Receiver-based construction of point-to-multipoint trees using path computation elements in a computer network

Publication Date: 2010.09.21 CISCO TECHNOLOGY INC

AI summary

In one embodiment, a trigger to add a leaf node to a multicast group of a computer network is detected, and the leaf node may determine a root node of the multicast group to request a path between a tunnel tree and the leaf node of the multicast group. In response to the multicast group having an existing tree, a reply is received from the root node with a computed path to add the leaf node to the tree at a selected node of the tree. The leaf node may then be added to the multicast group tunnel tree over the computed path at the selected node.