Computer Networks Prof.
Hema A Murthy
Collision free protocols
• Reservation Protocols
• Station have a unique address 0 ,…,N-1
• Bit mapped protocol:
– Contention period – divide into N slots
• station 0 can only send a 1 bit in that slot.
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Collision free protocols
• Station j announces that it has a frame to
transmit by inserting a bit in slot j.
• After all N slots have passed by –
– every station knows numerical order
– Now transmit in Numerical order
• no collision at all!
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Collision free protocols
• After last ready frame transmitted –
– an event generated
• New N bit contention period
• If a station misses
– wait for next contention period
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Collision free protocols
• After all stations have transmitted
probability of having a frame to transmit
middle of slot
– wait 1 ½ contention period before transmitting
• Always 1 bit/station/frame transmitted is the
overhead
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Efficiency
0 1 2 3 4 5 6 7
1 1 1 1 3 7
d
High load U =
Nd + 1
d
Low load U =
d +1
d − frame size
1 - contention
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Contention Free Protocols
• Binary Countdown:
• Better than bit mapped protocols
• Use binary station addresses
• Each station broadcasts address
– Example: 0010 0100 1001 1100
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Contention Free Protocols
• All addresses same length
• Bits in each position from different stations
are ORed
• Collision avoidance
– arbitration rule
– if high order bit position of station address
overwritten by 1 give up!
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Binary CountDown
0010
Compare give up
0100
1001
give up
1100
1111
Compare next bit
1001 gives
Compare next bit up
1100 – gets access!
Next new cycle of contention start
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Binary CountDown:Analysis
d
U=
d + ln2 N
If the higher order bits of a station j address are 1,
station j transmits continuously
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Limited Contention Protocols
• combine the properties of contention and
collision free protocols
• contention at low load to provide low delay
• reservation at high load
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Adaptive Tree Walk Protocol
• Adaptive TreeWalk Algorithm
– low load
• every body contends
– collision –
• reduces number of stations
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Adaptive Tree Walk Algorithm
1
2 3
4 5 6 7
a b c de f g h
First contention all stations permitted to contend
- if collision then next slot only nodes under 2 can contend
- if success next slot – Nodes under 3
- if collision then nodes under Node 4
- if success next slots Nodes under 5
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Adaptive Tree Walk Algorithm
• Depth first tree walk algorithm
• Heavy load do not start searching at top of
tree
– what level to start the search?
– depends on number of ready stations
Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy
Adaptive Tree Walk Algorithm
• Each node at level i has N. 2–i station under
it.
• q ready stations – uniformly distributed at
level i 2-iq
• level at which search begins
– 2-iq =1
– i = log2 q
Indian Institute of Technology Madras
