Electrical computers and digital processing systems: multicomput – Ring computer networking
Reexamination Certificate
1998-03-20
2002-08-20
Maung, Zarni (Department: 2152)
Electrical computers and digital processing systems: multicomput
Ring computer networking
C709S230000, C709S221000
Reexamination Certificate
active
06438614
ABSTRACT:
FIELD OF THE INVENTION
This invention relates generally to local area networks and, more specifically, to token passing in a token ring local area network.
BACKGROUND OF THE INVENTION
Computers in a computer network often share a limited number of resources. One conventional method of allocating access between shared resources involves passing a “token” circularly to each computer in the network. The computers agree ahead of time that when using this token protocol, only the computer that has possession of the token may access the resource. A popular example of a network using a token passing algorithm is a token ring network.
Token ring networks are baseband networks, which means that all the transmission capacity (i.e., network bandwidth) of the network media is used by one signal. Because only one signal at a time can be transmitted over the network, multiple computers in a token ring network must not transmit simultaneously. This is accomplished using a token access protocol.
In the token access protocol, computers in the network agree to continuously circulate an information frame to all the computers in the network. When a computer wants to send a message, it waits until it possesses the empty frame, and then modifies the frame by inserting: its message, a destination identifier, and a “token.” The token may simply be, for example, a bit field in the frame that the inserting computer changes to a 1 to indicate a token is present or a 0 to indicate an empty frame.
The frame is examined by each computer as it is passed around the network. The destination computer copies the message from the frame and changes the token back to zero. The originating computer, when it receives the frame, can verify that its message was received by noticing that the token has been set to zero. The originator then removes the message from the frame and passes the empty frame to the next computer in the network.
Although conventional token ring networks are effective at preventing data collisions, they have disadvantages. In particular, in order to implement a token ring network, all the computers in the network must agree ahead of time on the appropriate protocol to use in passing the message frame. This can be difficult, if, for example, the network administrator wishes to change the protocol of the token ring, as each computer must be updated before the network is operational. It is therefore desirable to improve token ring networks.
SUMMARY OF THE INVENTION
Objects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objects and advantages of the invention will be realized and attained by means of the elements and combinations particularly pointed out in the appended claims.
To achieve the objects and in accordance with the purpose of the invention, as embodied and broadly described herein, a first aspect consistent with the present invention includes a method of updating a protocol for controlling a computer network including a plurality of computers, the method comprises the steps of: (1) creating a token object containing methods defining an updated version of the protocol; (2) sequentially passing the token object to each computer in the network; and (3) updating the protocol used by each of the plurality of computers with the methods defining the updated version of the protocol while the token object is present at each computer.
A second aspect consistent with the present invention is directed to a token ring network. The network comprises a plurality of computers coupled together and a token ring object. The token ring object includes methods and data that define a protocol for the token ring network, the token ring object is sequentially transferred to each of the plurality of computers, and when one of the plurality of computers has received possession of the token ring object, it adopts the protocol defined by the token ring object when the protocol defined by the token ring object is different than the protocol in use by the computer.
Further, a third aspect consistent with the present invention includes a method of updating a protocol for controlling a computer network. The method includes the steps of: (1) receiving a token object at a first computer in the network; (2) consulting the token object, and when the token object indicates that a new protocol is to be used to transmit information on the network, updating an older version of the protocol stored at the first computer; and (3) transmitting the token object to a second computer in the network, the second computer being determined based on information in the token object.
Further, an additional aspect consistent with the present invention includes a method of updating a protocol for controlling a computer network. The method includes the steps of: (1) receiving a token object defining a protocol of the network; and (2) sending the object using the protocol defined in the token object.
Still further, an additional aspect consistent with the present invention includes a computer readable memory device containing token including an indication of a protocol to be used when communicating in a network.
BRIEF DESCRIPTION OF THE DRAWINGS
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate several embodiments consistent with this invention and, together with the description, help explain the principles of the invention. In the drawings,
FIG. 1
is a high-level diagram of a token ring network;
FIG. 2
is a block diagram illustrating an exemplary embodiment of a computer used in the token ring network;
FIG. 3
is a diagram illustrating an embodiment of a token object consistent with the present invention; and
FIG. 4
is a flow chart illustrating methods consistent with the present invention.
REFERENCES:
patent: 4430699 (1984-02-01), Segarra et al.
patent: 4491946 (1985-01-01), Kryskow, Jr. et al.
patent: 4558413 (1985-12-01), Schmidt et al.
patent: 4713806 (1987-12-01), Oberlander et al.
patent: 4809160 (1989-02-01), Mahon et al.
patent: 4823122 (1989-04-01), Mann et al.
patent: 4939638 (1990-07-01), Stephenson et al.
patent: 4956773 (1990-09-01), Saito et al.
patent: 5088036 (1992-02-01), Ellis et al.
patent: 5109486 (1992-04-01), Seymour
patent: 5187787 (1993-02-01), Skeen et al.
patent: 5218699 (1993-06-01), Brandle et al.
patent: 5257369 (1993-10-01), Skeen et al.
patent: 5293614 (1994-03-01), Ferguson et al.
patent: 5297283 (1994-03-01), Kelly, Jr. et al.
patent: 5307490 (1994-04-01), Davidson et al.
patent: 5311591 (1994-05-01), Fischer
patent: 5339435 (1994-08-01), Lubkin et al.
patent: 5386568 (1995-01-01), Wold et al.
patent: 5390328 (1995-02-01), Frey et al.
patent: 5392280 (1995-02-01), Zheng
patent: 5423042 (1995-06-01), Jalili et al.
patent: 5440744 (1995-08-01), Jacobson et al.
patent: 5448740 (1995-09-01), Kiri et al.
patent: 5452459 (1995-09-01), Drury et al.
patent: 5455952 (1995-10-01), Gjovaag
patent: 5471629 (1995-11-01), Risch
patent: 5475792 (1995-12-01), Stanford et al.
patent: 5475817 (1995-12-01), Waldo et al.
patent: 5481721 (1996-01-01), Serlet et al.
patent: 5504921 (1996-04-01), Dev et al.
patent: 5511197 (1996-04-01), Hill et al.
patent: 5524244 (1996-06-01), Robinson et al.
patent: 5548726 (1996-08-01), Pettus
patent: 5553282 (1996-09-01), Parrish et al.
patent: 5555367 (1996-09-01), Premerlani et al.
patent: 5555427 (1996-09-01), Aoe et al.
patent: 5557798 (1996-09-01), Skeen et al.
patent: 5560003 (1996-09-01), Nilsen et al.
patent: 5561785 (1996-10-01), Blandy et al.
patent: 5577231 (1996-11-01), Scalzi et al.
patent: 5594921 (1997-01-01), Pettus
patent: 5603031 (1997-02-01), White et al.
patent: 5617537 (1997-04-01), Yamada et al.
patent: 5628005 (1997-05-01), Hurvig
patent: 5640564 (1997-06-01), Hamilton et al.
patent: 5644768 (1997-07-01), Periwal et al.
patent: 5652888 (1997-07-01), Burgess
patent: 5655148 (1997-08-01), Richman et al.
patent: 5659751 (1997-08-01), Heninger
patent: 5671225 (1997-09-01
Arnold Kenneth
Waldo James H.
Cardone Jason D.
Finnegan Henderson Farabow Garrett & Dunner L.L.P.
Maung Zarni
Sun Microsystems Inc.
LandOfFree
Polymorphic token based control does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Polymorphic token based control, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polymorphic token based control will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2876218