PATENT CLAIM ANALYSIS

Application Number: 15781931
Application Type: Utility
Filing Date: 2018-06
Publication Date: 2018-12
Patent Classification: ["370", "218000"]

Abstract:
A method for determining a termination point of at least one tunnel or segment in a packet switching network. The network includes a set of routers and links between them, the routers and links forming a previous network topology, a transit router receiving packets intended for an output router, an event modifying the previous topology into a subsequent network topology, and a backup path between the transit router and the output router being calculated for the subsequent topology. The method includes calculating, prior to the event, for each router, an initial tree based on the previous topology, which has as a root the router and has as branches paths of minimum cost between the root and the other routers. A termination point of a tunnel or segment is obtained to prevent packets transiting between the start router and the output router from entering into a micro-loop caused by the event.

Claim (Index 12):
A device for determining a termination point of at least one tunnel in a packet switching network, the network comprising a set of routers and links between the set of routers, each link having an associated cost, the set of routers and the links forming a network topology referred to as \u201ca previous topology\u201d,\n an encapsulation point of said at least one tunnel being a transit router receiving packets destined for an exit router, an event modifying the previous topology to a network topology referred to as \u201ca subsequent topology\u201d, a backup path of minimum cost being calculated for the packets on the basis of the subsequent topology, the device comprising:\n a processor; and \n a memory storing instructions, which when executed by the processor configure the processor to perform the following acts: \n prior to the event:\n for each of the routers in the set, calculating a tree referred to as \u201can initial tree\u201d, on the basis of the previous topology, said initial tree having as root said each of the routers and having as branches paths of minimum cost between the root and the other routers in the set, \n storing the calculated initial trees in a database, and \n selecting a router on the backup path, referred to as \u201ca start router\u201d, \n from the start router, to the exit router along the backup path, identifying a router, referred to as \u201clast common router\u201d, for which all the links and routers including the last common router, between the start router and the last common router, are common to the backup path and to the initial tree associated with the start router, \n determining as termination point of the tunnel the identified last common router, the tunnel saving the packets that are transiting between the start router and the identified last common router from entering a micro-loop caused by the event.

Metadata:
- Claim Count in Document: 2.0
- Percentile: 94.0
- Lexical Diversity: 2.18919
- Patent Class: 370.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: True
- Related Applications: ['11012044', '09866335', '10771201', '11011814', '15872746']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5109056413811965
- 35 USC 102 Novelty (BERT): 0.5048439272834963
- Combined Prediction Score: 0.5102994699714265
- Mean Citation Score: 239.620784
- Max Citation Score: 249.36382000000003
- Similarity Product: 174.47103556511885

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

Dataset: test