Scribd
Upload
71 views

IEEE 802.5 Token Ring: - A Special Sequence of Bits - Circulates Around The Ring

The document describes the key aspects of IEEE 802.5 Token Ring networks. It discusses that token ring networks consist of nodes connected in a ring, with data and a token circulating in one direction. It also covers token access method, frame formats, token size, token holding time issues, reliable transmission using A and C bits, priority support, and the role of monitors in token ring maintenance.

Uploaded by

23wings
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
71 views

IEEE 802.5 Token Ring: - A Special Sequence of Bits - Circulates Around The Ring

The document describes the key aspects of IEEE 802.5 Token Ring networks. It discusses that token ring networks consist of nodes connected in a ring, with data and a token circulating in one direction. It also covers token access method, frame formats, token size, token holding time issues, reliable transmission using A and C bits, priority support, and the role of monitors in token ring maintenance.

Uploaded by

23wings
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

Computer Networks Prof.

Hema A Murthy

IEEE 802.5 Token Ring


• Consists of a set of nodes connected in a
ring.
• Data flows in a particular direction only.
• Data received from upstream neighbour
forwarded to downstream neighbour.
• Token – access to the shared ring
– a special sequence of bits
– circulates around the ring.

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

IEEE 802.5 Token Ring


• Each node receives and forwards token.
• Frame makes its way back to sender
– frame removed by sender
– sender reinsert token.
• As token circulates around ring, each station
gets a chance to transmit
– Service round - robin fashion

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Token Ring Issues


• Any link or node failure
– Network rendered useless
• Solution –
– electromechanical relay
– Station active relay is open and station included
– Station is inactive
• no power
• relay closed
• bypass station

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Token Ring Issues

Host Host

Previous To next Previous To next


host host host host

relay open - station relay closed


included bypass station

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Multistation Access Unit (MSAU)


• Several relays in a box
• Add new station H2
– Plug into MSAU

H1 H3
From prev
MSAU

H4
To next MSAU
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy

Token Ring (Characteristics)


• Date rate: 4 Mbps or 16 Mbps
• encoding: differential manchester
• 802.5 upto 250 station
• physical medium is +P for IBM – not
specified in 802.5

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Differential Manchester
clock

1 0 0 0 1 0
NRZ

Manchester

Differential Manchester
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy

Token Ring Access Control


• Network adapter: receiver, and transmitter,
and one or more bits of data storage
between them.
• When no stations have anything to transmit
token circulates
• Ring has enough storage capacity to hold an
entire token.
– 1 bit / station

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Token Ring Frame Format

1 byte 1 byte 1 byte 6 bytes 6 bytes 4 bytes 1 byte 1 byte

SD AC FC DA SA Data FCS E0 FS

Check sum

PPPMRRR No limit! Frame status

E + I bit
PriorityMonitor Reservation
Request for next token with requested priority Set to indicate
not last frame if a
E bit is set if
Frame control data / token multiframe
error
transmission
Invalid differential coding HH LL
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy

IEEE 802.5
• Token Size: 24 bits
– Minimum number of stations is 24
– Overcome this by including a monitor which
adds the extra bits of delay
• Token operation
– Token circulates
– Station seizes a token

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

IEEE 802.5
– Modifies a bit in the second byte of token
– Station that has token transmits data
– Station drains token out of the ring
– Station sends data
– Each packet has destination address
– All stations downhill check destination address
– Destination copies packet
– Packet finds its way back to sending station

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

IEEE 802.5
– Sending station removes packet from ring
– Station reinserts token into the ring
• Size of packet stored in the ring
– Larger/smaller than ring
• Add/remove bits

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

IEEE 802.5
• Issues
– Size of data that given node is allowed to
transmit
– Token holding time (THT) = ∞ ?
• Utilisation is 100%
• Unfair to stations to other than the station holding
the token
– THT affects ring performance

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Token Holding Time


• Token Rotation Time (TRT):
• TRT ≤ Active nodes * THT + Ring
Latency
• Ring Latency – token circulation time

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Reliable Transmission
• Use A and C bits
• Initially A and C zero.
• Receiver sets A bit after seeing that it is
the intended recipient
• Receiver sets C bit after copying frame
• If both A and C are not set – retransmit

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Priorities in IEEE 802.5


• Supports different levels of priority
– 3 bits
– each station waiting to send, sets priority for
packet packet’s priority as high current token
– then token can be seized
– Intending to send station – sets the priority on
currently passing data frame

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Priorities in IEEE 802.5


– releasing station sets priority of token to n.
– Lower priority packets circulate for long in ring
• Token Release
– Early release
• After transmitting packet
– Delayed release
• After removing packet when it returns to the sender

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Token Ring Maintenance


• Designated monitor
– any station can become a monitor
– defined procedures for becoming a monitor
– healthy monitor announces that it is a monitor at
periodic interval
– if a station does not see that packet for some time –
then it sends a “claim token”
– if claim token comes back to station then it is monitor
– if another wants to claim see other stations claim first
some arbitration rule.

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Token Ring Maintenance


• Role of monitor
– insert additional delay in ring
– ensure always that there is a token somewhere
in the ring
– regenerate a vanished token
– no token seen for TRT => regenerate

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Token Ring Maintenance


– orphaned / corrupted packets – drain them if
orphaned
• (A and C bits set – parent dies)
• A bit set C bit not set – parent dies
– bit is initially set to 1 by monitor
• monitor notices back when packet passes by monitor
a second time

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Token Ring Maintenance


• Detection of dead stations
– some problem un detected
– suspecting station sends a beacon frame –
– how far beacon goes decide which stations
must be bypassed.

Indian Institute of Technology Madras

You might also like