Probability Tree Interest Packet Forwarding in NDN

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The existing BestRoute forwarding policy in Named Data Networking (NDN) lacks sensitivity to network status changes, leading to inefficient load balancing and overuse of optimal forwarding interfaces, which hampers adaptability and equilibrium in network communication.

Innovation Solution

A method and apparatus for forwarding interest packets based on a probability tree, where a threshold function determines when to trigger learning, computes cost values for forwarding interfaces, adjusts probabilities in the tree to prioritize optimal paths, and selects forwarding interfaces based on these probabilities, allowing for adaptive and efficient routing.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If the BestRoute forwarding policy is used to select forwarding interfaces based on green, yellow, and red status categories, then the forwarding policy has good adaptability to network status changes, but the shifts among forwarding interfaces are very inflexible causing overuse of optimal forwarding interfaces and poor load equilibrium

Engineering Contradiction:
Improveadaptability to network status changesVSAvoidload equilibrium
Core Design Contradiction:
Adaptability or versatilityVSEase of operation

Solution Approach 1:

The patent applies dynamics by transitioning from the static BestRoute policy (with fixed green/yellow/red categories) to a dynamic probability tree-based forwarding policy. The probability tree continuously adjusts forwarding probabilities based on real-time network status feedback, enabling flexible adaptation to changing network conditions while automatically achieving load equilibrium through probabilistic distribution across multiple interfaces.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent implements feedback mechanisms where the probability tree learns from network status changes and adjusts forwarding probabilities accordingly. The system monitors network conditions, updates the probability tree structure, and uses this learned information to optimize forwarding decisions, creating a closed-loop control system that continuously improves load distribution and adaptability.

Inventive Principle:
Principle #23Feedback

2Productivity

If the BestRoute forwarding policy prioritizes green forwarding interfaces, then the optimal forwarding interface is selected, but the policy lacks sensitivity to network status changes causing overuse of the same interface

Engineering Contradiction:
Improveforwarding efficiencyVSAvoidsensitivity to network status changes
Core Design Contradiction:
ProductivityVSAdaptability or versatility

Solution Approach 1:

The patent replaces the static BestRoute prioritization with a dynamic probability tree that continuously adapts forwarding probabilities based on current network status. Instead of always selecting the same green interface, the system dynamically adjusts probabilities to reflect real-time conditions, maintaining high forwarding efficiency while improving sensitivity to network changes.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the forwarding parameter from fixed interface selection (BestRoute) to dynamic probability adjustment. The probability tree modifies forwarding probabilities as parameters based on network status changes, allowing the system to maintain efficiency while becoming more sensitive to varying network conditions through continuous parameter optimization.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS10355986B2Method and apparatus for forwarding an interest packet based on a probability tree in an information network
Publication Date: 2019.07.16 PEKING UNIV SHENZHEN GRADUATE SCHOOL
  • US10355986B2 patent drawing
  • US10355986B2 patent drawing
  • US10355986B2 patent drawing

AI summary

A method and device for forwarding an interest packet based on a probability tree in an information network. By introducing a probability tree, the process of forwarding an interest packet is finally changed into a selection process: starting from a root node of the probability tree, selecting child nodes of a current node according to the probability of each child node of the current node, and stopping selecting until the selected child node is a leaf node. Moreover, the introduced probability tree provides a good carrier for machine learning. By considering the selection process as an optimization problem, the selection process can be converged to be approximate to an optimal state using online machine learning, and moreover, the probability of each node in the probability tree can be adjusted according to changes in network conditions, so that the forwarding method and device have strong adaptability to the network changes, thereby improving self-adaptability. Compared with the existing interest packet forwarding solution, the present invention improves the forwarding efficiency, increases throughput, and achieves load balance.