PATENT CLAIM ANALYSIS

Application Number: 15760988
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2018-10
Patent Classification: ["370", "238000"]

Abstract:
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.

Claim (Index 1):
A method of forwarding an interest packet based on a probability tree in an information network, comprising:\n setting a threshold function according to a type of a to-be-forwarded interest packet, the threshold function being arranged for deciding whether to trigger the probability tree where leaf nodes correspond one-to-one to all optional forwarding interfaces for the interest packet to learn; after the threshold function triggers the probability tree to learn, computing a cost value of each of the optional forwarding interfaces for the interest packet, respectively; adjusting the probability tree by incrementing probabilities of a leaf node and non-leaf nodes in the probability tree, where the leaf node corresponds to an optional forwarding interface that has a smallest cost value and the non-leaf nodes refer to those nodes that have to be traversed from a root node till the leaf node; based on the adjusted probability tree, starting from the root node of the probability tree, selecting, in accordance with probabilities of respective sub-nodes of a current node, a sub-node of the current node, and stopping till the selected sub-node is a leaf node; and forwarding the to-be-forwarded interest packet from the optional forwarding interface corresponding to the selected leaf node.

Metadata:
- Claim Count in Document: 10.0
- Percentile: 90.0
- Lexical Diversity: 2.14607
- Patent Class: 370.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['13672924', '15360616', '12267296', '13664003', '15081776']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5074542801650841
- 35 USC 102 Novelty (BERT): 0.5012073158856156
- Combined Prediction Score: 0.5068295837371373
- Mean Citation Score: 231.879754
- Max Citation Score: 245.14668
- Similarity Product: 176.01573869869708

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test