Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
122 words
A method for establishing full duplex operation between two stations in a token ring network, the method comprising the steps of: exchanging messages between the two stations to confirm that there are no other stations on the network and that the two stations agree to switch to full duplex mode; exchanging messages between the two stations to begin a transition to full duplex mode, including transmitting from at least one of the stations an agreed upon signal; and completing the transition to full duplex mode upon receipt and processing of the agreed upon signal in both stations, to complete the transition in both stations within a bounded time period, to minimize the possibility of return to token ring mode in either station.
Claim 2
Independent Claim
122 words
A method for establishing full duplex operation between two stations in a token ring network, the method comprising the steps of: exchanging messages between the two stations to confirm that there are no other stations on the network and that the two stations agree to switch to full duplex mode; exchanging messages between the two stations to begin a transition to full duplex mode, including transmitting from at least one of the stations an agreed upon signal; and completing the transition to full duplex mode upon receipt and processing of the agreed upon signal in both stations, to complete the transition in both stations within a bounded time period, to minimize the possibility of return to token ring mode in either station.
Claim 3
Dependent Claim
74 words
A method as defined in claim 1, and further comprising the steps of: continually checking, during and after the transition to full duplex mode, for the presence of conditions, including a condition indicating the presence of more than two stations on the network, which conditions dictate leaving full duplex mode; and leaving full duplex mode and entering token ring mode of operation upon detection of any of the conditions in the continually checking step.
Claim 4
Independent Claim
117 words
A method for establishing and maintaining full duplex operation between two stations in a token ring network, the method comprising the steps of: ascertaining, in each station in a token ring network, whether only two stations are active in the network, wherein the step of ascertaining whether only two stations are active includes determining an upstream neighbor address (hereinafter UNA), determining a downstream neighbor address (hereinafter DNA), and generating a two node indicator from the UNA and DNA values; if only two stations are active in the network, exchanging signals between the two stations to negotiate the establishment of full duplex communication; and effecting a transition to a full duplex mode of communication between the two stations.
Claim 5
Independent Claim
117 words
A method for establishing and maintaining full duplex operation between two stations in a token ring network, the method comprising the steps of: ascertaining, in each station in a token ring network, whether only two stations are active in the network, wherein the step of ascertaining whether only two stations are active includes determining an upstream neighbor address (hereinafter UNA), determining a downstream neighbor address (hereinafter DNA), and generating a two node indicator from the UNA and DNA values; if only two stations are active in the network, exchanging signals between the two stations to negotiate the establishment of full duplex communication; and effecting a transition to a full duplex mode of communication between the two stations.
Claim 6
Dependent Claim
90 words
A method as defined in claim 3, and further comprising the steps of: continually repeating in each station the step of ascertaining whether only two nodes are active, wherein the two node indicator is continually updated; continually checking, during and after the transition to full duplex mode, for the presence of conditions, including the condition of the two node indicator, which dictate leaving full duplex mode; and leaving full duplex mode and entering token ring mode of operation upon detection of any of the conditions in the continually checking step.
Claim 7
Dependent Claim
88 words
A method as defined in claim 3, wherein the step of ascertaining whether only two stations are active, further includes: comparing each determined UNA value with the previously determined UNA value; if the comparing step indicates that the UNA value has changed, validating the DNA value by requiring the determined DNA value to match the previously determined DNA value before generating a true two node indicator; and similarly validating a UNA value in the event that a determined DNA value does not match the previously determined DNA value.
Claim 8
Dependent Claim
82 words
A method as defined in claim 3, wherein the step of exchanging signals to negotiate the establishment of full duplex communication includes: transmitting a full duplex (hereinafter FDX) request frame; upon receipt of an FDX request frame, transmitting an FDX acknowledgment (hereinafter ACK) frame; upon receipt of an FDX ACK frame for the first time in a negotiation, transmitting an FDX ACK frame followed by a Restricted Token; and upon receipt of a Restricted Token, entering the full duplex mode of communication.
Claim 9
Dependent Claim
101 words
A method as defined in claim 3, wherein the transition to full duplex operation includes: an FDX Request state, during which each station performs the steps of transmitting an FDX request frame and waiting to receive an FDX request frame of an FDX ACK frame; an FDX Confirm state, during which each station performs the steps of transmitting an FDX ACK frame and a Restricted Token, and waiting to receive a Restricted Token; and an FDX Operation state, during which each station performs the steps of completing the transition to full duplex mode upon receipt of a mutually agreed upon signal.
Claim 10
Dependent Claim
17 words
A method as defined in claim 7, wherein the mutually agreed upon signal is a Restricted Token.
Claim 11
Dependent Claim
17 words
A method as defined in claim 7, wherein the mutually agreed upon signal is a special frame.
Claim 12
Dependent Claim
93 words
A method as defined in claim 7, and further comprising the steps of: continually repeating in each station the step of ascertaining whether only two nodes are active, wherein the two node indicator is continually updated; continually checking, during the FDX Request state, the FDX Confirm state and the FDX Operation state, for the presence of conditions, including the condition of the two node indicator, which dictate reverting to token ring mode; and reverting to the token ring mode of operation upon detection of any of the conditions in the continually checking step.
Claim 13
Dependent Claim
71 words
A method as defined in claim 3, wherein the step of determining a UNA value includes: periodically transmitting from each station a neighbor information frame containing the identity of the station transmitting the frame; receiving a neighbor information frame from an upstream neighbor station; determining from the content of the neighbor information frame whether the frame originated from the immediately upstream neighbor station; and, if so, identifying the immediately upstream neighbor.
Claim 14
Dependent Claim
63 words
A method as defined in claim 3, wherein the step of determining a DNA value includes: periodically transmitting a neighbor information frame (hereinafter NIF) request onto the token ring, with an included transaction identifier; receiving a NIF response having the same transaction identifier as in the NIF request; and identifying the nearest downstream neighbor from a source address contained in the NIF response.
Claim 15
Dependent Claim
127 words
Apparatus for establishing and maintaining full duplex operation between two stations in a token ring network, the apparatus comprising: means for ascertaining, in each station in a token ring network, whether only two stations are active in the network, wherein the means for ascertaining whether only two stations are active includes means for determining an upstream neighbor address (hereinafter UNA), means for determining a downstream neighbor address (hereinafter DNA), and means for generating a two node indicator from the UNA and DNA values; means fully operative if only two stations are active in the network, for exchanging signals between the two stations to negotiate the establishment of full duplex communication; and means for effecting a transition to a full duplex mode of communication between the two stations.
Claim 16
Dependent Claim
127 words
Apparatus for establishing and maintaining full duplex operation between two stations in a token ring network, the apparatus comprising: means for ascertaining, in each station in a token ring network, whether only two stations are active in the network, wherein the means for ascertaining whether only two stations are active includes means for determining an upstream neighbor address (hereinafter UNA), means for determining a downstream neighbor address (hereinafter DNA), and means for generating a two node indicator from the UNA and DNA values; means fully operative if only two stations are active in the network, for exchanging signals between the two stations to negotiate the establishment of full duplex communication; and means for effecting a transition to a full duplex mode of communication between the two stations.
Claim 17
Dependent Claim
91 words
Apparatus as defined in claim 13, and further comprising: means for continually initiating operation of the means for ascertaining whether only two nodes are active, wherein the two node indicator is continually updated; means for continually checking, during and after the transition to full duplex mode, for the presence of conditions, including the condition of the two node indicator, which dictate reverting to token ring mode; and means for initiating reversion to the token ring mode of operation upon detection of any of the conditions by the means for continually checking.
Claim 18
Dependent Claim
90 words
Apparatus as defined in claim 13, wherein the means for ascertaining whether only two stations are active, further includes: means for comparing each determined UNA value with the previously determined UNA value; means operative only if the UNA value has changed, for validating the DNA value by requiring the determined DNA value to match the previously determined DNA value before generating a true two node indicator; and similar means for validating a UNA value in the event that a determined DNA value does not match the previously determined DNA value.
Claim 19
Dependent Claim
92 words
Apparatus as defined in claim 13, wherein the means for exchanging signals to negotiate the establishment of full duplex communication includes: means for transmitting a full duplex (hereinafter FDX) request frame; means operative upon receipt of an FDX request frame, for transmitting an FDX acknowledgment (hereinafter ACK) frame; means operative upon receipt of an FDX ACK frame for the first time in a negotiation, for transmitting an FDX ACK frame followed by a Restricted Token; and means operative upon receipt of a Restricted Token, for entering the full duplex mode of communication.
Claim 20
Dependent Claim
105 words
Apparatus as defined in claim 13, wherein the transition to full duplex operation in each station includes: an FDX Request state, during which the station has active means for transmitting an FDX request frame and means for waiting to receive an FDX request frame of an FDX ACK frame; an FDX Confirm state, during which the station has active means for transmitting an FDX ACK frame and a Restricted Token, and means for waiting to receive a Restricted Token; and an FDX Operation state, during which each station has active means for completing the transition to full duplex mode upon receipt of a Restricted Token.
Claim 21
Dependent Claim
96 words
Apparatus as defined in claim 17, and further comprising: means for continually repeating in each station the step of ascertaining whether only two nodes are active, wherein the two node indicator is continually updated; means for continually checking, during the FDX Request state, the FDX Confirm state and the FDX Operation state, for the presence of conditions, including the condition of the two node indicator, which dictate reverting to token ring mode; and means for reverting to the token ring mode of operation upon detection of any of the conditions in the means for continually checking.
Claim 22
Dependent Claim
78 words
Apparatus as defined in claim 13, wherein the means for determining a UNA value includes: means for periodically transmitting from each station a neighbor information frame containing the identity of the station transmitting the frame; means for receiving a neighbor information frame from an upstream neighbor station; means for determining from the content of the neighbor information frame whether the frame originated from the immediately upstream neighbor station; and, if so, means for identifying the immediately upstream neighbor.
Claim 23
Dependent Claim
68 words
Apparatus as defined in claim 13, wherein the means for determining a DNA value includes: means for periodically transmitting a neighbor information frame (hereinafter NIF) request onto the token ring, with an included transaction identifier; means for receiving a NIF response having the same transaction identifier as in the NIF request; and means for identifying the nearest downstream neighbor from a source address contained in the NIF response.