US5371897A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for requesting identification of a neighbor node in a data processing I/O system
Assignee: International Business Machines Corp
•
Filing: 1991-08-27
•
Granted: 1994-12-06
•
Expires: 2011-08-27
Abstract
Abstract A method for acquiring the node identifier of a node in a data processing input/output (I/O) system having a plurality of nodes. This procedure is part of the initialization of each node in the I/O system and may be used to establish the configuration of the I/O system such that if a connection breaks or a fault occurs between nodes, the configuration can be confirmed after the break or fault is corrected. This prevents data from being sent to the wrong device if lines were connected in a different configuration during the correction of a fault. The node identifier is a worldwide-unique identifier such that only one node is identified by a node identifier. The node identifier contains a validity code that specifies if the node identifier is valid. Also disclosed is a retry procedure for retrying the acquisition of a node identifier if the acquired node identifier is not valid, and a deferral procedure which defers the retry procedure if a link is not available.
Inventors
- 👤 Paul J. Brown
- 👤 Kenneth J. Fredericks, Sr.
- 👤 Eugene P. Hefferon
- 👤 Gerald T. Moffitt
- 👤 Allan S. Meritt
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 01:44
CPC Classifications
H; H04; H04L; H04L69/00
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
239 words
In a computer system having a plurality of communicating nodes in a network of communicating nodes, in which each of said communicating node has a unique identifier which does not change if a node location is later changed in the network, the method comprising the steps of: communicating by any node with not more than one neighboring node at a time in a selected transmission direction without requiring an identifier of the neighboring node for requesting the identifier of the neighboring node; sending by a requesting node of a request-identifier frame to the one neighboring node in the selected transmission direction within the network of communication nodes; transmitting by the neighboring node of an identifier-response frame to said requesting node in response to the sending step, said identifier-response frame including a validity code for indicating if the identifier-response frame contains a valid identifier of the neighboring node; returning by the neighboring node of a not-available-indicator value in a valid field of the identifier-response frame if a previously established identifier for the neighboring node is not available to the neighboring node, returning by the neighboring node of an available-indicator value in the valid field if the identifier of the neighboring node is available to the neighboring node; repeating the sending step by the requesting node if said not-available-indicator value in the identifier-response frame is received by the requesting node; and suspending the sending step when the repeating step is unsuccessful.
Claim 2
Dependent Claim
239 words
In a computer system having a plurality of communicating nodes in a network of communicating nodes, in which each of said communicating node has a unique identifier which does not change if a node location is later changed in the network, the method comprising the steps of: communicating by any node with not more than one neighboring node at a time in a selected transmission direction without requiring an identifier of the neighboring node for requesting the identifier of the neighboring node; sending by a requesting node of a request-identifier frame to the one neighboring node in the selected transmission direction within the network of communication nodes; transmitting by the neighboring node of an identifier-response frame to said requesting node in response to the sending step, said identifier-response frame including a validity code for indicating if the identifier-response frame contains a valid identifier of the neighboring node; returning by the neighboring node of a not-available-indicator value in a valid field of the identifier-response frame if a previously established identifier for the neighboring node is not available to the neighboring node, returning by the neighboring node of an available-indicator value in the valid field if the identifier of the neighboring node is available to the neighboring node; repeating the sending step by the requesting node if said not-available-indicator value in the identifier-response frame is received by the requesting node; and suspending the sending step when the repeating step is unsuccessful.
Claim 3
Dependent Claim
94 words
The method of claim 1 in which said request-identifier frame contains: a destination address field which need not contain any neighboring node address or identifier, and a source address field which contains an identifier of said requesting node; said identifier-response frame contains: a destination field which contains an address of said requesting node and a source field which contains any address or identifier available to the neighboring node; and said sending and transmitting steps respectively including information for routine said request-identifier frame and said identifier-response frame between the requesting node and the neighboring node.
Claim 4
Dependent Claim
42 words
The method of claim 1 further comprising the steps of testing a link between said requesting node and said neighboring node; and repeating the sending step if said link is operational and deferring the repeating step if said link is not operational.
Claim 5
Dependent Claim
47 words
The method defined in claim 1 further comprising step of: initializing a network in an input/output system of a computer system; assigning an identifying address to each of said communicating node which is one of: a central processing unit, an input/output unit switch, and a control unit.
Claim 6
Dependent Claim
19 words
The method of claim 1 wherein sending the identifier of said neighboring node includes sending a worldwide unique identifier.
Claim 7
Dependent Claim
23 words
The method of claim 5 wherein said worldwide unique identifier includes an identification of a self describing product that determines said neighboring node.
Claim 8
Dependent Claim
17 words
The method of claim 6 wherein said worldwide unique identifier includes a field which identifies a product.
Claim 9
Dependent Claim
28 words
The method of claim 7 wherein said identification includes a serial-number field that contains information provided on a serial-number plate attached to an external surface of the product.
Claim 10
Dependent Claim
27 words
The method of claim 8 wherein said worldwide unique identifier includes an interface tag that uniquely identifies a physical location of an interface associated with said product.
References Cited (Backward Citations)
US3693161A
Cited
US4360870A
Cited
US4399531A
Cited
US4646235A
Cited
US4589063A
Cited
US4677588A
Cited
US4638313A
Cited
US5003508A
Cited
US4912461A
Cited
US4941089A
Cited
EP0281534A2
Cited
US4953072A
Cited
US4939728A
Cited
US5042027A
Cited
US5048014A
Cited
US5175765A
Cited
US4939726A
Cited
US5107489A
Cited
US5206860A
Cited
EP0474373A2
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 |