US4747100A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Token passing network utilizing active node table
Assignee: Allen Bradley Co LLC
•
Filing: 1986-08-11
•
Granted: 1988-05-24
•
Expires: 2006-08-11
Abstract
Abstract A programmable controller is adapted to communicate in a token passing logical ring network in a peer-to-peer fashion. The programmable controller is a station on the network and contains an interface which implements the network protocol. The protocol requires that each station maintain an Active Node Table which stores a complete map of the logical ring and the order in which the token is passed. The Active Node Table is automatically updated by monitoring each token pass on the network, where each token pass identifies the source and destination of the token pass. The Active Node Table is used in performing all routine network maintenance functions, including passing the token, adding stations, and dropping stations. The Active Node Table allows the formation of an Active Node Status Word for use by high level processes within the station. The Active Node Table also facilitates the inclusion of data in the token pass message.
Inventors
- 👤 J. Monte Roach
- 👤 Lester A. Jones
- 👤 Wayne C. Van Sickle
- 👤 Ronald E. Schultz
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 07:47
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/40; H04L12/407; H04L12/417
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
174 words
A method for operating a station on a token passing logical ring network, the station including a memory for storing data for use by the station, the method comprising the steps of: (a) receiving messages from the network, said messages containing information fields identifying the source, the destination, and the type of the message; (b) decoding the type of the message from said type information field; (c) establishing an Active Node Table in said memory by repeating steps (a) and (b) for every message on the network, and if the type of the message as decoded in steb (b) is a token pass, then storing the source and destination information from every such token pass message in the Active Node Table to indicate that both the source and the destination are in the logical ring and that the destination follows the source in the sequence of passing the token, thereby updating the Active Node Table with the identity of every station in the logical ring and the sequence in which the token is passed.
Claim 2
Independent Claim
174 words
A method for operating a station on a token passing logical ring network, the station including a memory for storing data for use by the station, the method comprising the steps of: (a) receiving messages from the network, said messages containing information fields identifying the source, the destination, and the type of the message; (b) decoding the type of the message from said type information field; (c) establishing an Active Node Table in said memory by repeating steps (a) and (b) for every message on the network, and if the type of the message as decoded in steb (b) is a token pass, then storing the source and destination information from every such token pass message in the Active Node Table to indicate that both the source and the destination are in the logical ring and that the destination follows the source in the sequence of passing the token, thereby updating the Active Node Table with the identity of every station in the logical ring and the sequence in which the token is passed.
Claim 3
Dependent Claim
62 words
The method of claim 1 in which if the destination of the token pass message in step (c) is said station, then the station assumes possession of the token and further performs the steps of: (e) looking up in the Active Node Table the next destination in said token passing sequence; and (f) sending a token pass message to the next destination.
Claim 4
Dependent Claim
59 words
The method of claim 2 in which if the next destination fails to accept the token, then the station further performs the steps of: (g) modifying the token passing sequence by deleting the destination failing to accept the token from the Active Node Table; and (h) repeating the step of (e) and (f) using the modified token passing sequence.
Claim 5
Dependent Claim
36 words
The method of claim 3 in which the steps (g) of modifying the token passing sequence and (h) repeating the steps (e) and (f) are repeated iteratively for each destination that fails to accept the token.
Claim 6
Independent Claim
77 words
The method of claims 2, 3, or 4 in which during said possession of the token and before steps (e) and (f) the station further performs the steps of: (i) sending a solicit message to solicit for another station waiting to join the logical ring; and (j) if the other station responds to the solicit message, then adding the other station to the Active Node Table as being next in the token passing sequence after the station.
Claim 7
Dependent Claim
91 words
The method of claim 1 in which the station is on the network and waiting to join the logical ring and the type of message as decoded in step (b) is a solicit message addressed to said station, said solicit message containing an information field identifying a current successor, the station further performing the steps of: (k) updating the Active Node Table to indicate the current successor as being next in the token passing sequence after the station; and (l) sending an acknowledge message to the source of the solicit message.
Claim 8
Dependent Claim
56 words
The method of claim 1, 2, or 4 further comprising the step of: (m) forming an Active Node Status Word based on the information in the Active Node Table, said Active Node Status Word indicating the identity of each station active in the logical ring without regard to the order in which the token is passed.
Claim 9
Independent Claim
55 words
The method of claims 1, 2 or 4 in which the token pass message includes a data field , and further comprises the step of; (n) storing the data field from every token pass message in the memory at a location corresponding to the source of the token pass message, thereby forming a data table.
Claim 10
Dependent Claim
155 words
A station for a token passing logical ring network having a plurality of such stations interconnected by a broadcast communications media, the station comprising: sending means for transmitting an output message on the network; receiving means for receiving an input message from the network; processor means coupled to the sending means and receiving means for processing the input and output messages, said processor means including: decoding means for determining the type of the input message; memory means for storing the input and output messages, said memory means including an Active Node Table (ANT) which contains data indicating both the identity of each of said plurality of stations currently in the logical ring and the order in which the token is passed; ANT updating means coupled to the decoding means and the memory means for updating the ANT in response to an indication from the decoding means that the input message was a token pass message.
Claim 11
Dependent Claim
155 words
A station for a token passing logical ring network having a plurality of such stations interconnected by a broadcast communications media, the station comprising: sending means for transmitting an output message on the network; receiving means for receiving an input message from the network; processor means coupled to the sending means and receiving means for processing the input and output messages, said processor means including: decoding means for determining the type of the input message; memory means for storing the input and output messages, said memory means including an Active Node Table (ANT) which contains data indicating both the identity of each of said plurality of stations currently in the logical ring and the order in which the token is passed; ANT updating means coupled to the decoding means and the memory means for updating the ANT in response to an indication from the decoding means that the input message was a token pass message.
Claim 12
Dependent Claim
40 words
The station as recited in claim 9 wherein the processor means further includes means for generating an Active Node Status Word (ANSW) based on the information contained in the ANT to identify every station currently active in the logical ring.
Claim 13
Dependent Claim
56 words
The station as recited in claim 9 or 10 wherein the memory means further includes data table means and the processor means includes means for extracting data from a data field in the token pass message and storing the data in the data table at a location corresponding to the source of the token pass message.
Claim 14
Dependent Claim
103 words
The station as recited in claim 9 wherein the processor means further includes token using means for exercising control over the media, said token using means being activated in response to an indication from the decoding means that the input message was a token pass addressed to this station, wherein said token using means passes the token by looking up in the ANT the identity of the next station in the logical ring after this station and sending a token pass message to said next station, whereby the token using means of this station is deactivated upon acceptance of the token pass message.
Claim 15
Dependent Claim
105 words
The station as recited in claim 12 wherein if the token pass message to the next station is not accepted, then the token using means retries sending the token pass message until the token pass message is accepted up to a predetermined maximum number of retries, wherein if the next station still fails to accept the token pass message after the maximum number of retries, then the token using means deletes the next station from the ANT of this station and looks up in the ANT the identity of a new next station following the deleted station to be used in subsequent token pass attempts.
Claim 16
Dependent Claim
67 words
The station as recited in claim 12 or 13 in which the token using means further includes soliciting means for soliciting stations waiting to join the logical ring, wherein the soliciting means sends a solicit message and if the station waiting to join the logical ring responds to the solicit message, the soliciting means adds the identity of the waiting station to the ANT of this station.
Claim 17
Independent Claim
132 words
A method for operating a station on a token passing logical ring network, the station including a memory for storing data for use by the station, the method comprsing the steps of: (a) receiving messages from the network, said messages containing information fields identifying the source, the destination, and the type of the message; (b) decoding the type of the message from said type information field; (c) establishing a data table in said memory by repeating steps (a) and (b) for every message on the network, and if the type of the message as decoded in step (b) is a token pass, then extracting a data field from the token pass message and storing the daat field in the memory at a location corresponding to the source of the token pass message.
Claim 18
Independent Claim
132 words
A method for operating a station on a token passing logical ring network, the station including a memory for storing data for use by the station, the method comprsing the steps of: (a) receiving messages from the network, said messages containing information fields identifying the source, the destination, and the type of the message; (b) decoding the type of the message from said type information field; (c) establishing a data table in said memory by repeating steps (a) and (b) for every message on the network, and if the type of the message as decoded in step (b) is a token pass, then extracting a data field from the token pass message and storing the daat field in the memory at a location corresponding to the source of the token pass message.
References Cited (Backward Citations)
US4491946A
Cited
US4506360A
Cited
US4583088A
Cited
US4556974A
Cited
US4649535A
Cited
US4667323A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-05-24 | 1991-11-23 | 1992-05-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-05-24 | 1995-11-23 | 1996-05-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-05-24 | 1999-11-23 | 2000-05-24 | $7700.00 | Window Closed / Lapsed |