Multicast Loop Detection via IP Prefix Source Address Verification

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing network technologies face challenges in preventing routing loops and duplicate packet delivery in multicast networks, which can lead to network performance degradation due to inaccurate routing information and redundancy among nodes.

Innovation Solution

Implementing techniques such as reverse path forwarding (RPF) checks, designated forwarder elections, and loop detection mechanisms to ensure that only the designated node forwards packets, thereby preventing loops and redundant deliveries.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If multiple nodes forward packets in a multicast network, then packet delivery coverage is improved, but routing loops and duplicate deliveries occur

Engineering Contradiction:
Improvepacket delivery coverageVSAvoidrouting loop prevention
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The system performs preliminary actions by establishing a hierarchical node structure with designated root nodes and boundary nodes before packet forwarding begins. Boundary nodes are pre-configured with forwarding rules based on their position in the multicast tree, ensuring that only appropriate nodes forward packets in specific directions. This preliminary organization prevents routing loops and duplicate deliveries while maintaining comprehensive packet delivery coverage across the network.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If loop detection mechanisms are implemented, then routing loop prevention is improved, but network node complexity increases

Engineering Contradiction:
Improverouting loop preventionVSAvoidnode complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The network is segmented into hierarchical levels with designated root nodes, intermediate nodes, and boundary nodes. Each segment (subtree) has a designated root node that controls forwarding decisions for that segment. This segmentation simplifies loop detection by localizing control functions to specific nodes rather than requiring complex inter-node coordination across the entire network, thereby preventing routing loops while maintaining manageable node complexity.

Inventive Principle:
Principle #1Segmentation

3Loss of energy

If duplicate packet filtering is implemented, then network resource efficiency is improved, but packet processing overhead increases

Engineering Contradiction:
Improvenetwork resource efficiencyVSAvoidpacket processing overhead
Core Design Contradiction:
Loss of energyVSDevice complexity

Solution Approach 1:

The system performs preliminary filtering actions by configuring boundary nodes with specific forwarding rules before packets enter the multicast distribution tree. Boundary nodes are pre-instructed to forward packets only toward their designated subtree and to discard packets destined for other directions. This preliminary configuration eliminates the need for complex runtime duplicate detection and filtering, reducing packet processing overhead while improving network resource efficiency by preventing unnecessary packet transmissions from the outset.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS9781029B2Loop detection and prevention
Publication Date: 2017.10.03 CISCO TECHNOLOGY INC
  • US9781029B2 patent drawing
  • US9781029B2 patent drawing
  • US9781029B2 patent drawing

AI summary

Various systems and methods for preventing loops. For example, one method involves receiving a multicast data packet at a node. The node is coupled to a local area network (LAN). An internet protocol (IP) prefix is assigned to the LAN. The method involves determining whether a source address included in the packet is covered by the IP prefix. Depending on the direction of travel of the multicast data packet and whether or not the source address is covered by the IP prefix, the node determines whether a loop exists.