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 1):
A determination method for determining a termination point of at least one tunnel or tunnel segment 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 a transit router included in the set of routers receiving packets destined for an exit router included in the set, an event modifying the previous topology to a network topology referred to as \u201ca subsequent topology\u201d, a backup path between the transit router and the exit router being calculated for the packets on the basis of the subsequent topology,\n wherein the method comprises the following step act performed prior to the event by a processing device connected to the network:\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 \n the method additionally comprising at least one cycle of the following acts performed after the event by the processing device:\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, and, if this last common router is different from the start router, \n determining the termination point of the tunnel or tunnel segment as being the identified last common router, the tunnel or tunnel segment 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.5107743172795864
- 35 USC 102 Novelty (BERT): 0.5054374606417389
- Combined Prediction Score: 0.5102406316158017
- Mean Citation Score: 239.620784
- Max Citation Score: 249.36382000000003
- Similarity Product: 172.9163850509608

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