US5590124A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Link and discovery protocol for a ring interconnect architecture
Assignee: Apple Inc
•
Filing: 1995-06-07
•
Granted: 1996-12-31
•
Expires: 2015-06-07
Abstract
Abstract A protocol for use in a system including a first node, a second node and, in some instances, a third node, each of the first, second and third nodes coupled to each other of the first, second and third nodes by a point to point packet-based communication system defines transactions for transferring variable amounts of data from one node to another. A GET transaction allows an instigator node to send a packet to a partner node. The packet specifies data length, and an address in the partner node's resource. A PUT transaction similarly allows an instigator node to send a packet specifying a response port identifier, a data length and an address in a partner node's resource to which data is to be written. A PROXY transaction is disclosed which allows an instigator node to cause a source partner node to send data to a target (destination) partner node. Other transactions are also disclosed. In each instance, port identifiers accompany packets in order to associate received data with a particular transaction. A discovery protocol allows an instigator node to use the data transfer protocol to determine the topology of the ring architecture to which it is coupled.
Inventors
- 👤 Nicholas Robins
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 00:43
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04L12/00; H04L12/28; H04L12/42; H04L12/46; H04L12/4637; H04L9/00; H04L9/40
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
724 words
A method for ascertaining topology of a packet communication system having a ring interconnect architecture, the ring interconnect architecture comprising at least one ring, each ring comprising at least one node, each of said at least one node being selected from the group consisting of leaf nodes and bridge nodes, wherein each leaf node has a node identifier not shared by any other node on a same ring and a readable data source at a known address, and each bridge node is uniquely associated with a far side bridge node coupled to a far side ring, and wherein a packet received by a bridge node is delivered to the associated far side bridge node for placement on the far side ring only if the packet does not designate the bridge node as a final destination, and wherein a packet which designates a bridge node as a final destination is discarded by the designated bridge node, the method comprising the steps of: sending a packet from an instigator node to a first known node on a first ring, the packet being encoded to solicit a first unique identifier stored at the first known node; at the instigator node, receiving a packet containing the first unique identifier; sending a packet from the instigator node to the first known node, the packet being encoded to solicit node identifiers of all nodes on the first ring; at the instigator node, receiving a packet containing the solicited node identifiers of all nodes on the first ring; using the node identifiers of all nodes on the first ring to send a packet from the instigator node to each node on the first ring, wherein the packet is encoded to solicit data from the readable data source of a partner node, and wherein when a partner node sends the solicited data to the instigator node, the solicited data is accompanied by a partner node identifier; waiting for solicited data to return; if solicited data is received by the instigator node from a responding node, then identifying the responding node having the accompanying partner node identifier as a first ring leaf node in the first ring; if solicited data is not received from a nonresponding node within a predetermined time period, then identifying the nonresponding node as a first ring bridge node in the first ring, the first ring bridge node being associated with a far side bridge node in a second ring; for each identified first ring bridge node, sending a packet from the instigator node through the identified first ring bridge node to a second known node on the second ring, the packet being encoded to solicit identifiers of all nodes on the second ring; at the instigator node, receiving a packet containing the solicited node identifiers of all nodes on the second ring; for each identified first ring bridge node, sending a second packet from the instigator node through the identified first ring bridge node to each node on the second ring, wherein the second packet is encoded to solicit data from the readable data source of a partner node, and wherein when a partner node sends the solicited data to the instigator node, the solicited data is accompanied by a partner node identifier; waiting for solicited data to return; if solicited data is received by the instigator node from a responding node, then identifying the responding node having the accompanying partner node identifier as a second ring leaf node in the second ring; if solicited data is not received from a nonresponding node within a predetermined time period, then identifying the nonresponding node as a second ring bridge node in the second ring, the second ring bridge node being associated with a far side bridge node in a third ring; for each identified second ring bridge node, sending a packet from the instigator node through the identified second ring bridge node to a third known node on the third ring, the packet being encoded to solicit a third unique identifier stored at the third node; at the instigator node, receiving a packet containing the solicited third unique identifier; and at the instigator node, determining whether the second ring bridge node is the associated far side bridge node of the first ring bridge node by determining that the first unique identifier is the same as the third unique identifier.
Claim 2
Independent Claim
724 words
A method for ascertaining topology of a packet communication system having a ring interconnect architecture, the ring interconnect architecture comprising at least one ring, each ring comprising at least one node, each of said at least one node being selected from the group consisting of leaf nodes and bridge nodes, wherein each leaf node has a node identifier not shared by any other node on a same ring and a readable data source at a known address, and each bridge node is uniquely associated with a far side bridge node coupled to a far side ring, and wherein a packet received by a bridge node is delivered to the associated far side bridge node for placement on the far side ring only if the packet does not designate the bridge node as a final destination, and wherein a packet which designates a bridge node as a final destination is discarded by the designated bridge node, the method comprising the steps of: sending a packet from an instigator node to a first known node on a first ring, the packet being encoded to solicit a first unique identifier stored at the first known node; at the instigator node, receiving a packet containing the first unique identifier; sending a packet from the instigator node to the first known node, the packet being encoded to solicit node identifiers of all nodes on the first ring; at the instigator node, receiving a packet containing the solicited node identifiers of all nodes on the first ring; using the node identifiers of all nodes on the first ring to send a packet from the instigator node to each node on the first ring, wherein the packet is encoded to solicit data from the readable data source of a partner node, and wherein when a partner node sends the solicited data to the instigator node, the solicited data is accompanied by a partner node identifier; waiting for solicited data to return; if solicited data is received by the instigator node from a responding node, then identifying the responding node having the accompanying partner node identifier as a first ring leaf node in the first ring; if solicited data is not received from a nonresponding node within a predetermined time period, then identifying the nonresponding node as a first ring bridge node in the first ring, the first ring bridge node being associated with a far side bridge node in a second ring; for each identified first ring bridge node, sending a packet from the instigator node through the identified first ring bridge node to a second known node on the second ring, the packet being encoded to solicit identifiers of all nodes on the second ring; at the instigator node, receiving a packet containing the solicited node identifiers of all nodes on the second ring; for each identified first ring bridge node, sending a second packet from the instigator node through the identified first ring bridge node to each node on the second ring, wherein the second packet is encoded to solicit data from the readable data source of a partner node, and wherein when a partner node sends the solicited data to the instigator node, the solicited data is accompanied by a partner node identifier; waiting for solicited data to return; if solicited data is received by the instigator node from a responding node, then identifying the responding node having the accompanying partner node identifier as a second ring leaf node in the second ring; if solicited data is not received from a nonresponding node within a predetermined time period, then identifying the nonresponding node as a second ring bridge node in the second ring, the second ring bridge node being associated with a far side bridge node in a third ring; for each identified second ring bridge node, sending a packet from the instigator node through the identified second ring bridge node to a third known node on the third ring, the packet being encoded to solicit a third unique identifier stored at the third node; at the instigator node, receiving a packet containing the solicited third unique identifier; and at the instigator node, determining whether the second ring bridge node is the associated far side bridge node of the first ring bridge node by determining that the first unique identifier is the same as the third unique identifier.
Claim 3
Dependent Claim
714 words
In a packet communication system having a ring interconnect architecture, the ring interconnect architecture comprising at least one ring, each ring comprising at least one node, each of said at least one node being selected from the group consisting of leaf nodes and bridge nodes, wherein each leaf node has a node identifier not shared by any other node on a same ring and a readable data source at a known address, and each bridge node is uniquely associated with a far side bridge node coupled to a far side ring, and wherein a packet received by a bridge node is delivered to the associated far side bridge node for placement on the far side ring only if the packet does not designate the bridge node as a final destination, and wherein a packet which designates a bridge node as a final destination is discarded by the designated bridge node, an apparatus located in an instigator node for ascertaining topology of the packet communication system, the apparatus comprising: means for sending a packet from the instigator node to a first known node on a first ring, the packet being encoded to solicit a first unique identifier stored at the first known node; means for receiving a packet containing the first unique identifier; means for sending a packet from an instigator node to the first known node, the packet being encoded to solicit node identifiers of all nodes on the first ring; means for receiving a packet containing the solicited node identifiers of all nodes on the first ring; means for using the node identifiers of all nodes on the first ring to send a packet from the instigator node to each node on the first ring, wherein the packet is encoded to solicit data from the readable data source of a partner node, and wherein when a partner node sends the solicited data to the instigator node, the solicited data is accompanied by a partner node identifier; means for waiting for solicited data to return; means, responsive to receipt of solicited data from a responding node, for identifying the responding node having the accompanying partner node identifier as a first ring leaf node in the first ring; means, responsive to not receiving solicited data from a nonresponding node within a predetermined time period, for identifying the nonresponding node as a first ring bridge node in the first ring, the first ring bridge node being associated with a far side bridge node in a second ring; means for sending a packet from the instigator node through an identified first ring bridge node to a second known node on the second ring, the packet being encoded to solicit identifiers of all nodes on the second ring; means for receiving a packet containing the solicited node identifiers of all nodes on the second ring; means for sending a second packet from the instigator node through an identified first ring bridge node to each node on the second ring, wherein the second packet is encoded to solicit data from the readable data source of a partner node, and wherein when a partner node sends the solicited data to the instigator node, the solicited data is accompanied by a partner node identifier; means for waiting for solicited data to return; means, responsive to receipt of solicited data from a responding node, for identifying the responding node having the accompanying partner node identifier as a second ring leaf node in the second ring; means, responsive to not receiving solicited data from a nonresponding node within a predetermined time period, for identifying the nonresponding node as a second ring bridge node in the second ring, the second ring bridge node being associated with a far side bridge node in a third ring; means for sending a packet from the instigator node through an identified second ring bridge node to a third known node on the third ring, the packet being encoded to solicit a third unique identifier stored at the third node; means for receiving a packet containing the solicited third unique identifier; and means for determining whether the second ring bridge node is the associated far side bridge node of the first ring bridge node by determining that the first unique identifier is the same as the third unique identifier.
Claim 4
Dependent Claim
714 words
In a packet communication system having a ring interconnect architecture, the ring interconnect architecture comprising at least one ring, each ring comprising at least one node, each of said at least one node being selected from the group consisting of leaf nodes and bridge nodes, wherein each leaf node has a node identifier not shared by any other node on a same ring and a readable data source at a known address, and each bridge node is uniquely associated with a far side bridge node coupled to a far side ring, and wherein a packet received by a bridge node is delivered to the associated far side bridge node for placement on the far side ring only if the packet does not designate the bridge node as a final destination, and wherein a packet which designates a bridge node as a final destination is discarded by the designated bridge node, an apparatus located in an instigator node for ascertaining topology of the packet communication system, the apparatus comprising: means for sending a packet from the instigator node to a first known node on a first ring, the packet being encoded to solicit a first unique identifier stored at the first known node; means for receiving a packet containing the first unique identifier; means for sending a packet from an instigator node to the first known node, the packet being encoded to solicit node identifiers of all nodes on the first ring; means for receiving a packet containing the solicited node identifiers of all nodes on the first ring; means for using the node identifiers of all nodes on the first ring to send a packet from the instigator node to each node on the first ring, wherein the packet is encoded to solicit data from the readable data source of a partner node, and wherein when a partner node sends the solicited data to the instigator node, the solicited data is accompanied by a partner node identifier; means for waiting for solicited data to return; means, responsive to receipt of solicited data from a responding node, for identifying the responding node having the accompanying partner node identifier as a first ring leaf node in the first ring; means, responsive to not receiving solicited data from a nonresponding node within a predetermined time period, for identifying the nonresponding node as a first ring bridge node in the first ring, the first ring bridge node being associated with a far side bridge node in a second ring; means for sending a packet from the instigator node through an identified first ring bridge node to a second known node on the second ring, the packet being encoded to solicit identifiers of all nodes on the second ring; means for receiving a packet containing the solicited node identifiers of all nodes on the second ring; means for sending a second packet from the instigator node through an identified first ring bridge node to each node on the second ring, wherein the second packet is encoded to solicit data from the readable data source of a partner node, and wherein when a partner node sends the solicited data to the instigator node, the solicited data is accompanied by a partner node identifier; means for waiting for solicited data to return; means, responsive to receipt of solicited data from a responding node, for identifying the responding node having the accompanying partner node identifier as a second ring leaf node in the second ring; means, responsive to not receiving solicited data from a nonresponding node within a predetermined time period, for identifying the nonresponding node as a second ring bridge node in the second ring, the second ring bridge node being associated with a far side bridge node in a third ring; means for sending a packet from the instigator node through an identified second ring bridge node to a third known node on the third ring, the packet being encoded to solicit a third unique identifier stored at the third node; means for receiving a packet containing the solicited third unique identifier; and means for determining whether the second ring bridge node is the associated far side bridge node of the first ring bridge node by determining that the first unique identifier is the same as the third unique identifier.
References Cited (Backward Citations)
US5119481A
Cited
US5315582A
Cited
US5307346A
Cited
US5165024A
Cited
US5165019A
Cited
US5237567A
Cited
US5241682A
Cited
US5400333A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-12-31 | 2000-07-01 | 2000-12-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-12-31 | 2004-07-01 | 2004-12-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-12-31 | 2008-07-01 | 2008-12-31 | $7700.00 | Window Closed / Lapsed |