Priority token protocol circuit for a token ring local area network adaptor

• US 4,736,368 A
• Filed: 12/16/1985
• Issued: 04/05/1988
• Est. Priority Date: 12/16/1985
• Status: Expired due to Term

• Current Assignee: Texas Instruments, Inc.
• Original Assignee: Texas Instruments, Inc.
• Inventors: Szczepanek, Andre
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): Scutch, III, Frank M.
• Application Number:
  US06/809,625
• Time in Patent Office: 841 Days
• Field of Search: 370/86, 370/89, 370/90, 340/825.05, 340/825.5
• US Class Current: 370/455
• CPC Class Codes: H04L 12/433 with asynchronous transmission, e.g. token ring, register insertion

Abstract

A fairness protocol circuit for a token ring local area network adaptor having a data-in line for serially carrying tokens/frames and a shift register delay of at least 18 bauds with an input coupled to the data-in line. A TTT stack is coupled to the shift register delay for serially storing values of old token indicators. An III stack is provided for serially storing values of new token priority indicators. TTT means is coupled to the TTT stack for temporarily storing a last old token placed on the TTT stack and serially outputting its bits. The stacks shift up or down bit by bit in response to UNSTACK or STACK control signals and are cleared in response to a clear signal. III means is coupled to the III stack for outputting bit by bit the value of a last new token priority idicator "I" stored on the III stack while at the same time maintaining the value of the last new token priority indicator on the III stack immediately following the outputtting and for replacing the last new token priority indicator stored with a reservation indicator "R" of the token and discarding the last new token priority indicator. Means are provided for comparing "P" and "I", "R" and "P" and "R" and "T". An output data modifier has inputs coupled to an output of the shift register delay, the TTT means, to a selected bit position of the shift delay and transmits a selected one of the inputs to the output in response to selected control signals applied thereto. Finally, a fairness state machine having inputs coupled to outputs of the comparing means and to an IEQZ output of the III stack is operative in response to selected combinations of its inputs to issue control signals to the stacks, the III means, the TTT means and the comparing means.

Claims

1. A fairness protocol circuit for a token ring local area network adaptor having a data-in line for serially carrying tokens/frames, comprising:

a shift register delay of at least 8 bauds with an input coupled to said data-in line;

a TTT stack coupled to said shift register for serially storing values of old token priority indicators;

an III stack for serially storing values of new token priority indicators;

TTT means coupled to said TTT stack for temporarily storing a last old token "T" placed onto said TTT stack and serially outputting its bits;

stack control means for shifting said III and TTT stacks up or down bit by bit or clearing said stacks in response to a stack control signal;

III means coupled to said III stack for outputting bit by bit the value of a last new token priority indicator "I" stored on said III stack while at the same time maintaining the value of said "I" on said III stack immediately following the outputting and for replacing said "I" with a reservation indicator "R" of the token and discarding said "I";

PvsI comparing means having inputs coupled to a second bit position of said shift register and to said III means and operative to provide outputs if the value of the last new token priority indicator "I" is less than or greater than the value of the token priority indicator "P";

RGTP comparing means having inputs coupled to said shift register first and sixth bit positions and operative to provide an output if the value of the token reservation "R" is greater than the token priority indicator "P";

RGTT comparing means having inputs coupled to said shift register first bit position and to said TTT means and operative to provide an output if the value of the token reservation "R" is greater than the value of the last old token priority indicator "T";

an input selector inputs of which are coupled to an output of said shift register, to said TTT means to the fourth bit position of said shift register and a select control signal which transmits a selected one of said input selector inputs to its output in response to the select control signal applied thereto; and

a state machine having inputs coupled to outputs of said PvsI, RGTP, RGTT comparing means and to said IEQZ output from said III stack and operative in response to selected combinations of its inputs to issue control signals to said stacks, said III means, said TTT means, and to said PvsI, RGTP, RGTT comparing means.

2. A circuit according to claim 1, wherein said TTT means is a 3 bit serial TTT register coupled to the first 3 bits of said TTT stack and operative to parallel transfer the first 3 bits of said TTT stack into said TTT register in response to a LOADIT signal applied thereto.

3. A circuit according to claim 1, wherein said III means is a 3 bit serial III register coupled to the first 3 bits of said III stack and operative to parallel transfer its 3 bits into the top 3 bit positions of said III stack in response to a LOADIT control signal and wherein said III stack transfers its top 3 bits into corresponding bit positions in said III register in response to a LOADIS control signal and said III register shifts its bits out an output end opposite an input end thereof bit by bit continuously except when being loaded from said III stack.

4. A circuit according to claim 1, including a multiplexer having an output coupled to an input of said III stack and an input coupled to said shift register delay wherein said III stack is separated into a 3 bit upper portion having the stack input and a lower portion and said III means is a circulating conducting line coupled to an output of said top portion and to another input of said multiplexer and said top portion shifts its bits bit by bit out of its output end and said multiplexer passes the shifted bits on said circulating line back to the input of said stack in response to a SHIFT control signal, and said stack shifts its bits down bit by bit in response to a STACK control signal and up bit by bit in response to an UNSTACK control signal all of said stack control signals being provided by said stack control means.

5. A circuit according to claim 2, wherein said shift register delay has 9 baud positions.

6. A circuit according to claim 5, wherein said output data modifier is a multiplexer having its said third input coupled to a fourth baud position of said shift register delay.

7. A circuit according to claim 6, wherein said PvsI, RGTP and RGTT comparing means are each serial magnitude comparators.

8. A circuit according to claim 7, wherein the first baud position of said shift register delay is coupled to an R input to said RGTP comparator and to an R input of said RGTT comparator, the second baud position is coupled to a P input of said PvsI comparator, and the ninth baud position is coupled to an input of said TTT stack.

9. A fairness protocol circuit for a token ring local area network adaptor having a data-in line for serially carrying tokens/frames, comprising:

a shift register delay of at least 8 bauds coupled to said data-in line;

a serial bidirectional shift register TTT stack coupled to said shift register delay for serially storing values of old token priority indicators;

a serial bidirectional shift register III stack for storing values of old token priority indicators;

a 3 baud TTT shift register coupled to said TTT stack so that a parallel transfer of data in the top 3 baud positions of said TTT stack can be made to said TTT shift register in response to a LOADIT control signal and so a serial shift of data out of said TTT register is in continuous progress except when transferring data from said TTT stack;

III retention means coupled to said III stack for outputting bit by bit the value of a last new token priority indicator "I" stored on said III stack while at the same time maintaining the value of said "I" on said III stack immediately following the outputting and for replacing said "I" with a reservation indicator "R" of the token and discarding said "I";

a PvsI comparator having inputs coupled to a second baud position of said shift register and to said III retention means and operative to provide outputs if the value of the last new token priority indicator "I" is less than or greater than the value of the token priority indicator "P";

an RGTP comparator having inputs coupled to said shift register first and sixth bit positions and operative to provide an output if the value of the token reservation "R" is greater than the token priority indicator "P";

an RGTT comparator having inputs coupled to said shift register delay first baud position and to said TTT means and operative to provide an output if the value of the token reservation "R" is greater than the value of the last old token priority indicator "T";

an output multiplexer having a first input coupled to an output of said shift register, a second input coupled to an output of said TTT retention means and a third input coupled to a fourth baud position of said shift register delay and operative to transmit a selected one of its inputs to its output in response to control signals applied thereto; and

a state machine having inputs coupled to outputs of said Pvs I, RGTP, RGTT comparators and to an IEQZ output from said III stack and operative in respone to selected combinations of its inputs to issue control signals to said stacks, said III means, said TTT means, and to said PvsI, RGTP, RGTT comparators.

10. A circuit according to claim 9, wherein said III means is a 3 baud serial III shift register coupled to the first 3 bauds of said III stack and operative to parallel transfer its 3 bits into the top 3 baud positions of said III stack in response to a LOADIT control signal and wherein said III stack transfers its top 3 bits into corresponding bit positions in said III register in response to a LOADIS control signal and said III register shifts its bits out an output end opposite an input end thereof bit by bit continuously except when being loaded from said III stack.

11. A circuit according to claim 9, including a multiplexer having an output coupled to an input of said III stack and an input coupled to said shift register delay wherein said III stack is separated into a 3 baud upper portion having the stack input and a lower portion and said III means is a circulating conducting line coupled to an output of said upper portion and to another input of said multiplexer and said upper portion shifts its bits bit by bit out of its output end and said multiplexer passes the shifted bits on said circulating line back to the input of said stack in response to a SHIFT control signal, and said stack shifts its bits down bit by bit in response to a STACK control signal and up bit by bit in response to an UNSTACK control signal.

12. A method of controlling fairness protocol on a token ring local area network system on which circulate from station to station tokens and frames having an access priority field which includes a 3 bit priority field, a token indicator bit, a monitor count bit and a 3 bit priority reservation field, comprising:

detecting the arrival of an incoming or internally generated token/frame;

comparing the priority indicator "P" of a token/frame arriving at a given station with a new priority indicator "I" of the last token whose priority was modified by that station;

comparing the value of the reservation of the token/frame "R" with the value of the old priority indicator "T" of the last token whose priority was modified by that station;

comparing the value of "R" to that of "P";

replacing "P" of the token/frame by "R" if "R" is greater than "P" and storing the value of "R" as "I" and the value of "P" as "T" and clearing the "R" and monitor count of the outgoing token/frame;

replacing the priority indicator "P" of the token by the value of "T" if "P" equals "I" and discarding the last stored values of "I" and "T" and clearing the monitor count;

replacing "P" of the token by "R" if "P" equals "I" and "R" is greater than "T" and substituting "R" for the last stored "I" value and clearing the reservation and monitor count of the token;

discarding the values of "I" and "T" if "P" is less than "I";

removing fairness from being active if the value of "I" "T" and Rare Zero.

13. A method according to claim 12, wherein said comparing steps include storing said tokens in a shift register delay with at least 8 baud and sampling selected bit positions to obtain values of "P" and "R".

14. A method according to claim 13, wherein said comparing steps include storing a new "P" value of a token whose priority indicator has been modified serially in a last in-first out III stack and a previous value of priority indicator before modification serially in a last in-first out TTT stack.

15. A method according to claim 13, wherein said "P" and "R" values are stored serially in corresponding III and TTT stacks with their most significant bits first and their least significant bits last.

16. A method according to claim 15, wherein said III stack has 10 stack bits and said TTT stack has 8 stack bits.

17. A method according to claim 14, including 3 bit III and TTT serial shift registers for temporarily storing the last stored "I" and "T" values and coupled to said III and TTT stacks, respectively, for parallel transfer of the last stored value in each of said III and TTT stacks into said III and TTT registers, respectively, and said III register coupled to said shift register delay for receiving "new" priority indicator values of modified tokens and operable to parallel transfer such values to a last in 3 bit position of said III stack.

18. A method according to claim 17, wherein said replacing steps include coupling an output of said shift register delay to obtain an unmodified priority indicator, an output of a selected bit position of said shift register delay to obtain concurrently a bit corresponding to said unmodified priority indicator bit and an output of said TTT register to obtain concurrently a bit corresponding to said unmodified priority indicator bit and selecting one of said outputs in response to SELECT control signals to transmit desired values in priority indicator, reservation and monitor count fields of a passing token.

19. A local area network system, comprising:

a token/frame conducting ring;

a plurality of host stations; and

a plurality of adaptors coupled between said ring and respective host stations for interfacing associated host stations to said ring, wherein each adaptor has a token/frame priority protocol circuit for reading priority protocol values of circulating tokens/frames, and in response to a comparison of such values with priority values stored therein, either re-transmitting such tokens/frames or copying such tokens/frames and generating and transmitting new tokens/frames onto said ring;

wherein said token or frame priority protocol circuit includes;

means for detecting the arrival of an incoming or internally generated token or frame;

means for comparing a priority indicator "P" of an arriving token/frame at a given station with a new priority indicator "I" of the last token whose priority was modified by that station;

means for comparing a reservation value "R" of a token/frame with the value of an old priority indicator "T" of the last token whose priority was modified by that station;

means for comparing the value of "R" to the value of "P";

means for replacing "P" of the token/frame by "R" if "R" is greater than "P" and storing the value of "R" as "I" and the value of "P" as "T" and clearing the "R" and monitor count of the outgoing token/frame;

means for replacing "P" of the token by the value of "T" if "P" equals "I" and discarding the last stored values of "I" and "T" and clearing the monitor count;

means for replacing "P" of the token by "R" if "P" equals "I" and "R" is greater than "T" and substituting "R" for the last stored "I" value and clearing the reservation and monitor count of the token;

discarding the values of "I" and "T" if "P" is less than "I"; and

means for inactivating fairness when the values of "I" and "T" are zero and "R"=0.

20. A system according to claim 19, wherein said detecting means includes a shift register for temporarily storing an incoming token.

21. A system according to claim 19, wherein said "P" versus "T", "R" versus "T" and "R" versus "P" comparing means are each comparators.

22. A system according to claim 19 wherein said means for replacing "P" and storing "R" and "P" as values of "I" and "T" are a pair of bidirection shift registers.