Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

Token ring

Computer Network - Token Ring (Physical Properties, Media Access Algorithm - Token Algorithm, Frame Format)

  • Be the first to comment

Token ring

  1. 1. Token Ring
  2. 2. Token Ring • IEEE 802.5 – Token ring Token Ring – set of nodes connected in a ring. – Data always flow in a particular direction around the ring. – Each node in the ring receiving the frame from its upstream neighbor and then forwarding them to its downstream neighbor. Token – used to access the ring • Token is a special sequence of bits, circulates around the ring. • Each node receives and forwards the token. – When a node sees the token, • If it has a frame to transmit, it takes the token off the ring and inserts the frame into the ring. • Each node along the way simply forwards the frame. Destination node saving the copy of the frame into the adaptor and forwards the message to the next node. • When the frame reaches the sender, it strips the frame off the ring and reinserts the token.
  3. 3. Token Ring Contd… – Each node in the ring gets a chance to transmit. – Nodes are serviced in a round robin manner. Physical Properties – Uses ring topology. – Problem – any node or link failure leads to entire network failure. Solution: • Connecting each station into the ring using electromechanical relay. – If station is healthy, relay is opened. i.e., station is included in the ring. – If station fails, it stops providing power. So relay is closed and the ring automatically bypasses the station.
  4. 4. Token Ring Contd… Multi station Access Unit (MSAU) – Several relays packed into a single box. – Easy to add / remove stations from the network. Characteristics: – Supports 4Mbps or 16Mbps data rate. – Differential Manchester encoding scheme is used. – Number of stations in the ring is limited to 250 for IEEE802.5 (260 for IBM Token ring).
  5. 5. Token Ring Contd… Token ring Media Access Control – Network adaptor of the token ring contains a receiver, transmitter and one or more bits of data storage between them. – When none of the stations has anything to send, the token circulates around the ring. – Ring has enough storage capacity to hold an entire token. • 1 bit / station – For example, 24 bit token can circulate in the network having maximum 24 stations. • But it will not work proper for network having lesser number of stations than 24. – This will be avoided by “Monitor” Token Operation: – Token circulates around the ring, any station that has data to send may seize the token. • i.e., it drains the token off the ring and begin sending data. • Seizing process just involves modifying 1bit in second byte of the token
  6. 6. Token Ring Contd… – Station that has token can send data. – Each transmitted packet contains the destination address of the intended receiver. • It may be unicast address, multicast address or broadcast address. – Each node in the ring look inside the packet to see if it is the intended receiver. • If so, copies the data frame and pass it to the ring and the packet find the way back to the sender. – Then sending station remove the frame from the ring and reinserts the token to the ring. Issues: – How much data a given node is allowed to transmit? Token Holding Time (THT) – time period given to nodes to hold the token. • But unfair to stations to other than the station holding the token • This will be avoided using TRT (Token Rotation Time) TRT ≤ Active nodes * THT + Ring Latency
  7. 7. Token Ring Contd… Ring Latency – how long it takes the token to circulate around the ring when no one has data to send. Active nodes – number of nodes that have data to send. Reliable Transmission – IEEE 802.5 provides reliable data delivery using 2 bits (A&C) in the packet trailer. – Initially these bits are set to 0. – When a station sees a frame for which it is the intended recipient, • It sets A bit into ‘1’ – When it copies the frame into local adaptor buffer, • It sets the C bit into ‘1’ – When the sender sees the frame come back over the ring • If A = 0 – receiver is not functioning well. • If A = 1, but C = 0 then destination does not accepted the frame due to some reason (eg., Lack of buffer) Priority Bits: • The token contains 3 bit priority field. • Each device that want to transmit the packet assigns a priority to that packet & the device can hold the token, if the priority is at least as great as tokens priority. • Lower priority packets circulate for long in ring
  8. 8. Token Release – Early Release • After transmitting packet – Delayed Release • After removing the packet when it returns to the sender
  9. 9. Token Ring Contd… Token Ring Maintenance: – Token rings have a designated monitor. – The monitor’s job is ensure the health of the token. – Any station in the ring can become the monitor. • Monitor is first elected when the ring is first connected or failure of the current monitor. – Healthy monitor periodically announces its presence with a special control message. • If a station fails to see the control message for some period of time, it will assume that the monitor has failed and will try to become the monitor. – When a station decides that a new monitor is needed, it transmits a “Claim Token” frame, announcing its intent to become the new monitor. • If the token circulates back to the sender, it can assume that it is OK for it to become a monitor. • If some other is trying to become the monitor at the same instant, the sender might see the “claim token” message from that other station first, – Highest Address wins
  10. 10. Token Ring Contd… Roles of Monitor: • May need to insert additional delay into the ring • Detecting the missing token • Watches for a passing token and maintains a timer equal to the maximum possible token rotation time. (NumStations * THT) + Ring Latency Ring Latency – total propagation delay on the ring. • Checks for corrupted or orphaned frame.  Corrupted frame – checksum error or invalid formats.  Orphaned frame – transmitted correctly on the ring, but whose parent died. i.e., sending station went down before it could remove the frame from the ring. • Its detected by using a “Monitor” bit. • Monitor bit is “0” on transmission • Set to ‘1’ when it passes the monitor first time. • If the monitor sees a frame with this bit is set, it knows the frame is going by for the second time and it drains the frame off the ring. • Detection of dead stations.  If any station suspects failure on the ring, it can send “beacon” frame to suspect destination. • Status of the ring can be established and malfunctioning station can be bypassed in the MSAU
  11. 11. Token Ring Contd… Frame Format: – “illegal” Manchester codes in the start and end delimiters. – Access Control – includes frame priority, reservation priority. – Frame Control – Demux key that identifies the higher layer protocol. – 48 bit Destination and source hardware addresses – Checksum – error detection code – Frame Status – includes A & C bits

    Be the first to comment

    Login to see the comments

  • ashwiniyadavyadav

    Oct. 29, 2015
  • AayushThakur3

    Nov. 4, 2015
  • AmprasadGhimiray1

    Apr. 26, 2016
  • nupurbushan54

    Jul. 3, 2016
  • LogeshwariLogeshwari

    Aug. 30, 2016
  • ZarlishQureshi

    Feb. 11, 2018
  • Amrata2

    Feb. 13, 2018
  • nithya12

    Mar. 23, 2018
  • sesma96

    Jul. 25, 2018
  • kavithav2326

    Aug. 7, 2018
  • reshamafridi

    Nov. 18, 2018
  • ummeameal

    Dec. 7, 2018
  • BhavadharaniAnnadura

    Feb. 26, 2019
  • HarpalKalra1

    Jul. 16, 2019
  • GowriShankar279

    Apr. 8, 2020
  • KiKarin

    Sep. 10, 2020
  • trivenik3

    Sep. 12, 2020

Computer Network - Token Ring (Physical Properties, Media Access Algorithm - Token Algorithm, Frame Format)

Views

Total views

6,074

On Slideshare

0

From embeds

0

Number of embeds

2

Actions

Downloads

0

Shares

0

Comments

0

Likes

17

×