US5321812A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Loop detection and dissolution in a focal point network
Assignee: International Business Machines Corp
•
Filing: 1991-04-29
•
Granted: 1994-06-14
•
Expires: 2011-04-29
Abstract
Abstract In a focal point network, adjacent nodes may agree to a relationship where one node (a focal point or server node) supplies network management services to the other node (a non-focal point or served node). A served node forwards management services data to its server node without waiting for any request. There is a risk that the nodes will become configured into a closed loop within which data, once introduced, will circulate endlessly. To eliminate this risk, a loop-detection message is generated when a node acquires a new server node and is itself a server node for other nodes. The message, which includes the originating node's name, is passed from served node to server node. Each node inspects the message. If it does not find its own name, it appends its name to the message and passes it on to its own server node. If the node does find its own name, it generates a loop-detected message that revokes the server/served relationship with the current server node.
Inventors
- 👤 Sandra L. Benedict
- 👤 Jeffery L. Crume
- 👤 Steven M. Golberg
- 👤 Robert L. Nielsen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 06:19
CPC Classifications
H; H04; H04L; H04L41/00; H04L41/12
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
240 words
For use in computer network including a plurality of interconnected nodes wherein at least some of said nodes are server nodes capable of providing network management services to other nodes called served nodes, wherein a relationship between a server node and a served node may be established at the request of either node and wherein a node may concurrently act as a server node for other served nodes and as a served node of another server node, loop-detection means at a given node for detecting a closed loop among nodes which have requested server/served relationships with adjacent nodes, said loop-detection means comprising: means for producing a predetermined indicator when the given node is to be served by a new server node; means responsive to the existence of the predetermined indicator for creating a loop-detection message including the name of the given node; means for forwarding the created loop-detection message to said new server node; means for receiving loop-detection messages provided by other nodes for whom the given node is itself a server node; means for examining each received loop-detection message for names of nodes; and means responsive to the presence of the given node name in a received loop-detection message to generate a loop-detected message and to the absence of the given node's name in a received loop-detection message to alter the message to include the given node name and to forward the altered message to said new server node.
Claim 2
Dependent Claim
240 words
For use in computer network including a plurality of interconnected nodes wherein at least some of said nodes are server nodes capable of providing network management services to other nodes called served nodes, wherein a relationship between a server node and a served node may be established at the request of either node and wherein a node may concurrently act as a server node for other served nodes and as a served node of another server node, loop-detection means at a given node for detecting a closed loop among nodes which have requested server/served relationships with adjacent nodes, said loop-detection means comprising: means for producing a predetermined indicator when the given node is to be served by a new server node; means responsive to the existence of the predetermined indicator for creating a loop-detection message including the name of the given node; means for forwarding the created loop-detection message to said new server node; means for receiving loop-detection messages provided by other nodes for whom the given node is itself a server node; means for examining each received loop-detection message for names of nodes; and means responsive to the presence of the given node name in a received loop-detection message to generate a loop-detected message and to the absence of the given node's name in a received loop-detection message to alter the message to include the given node name and to forward the altered message to said new server node.
Claim 3
Dependent Claim
50 words
A loop-detection means as defined in claim 1 further including means resonsive to the first-named means for determining whether the given node is itself a server node for other nodes in the network and wherein said message creating means becomes operable only if the given node is a server node.
Claim 4
Dependent Claim
34 words
Loop-detection means as defined in claim 2 further including means for forwarding the loop-detected message to the server node for the given node in order to revoke the server/served relationship, thereby opening the loop.
Claim 5
Dependent Claim
38 words
Loop-detection means as defined in either of claims 2 or 3 wherein the loop-detection message is altered by the means responsive to the presence of the given node name by appending the given node's name to the message.
Claim 6
Dependent Claim
228 words
For use in a computer network including a plurality of interconnected nodes wherein at least some of said nodes are server nodes capable of providing network management services to other nodes called served nodes, wherein a relationship between a server node and a served node may be established at the request of either node and wherein a node may concurrently act as a server node for other served nodes and as a served node of another server node, a method of detecting a closed loop among nodes that have requested server/served relationships with adjacent nodes, said method being practiced at a given node and comprising the steps of: detecting the existence of a new server-served relationship in which the given node receives services from a given server node; responding to detection of the new server-served relationship by creating a loop-detection message including the given node's name; forwarding the created loop-detection message to the given server node; receiving loop-detection messages from other nodes for whom the given node is a server node; responding to the presence of the given node's name in a received loop-detection message to generate a loop-detected message; and responding to the absence of the given node's name in a received loop-detection message to add the given node name to the message and to forward the loop-detection message to a server node for the given node.
Claim 7
Dependent Claim
228 words
For use in a computer network including a plurality of interconnected nodes wherein at least some of said nodes are server nodes capable of providing network management services to other nodes called served nodes, wherein a relationship between a server node and a served node may be established at the request of either node and wherein a node may concurrently act as a server node for other served nodes and as a served node of another server node, a method of detecting a closed loop among nodes that have requested server/served relationships with adjacent nodes, said method being practiced at a given node and comprising the steps of: detecting the existence of a new server-served relationship in which the given node receives services from a given server node; responding to detection of the new server-served relationship by creating a loop-detection message including the given node's name; forwarding the created loop-detection message to the given server node; receiving loop-detection messages from other nodes for whom the given node is a server node; responding to the presence of the given node's name in a received loop-detection message to generate a loop-detected message; and responding to the absence of the given node's name in a received loop-detection message to add the given node name to the message and to forward the loop-detection message to a server node for the given node.
Claim 8
Dependent Claim
32 words
A method as defined in claim 5 including the further step of responding to a loop-detected message received from a served node to revoke the server/served relationship, thereby opening a closed loop.
Claim 9
Dependent Claim
181 words
For use in a computer network including a plurality of interconnected nodes wherein at least some of said nodes are server nodes capable of providing network management services to other nodes called served nodes, wherein a relationship between a server node and a served node may be established at the request of either node and wherein a node may concurrently act as a server node for other served nodes and as a served node of another server node, a system for revoking an authorized server/served relationship that would result in a closed loop of nodes having such relationships, said system existing at a given node served by a server node and comprising: first means for generating loop-detection messages and for forwarding said generated loop-detection messages to adjacent server nodes; second means for examining received loop-detection messages for the presence of the given node's own name in a received loop-detection message; and third means responsive to the presence of the given node's own name in a received loop-detection message to revoke a server-served relationship between the given node and its server node.
Claim 10
Dependent Claim
181 words
For use in a computer network including a plurality of interconnected nodes wherein at least some of said nodes are server nodes capable of providing network management services to other nodes called served nodes, wherein a relationship between a server node and a served node may be established at the request of either node and wherein a node may concurrently act as a server node for other served nodes and as a served node of another server node, a system for revoking an authorized server/served relationship that would result in a closed loop of nodes having such relationships, said system existing at a given node served by a server node and comprising: first means for generating loop-detection messages and for forwarding said generated loop-detection messages to adjacent server nodes; second means for examining received loop-detection messages for the presence of the given node's own name in a received loop-detection message; and third means responsive to the presence of the given node's own name in a received loop-detection message to revoke a server-served relationship between the given node and its server node.
Claim 11
Dependent Claim
29 words
A system as defined in claim 7 wherein said third means operates only to revoke a server/served relationship for a particular service defined in the received loop detection message.
References Cited (Backward Citations)
US4736363A
Cited
US4825206A
Cited
US4748658A
Cited
US5049873A
Cited
US4995035A
Cited
US5014262A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-06-13 | 1997-12-13 | 1998-06-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-06-13 | 2001-12-13 | 2002-06-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-06-13 | 2005-12-13 | 2006-06-14 | $7700.00 | Window Closed / Lapsed |