Bitmap protocol in computer networks how long will station have to wait in worst case
Answers
Answered by
5
Hidden Node Problem
In the case of wireless network it is possible that A is sending a message to B, but C is out of its range and hence while "listening" on the network it will find the network to be free and might try to send packets to B at the same time as A. So, there will be a collision at B. The problem can be looked upon as if A and C are hidden from each other. Hence it is called the "hidden node problem".
Exposed Node Problem
If C is transmitting a message to D and B wants to transmit a message to A, B will find the network to be busy as B hears C trnasmitting. Even if B would have transmitted to A, it would not have been a problem at A or D. CSMA/CD would not allow it to transmit message to A, while the two transmissions could have gone in parallel.
This is how the Basic Bit-Map Protocol works.
Assume N stations are numbered from 1 to N.There is a contention period of N slots (bits).Each station has one slot time during the contention period, numbered 1 to N.Station J sends a 1-bit reservation during Jth slot time if it wants to transmit a frame.Every station sees all the 1-bit reservation transmitted during the contention period, so each station knows which stations want to transmit.After the contention period, each station that asserted its desire to transmit sends its frame in the order of station number.
In the case of wireless network it is possible that A is sending a message to B, but C is out of its range and hence while "listening" on the network it will find the network to be free and might try to send packets to B at the same time as A. So, there will be a collision at B. The problem can be looked upon as if A and C are hidden from each other. Hence it is called the "hidden node problem".
Exposed Node Problem
If C is transmitting a message to D and B wants to transmit a message to A, B will find the network to be busy as B hears C trnasmitting. Even if B would have transmitted to A, it would not have been a problem at A or D. CSMA/CD would not allow it to transmit message to A, while the two transmissions could have gone in parallel.
This is how the Basic Bit-Map Protocol works.
Assume N stations are numbered from 1 to N.There is a contention period of N slots (bits).Each station has one slot time during the contention period, numbered 1 to N.Station J sends a 1-bit reservation during Jth slot time if it wants to transmit a frame.Every station sees all the 1-bit reservation transmitted during the contention period, so each station knows which stations want to transmit.After the contention period, each station that asserted its desire to transmit sends its frame in the order of station number.
Answered by
2
Answer:
Bitmap protocol in computer networks how long will station have to wait in worst case.
Similar questions