US5371732A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of detecting a routing loop in a telecommunication network, telecommunication network for using the method, and detection means for use in the telecommunication network
Assignee: Koninklijke KPN NV
•
Filing: 1993-02-08
•
Granted: 1994-12-06
•
Expires: 2013-02-08
Abstract
Abstract Known methods of detecting routing loops in telecommunication networks are cumbersome and time-consuming. In addition, the probability that an existing routing loop is even actually detected is too low. In a method of detecting a routing loop according to the invention, paths whose lengths are stored are assembled. As soon as the length of a (partly assembled) path exceeds a predetermined value which is greater than, or equal to, the largest existing path length in the telecommunication network, this indicates the existence of a routing loop.
Inventors
- 👤 Franciscus W. A. Brocken
- 👤 Cyrillus G. J. Houben
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 16:40
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/18
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
126 words
Method of detecting a routing loop in a telecommunication system equipped with nodes, each containing node-specific routing information, comprising the steps of: assembling a path from a source node, on the one hand, to a destination node, on the other hand, on the basis of the node-specific routing information associated with the source node and the node-specific routing information associated with the nodes situated on the path, during the assembly of the path, increasing a parameter of said path at each subsequent node situated on said path by one unit, comparing the parameter, expressed in a number of units, of a partly assembled path with a predetermined value, and detecting the partly assembled path whose parameter exceeds said value as a path containing a routing loop.
Claim 2
Dependent Claim
126 words
Method of detecting a routing loop in a telecommunication system equipped with nodes, each containing node-specific routing information, comprising the steps of: assembling a path from a source node, on the one hand, to a destination node, on the other hand, on the basis of the node-specific routing information associated with the source node and the node-specific routing information associated with the nodes situated on the path, during the assembly of the path, increasing a parameter of said path at each subsequent node situated on said path by one unit, comparing the parameter, expressed in a number of units, of a partly assembled path with a predetermined value, and detecting the partly assembled path whose parameter exceeds said value as a path containing a routing loop.
Claim 3
Dependent Claim
47 words
Method according to claim 1, wherein of two nodes which are situated on the path to be assembled and which each has a direct routing possibility to the other in their routing possibility, using not more than one of the two routing possibilities in assembling the path.
Claim 4
Dependent Claim
39 words
Method according to claim 2, wherein said detecting step includes selecting all the nodes to function successively as the destination node, and selecting all the remaining nodes to successively function as the source node for each selected destination node.
Claim 5
Dependent Claim
132 words
Telecommunication network comprising: a plurality of nodes which each contain node-specific routing information, and detection means comprising path assembly means for assembling a path from a source node, on the one hand, to a destination node, on the other hand, on the basis of the node-specific routing information associated with the source node and the node-specific routing information associated with the nodes situated on the path, wherein the detection means further comprises: counting means for increasing a counter position by one counting unit at each subsequent node situated on the path during the assembly of said path, and comparator means for comparing the counter position associated with a partly assembled path with a predetermined counter value and for generating an alarm signal in the event of said predetermined counter value being exceeded.
Claim 6
Dependent Claim
132 words
Telecommunication network comprising: a plurality of nodes which each contain node-specific routing information, and detection means comprising path assembly means for assembling a path from a source node, on the one hand, to a destination node, on the other hand, on the basis of the node-specific routing information associated with the source node and the node-specific routing information associated with the nodes situated on the path, wherein the detection means further comprises: counting means for increasing a counter position by one counting unit at each subsequent node situated on the path during the assembly of said path, and comparator means for comparing the counter position associated with a partly assembled path with a predetermined counter value and for generating an alarm signal in the event of said predetermined counter value being exceeded.
Claim 7
Dependent Claim
59 words
Telecommunication network according to claim 4, wherein the detection means includes ignoring means for ignoring at least one of the two routing possibilities in the assembly of the path in the case of two nodes which are situated on the path to be assembled and which each has a direct routing possibility to the other in their routing information.
Claim 8
Dependent Claim
40 words
Telecommunication network according to claim 5, wherein the detection means includes selection means for successively selecting all the nodes as the destination node and for successively selecting all the remaining nodes as the source node for each destination node selected.
Claim 9
Dependent Claim
174 words
Detection means for use in a telecommunication network, comprising: path assembly means for assembling a path from a source node, on the one hand, to a destination node, on the other hand, on the basis of node-specific routing information associated with the source node and node-specific routing information associated with the nodes situated on the path, and detection means comprising path assembly means for assembling a path from a source node, on the one hand, to a destination node, on the other hand, on the basis of the node-specific routing information associated with the source node and the node-specific routing information associated with the nodes situated on the path, wherein the detection means further comprises: (a) counting means for increasing a counter position by one counting unit at each subsequent node situated on the path during the assembly of said path, and (b) comparator means for comparing the counter position associated with a partly assembled path with a predetermined counter value and for generating an alarm signal in the event of it being exceeded.
Claim 10
Dependent Claim
174 words
Detection means for use in a telecommunication network, comprising: path assembly means for assembling a path from a source node, on the one hand, to a destination node, on the other hand, on the basis of node-specific routing information associated with the source node and node-specific routing information associated with the nodes situated on the path, and detection means comprising path assembly means for assembling a path from a source node, on the one hand, to a destination node, on the other hand, on the basis of the node-specific routing information associated with the source node and the node-specific routing information associated with the nodes situated on the path, wherein the detection means further comprises: (a) counting means for increasing a counter position by one counting unit at each subsequent node situated on the path during the assembly of said path, and (b) comparator means for comparing the counter position associated with a partly assembled path with a predetermined counter value and for generating an alarm signal in the event of it being exceeded.
Claim 11
Dependent Claim
59 words
Detection means according to claim 7, wherein the detection means includes ignoring means for ignoring at least one of the two routing possibilities in the assembly of the path in the case of two nodes which are situated on the path to be assembled and which each has a direct routing possibility to the other in their routing information.
Claim 12
Dependent Claim
41 words
Detection means according to claim 8, wherein the detection means includes selection means for successively selecting all of the nodes as the destination node and for successively selecting all the remaining nodes as the source node for each destination node selected.
References Cited (Backward Citations)
US4736363A
Cited
US4788721A
Cited
US5111198A
Cited
US4984264A
Cited
US5086428A
Cited
EP0423053A2
Cited
US5014262A
Cited
US5077730A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-12-05 | 1998-06-06 | 1998-12-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-12-05 | 2002-06-06 | 2002-12-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-12-05 | 2006-06-06 | 2006-12-06 | $7700.00 | Window Closed / Lapsed |