Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Bit-Map Protocol
Bit-map protocol is a collision-free protocol that operates in the Medium Access Control (MAC) layer of the OSI model. It resolves any possibility of collisions while multiple stations are contending for acquiring a shared channel for transmission.
In this protocol, if a station wishes to transmit, it broadcasts itself before the actual transmission. This is an example of a Reservation Protocol, where stations reserve the channel before data transmission begins.
Working Principle
In this protocol, the contention period is divided into N slots, where N is the total number of stations sharing the channel. If a station has a frame to send, it sets the corresponding bit in its designated slot to 1.
The transmission process follows these steps:
-
Reservation phase − Each station announces its intention to transmit by setting its corresponding slot bit
-
Data transmission phase − Stations transmit in order based on slot numbers
-
Collision avoidance − All stations know the transmission schedule, eliminating collisions
Once each station announces itself, transmission occurs in the order of slot numbers. Each station has complete knowledge of whether every other station wants to transmit before transmission starts, eliminating all possibilities of collisions.
Performance Analysis
The efficiency of the bit-map protocol varies significantly with network load:
High Load Conditions
Under high loads, when most stations want to transmit, the N-bit contention time is distributed over all stations. The overhead becomes just 1 bit per frame. If d is the data transmission time, the efficiency approaches d/(d+1), which is nearly 100% for large frames.
Low Load Conditions
During low loads, if only one station needs to transmit, it must still wait through all N contention slots. The overhead becomes N bits per frame, and efficiency drops to d/(d+N).
| Load Condition | Overhead per Frame | Efficiency | Best Suited For |
|---|---|---|---|
| High Load | 1 bit | d/(d+1) ? 100% | Many active stations |
| Low Load | N bits | d/(d+N) | Few active stations |
Advantages and Disadvantages
Advantages
-
Collision-free − Eliminates all possibilities of data collisions
-
Fair access − Each station gets equal opportunity based on slot numbers
-
High efficiency − Excellent performance under high network loads
Disadvantages
-
Fixed station limit − Number of stations is predetermined and fixed
-
Low load inefficiency − Poor performance when few stations are active
-
Waiting time − High-numbered stations experience longer delays
Conclusion
The bit-map protocol is an effective collision-free MAC protocol that works exceptionally well under high network loads, achieving near-100% efficiency. However, its performance degrades significantly under low load conditions, making it most suitable for environments with consistently high network activity.
