TOKEN
RING

Token Ring was developed by
several manufacturers and it copes well with high network traffic loadings, and were
at one time extremely popular. The Ethernet has since overtaken their
popularity.
An electronic token
(named a control token) is circulates around a closed electronic loop
(network) . Each node on the
network reads the token and repeats it to the next node. The control token
circulates around the ring even when there is no data being transmitted.
If a nodes on the network wishing to transmit it
must await for a token. When the node gets a token, it fill a frame with data and add the
source and destination addresses then send it to the next node. The data frame
then circulates around the ring until it reaches the destination node. The
destination node then
reads the data into its local memory area (or buffer) and marks an
acknowledgement on the data frame. This then circulates back to the source (or
originating) node. When the original node receives the frame, it tests it to determine
whether it contains an acknowledgement. If it does then the source node knows
that the data frame was received correctly.
If the source node has finished transmitting data then it transmits a new
token, which can be used by other nodes on the ring.
Using the diagram below, a control token as in (a) circulates between
all the nodes. This token does not contain any data and is only a few bytes
long. If node B receives the token it then transmits a data frame,
as illustrated in (b). This data frame is passed to node C, then to node D and
finally onto A. Node A then reads the data in the data frame and returns an
acknowledgement to node B, as in (c). After node B receives the
acknowledgement, it passes a control token onto node C and this then
circulates until a node wishes to transmit a data frame. In Token Ring no nodes are allowed
to transmit data unless they have received a valid control token. The sequence in which nodes
transmit is determined by a distributed control protocol thus giving each node equal access to the ring, as each node is only allowed to
send one data frame ( exception FDDI - allow for
a time limit on transmitting data, before the token is released). After
transmision of a data frame node must give up the token to the next node, and wait for the token to return before it
can transmit another data frame.

Example of data Exchange
A Token Ring system requires considerable
maintenance; it must perform the following functions:
- Ring
initialisation - when the network is started, or after the ring has been
broken, it must be reinitialised. A co-operative decentralized algorithm
sorts out which node starts a new token, which goes next, and so on.
- Adding
to the ring - if a new node is to be physically connected to the ring then
the network must be shut down and reinitialised.
- Deletion
from the ring - a node can disconnect itself from the ring by joining
together its
- Predecessor
and its successor. Again, the network may have to be shut down and
reinitialised.
- Fault
management - typical Token Ring errors occur when two nodes think it is
their turn to transmit or when the ring is broken as no node thinks that
it is their turn.
Token Ring multistation access units
(MAUs)
MAU reduces significantly the problems of adding and deleting nodes to or from a
ring network. 
top
|
Related Topics
LAN components
Cabling standards Token
Ring/IEEE 802.5 more
Topics
|