Scribd
Upload
412 views9 pages

Collision Free Protocol-Bit Map Protocol

The document describes the Bit-Map Protocol, a contention-free protocol. It works by having stations broadcast their intention to transmit before actually transmitting. Stations are assigned contention slots, and only the station assigned a slot may transmit during that slot. This allows multiple stations to transmit without collisions. The document also discusses the Binary Countdown Protocol, which uses a binary representation of station addresses to efficiently reserve channel access with minimal overhead bits.

Uploaded by

Sahil Thakur
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
412 views9 pages

Collision Free Protocol-Bit Map Protocol

The document describes the Bit-Map Protocol, a contention-free protocol. It works by having stations broadcast their intention to transmit before actually transmitting. Stations are assigned contention slots, and only the station assigned a slot may transmit during that slot. This allows multiple stations to transmit without collisions. The document also discusses the Binary Countdown Protocol, which uses a binary representation of station addresses to efficiently reserve channel access with minimal overhead bits.

Uploaded by

Sahil Thakur
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1/ 9

Collision Free Protocol-Bit Map Protocol

Mansi Thakur
MCA
Contention Free Protocol-Bit
Map Protocol

Bit-map Protocol
Binary Countdown
Limited Contention Protocols
Bit-Map Protocol
8 contention slots Frame 80 Contention Slots
0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7
z
1 1 1 1 3 7 1 1
z
1 d
0 1 2 3 4 5 6 7

1 5 1 2

The basic bit-map protocol


Bit-Map Protocol
• Protocols that broadcast their intention before that actually transmit
are called reservation protocols.
• Low-Load condition
Average wait conditions for low-numbered stations:
• N/2 slots for current scan to finish , and
• N slots for the following scan to run to completion before it may begins transmitting
• 1.5 slots wait time.
Average wait conditions for high numbered stations:
. 0.5N slots wait time
Mean of all statins is N time
Bit-map Protocol
• Efficiency:
Overhead bits N d
Data bits d (d + N)
• High-load
N bit contention period is prorated over N frames , yielding an
overhead of only 1 bit per frame:
• Efficiency d
• Mean delay (d + 1)
Sum of time it queues in the station +
(N-1)d + N
Collision- Free Protocols

Station

Token

Direction of
transmission

Token
Ring
Token Passing
• Message is passed called token from station to the next in same
predefine order.
• Token Ring and Token Bus work the same way.
• One has to pay attention to the ring because if it not removed from
circulation it will end up begin there forever.
• Typically it will be removed by the receiving station and sending
station.
Binary Count down
Bit time
0123
0 0 1 0 0 ___
0 1 0 0
0 ___
1 0 0 1
100 _
1 0 1 0
101 0
Result 101 0

Stations 0010 Station 1001


and 0100 see this see this 1 and give up
1 and give up

The binary countdown protocol. A dash indicates silence


Binary Countdown
• A binary with the basic bit –map and token passing protocols is the overhead of
1 bit per station.
 Large overhead for the network with large number of the stations.
• A better solution is to use binary station address with a channel that combines
transmissions.
• A station wanting to use the channel now broadcasts its address as a binary bit
string , starting with high-order bit. The addresses are assumed to be the same
length.
• The bits in each address position from different stations are BOOLLEN.
The are OR-ed together by the channel when they are send at the time.
Binary Countdown protocol

You might also like