Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
35 views

FDDI Analysis: Computer Networks Prof. Hema A Murthy

The document analyzes FDDI (Fiber Distributed Data Interface) token passing protocol. It discusses how the token interval time and transmission holding times of stations are used to determine if low priority frames can be transmitted. It also describes the timing equations to calculate the time at which the token reaches the next node based on whether the token is early or late. Finally, it discusses how iterating over multiples of m+1 ensures fair sharing of the token to all stations over time and calculates network utilization as the number of stations increases.

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
35 views

FDDI Analysis: Computer Networks Prof. Hema A Murthy

The document analyzes FDDI (Fiber Distributed Data Interface) token passing protocol. It discusses how the token interval time and transmission holding times of stations are used to determine if low priority frames can be transmitted. It also describes the timing equations to calculate the time at which the token reaches the next node based on whether the token is early or late. Finally, it discusses how iterating over multiples of m+1 ensures fair sharing of the token to all stations over time and calculates network utilization as the number of stations increases.

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/ 5

Computer Networks Prof.

Hema A Murthy

FDDI Analysis
Let TTRT = T (average token interval time)
Let α 0 , α1 ,..., α m −1 be the THT for each of
the m stations
α 0 + α1 + ... + α m −1 ≤ T
Let t 0 , t 1 ,..., t m −1 be the time of arrival of
token at stations 0, 1, ..., m - 1
t i , i > 0 is the time at which token reaches station i
= i mod m in cycle i/m
t − m ,..., t −1 , be the times at which token arrives
at m, ..., 1 in the previous cycle
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy

FDDI Analysis
If t i - t i-m < T, low priority frames transmitted
If t i - t i-m > T, no low priority frames transmitted
Both case high priority traffic transmitted
Time at which token reaches next node is
t i +1 = t i-m + T + α i , for t i − t i − m < T, i ≥ 0
t i +1 = t i + α i , for t i − t i − m > T, i ≥ 0
where α i = α i mod m is the allocated transmission
plus propagation time for node (i mod m)

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

FDDI Analysis

Special case : α i = 0, for all i


t i +1 ≤ max (t i , t i - m + T), i ≥ 0
Since t i - m ≤ t i
t i +1 ≤ t i + T
Similarly for 1 ≤ j ≤ m + 1
t i+ j ≤ t i + T
Hence t i + m +1 ≤ t i + T, for all i ≥ 0

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

FDDI Analysis
Iterate over multiples of m + 1
t i ≤ t i mod (m + 1) + i/(m + 1)T all i > 0
The m + 1 occurs to ensure that when stations
are heavily loaded every cycle a different transmits
First cycle station 0 transmits
Next cycle station 1 transmits , ...
t m - station 0 transmits T
t 2m = T ⇒ station 0 cannot tra nsmit - token late
station 1 transmits ⇒ fair share to all stations

Indian Institute of Technology Madras


Computer Networks Prof. Hema A Murthy

Utilisation

1
U=
1 + a/N
N - number of stations
a - propagation delay
1 - time take to transmit a packet
N → ∞ U →1

Indian Institute of Technology Madras

You might also like