Open In App

Sliding Window Protocol | Set 2 (Receiver Side)

Please refer this as a prerequisite article: Sliding Window Protocol (sender side)| set 1 Sliding Window Protocol is actually a theoretical concept in which we have only talked about what should be the sender window size (1+2a) in order to increase the efficiency of stop and wait arq. Now we will talk about the practical implementations in which we take care of what should be the size of receiver window. Practically it is implemented in two protocols namely :

  1. Go Back N (GBN)
  2. Selective Repeat (SR)

In this article, we will explain you about the first protocol which is GBN in terms of three main characteristic features and in the next part we will be discussing SR as well as comparison of both these protocols

Go Back N (GBN) Protocol

The three main characteristic features of GBN are:

  1. Sender Window Size (WS) It is N itself. If we say the protocol is GB10, then Ws = 10. N should be always greater than 1 in order to implement pipelining. For N = 1, it reduces to Stop and Wait protocol.
Efficiency Of GBN = N/(1+2a)
where a = Tp/Tt
Tp=Propogation Delay
Tt=Transmission Delay of sender

What will be the efficiency if processing delay, queuing delay and transmission delay of acknowledgement is not zero.

Efficiency=N*(Useful time)/(Total Time)


useful time=Tt

Total time=Tt+2*Tp+Pr+Pq+Tt(ack)

where Tt=Transmission delay of sender side

Tp=Propogation Delay

Pr=Processing Delay

Pq=Queuing Delay

Tt(ack)=Transmission Delay of Acknowledgement

  1. If B is the bandwidth of the channel, then
Effective Bandwidth or Throughput
= Efficiency * Bandwidth
= (N/(1+2a)) * B
  1. Receiver Window Size (WR)
WR is always 1 in GBN.
  1. Now what exactly happens in GBN, we will explain with a help of example. Consider the diagram given below. We have sender window size of 4. Assume that we have lots of sequence numbers just for the sake of explanation. Now the sender has sent the packets 0, 1, 2 and 3. After acknowledging the packets 0 and 1, receiver is now expecting packet 2 and sender window has also slided to further transmit the packets 4 and 5. Now suppose the packet 2 is lost in the network, Receiver will discard all the packets which sender has transmitted after packet 2 as it is expecting sequence number of 2. On the sender side for every packet send there is a time out timer which will expire for packet number 2. Now from the last transmitted packet 5 sender will go back to the packet number 2 in the current window and transmit all the packets till packet number 5. That’s why it is called Go Back N. Go back means sender has to go back N places from the last transmitted packet in the unacknowledged window and not from the point where the packet is lost.
  2. Acknowledgements There are 2 kinds of acknowledgements namely:
    • Cumulative Ack: One acknowledgement is used for many packets. The main advantage is traffic is less. A disadvantage is less reliability as if one ack is the loss that would mean that all the packets sent are lost.
    • Independent Ack: If every packet is going to get acknowledgement independently then the reliability is high here but a disadvantage is that traffic is also high since for every packet we are receiving independent ack.

Relationship Between Window Sizes and Sequence Numbers We already know that sequence numbers required should always be equal to the size of window in any sliding window protocol.

Minimum sequence numbers required in GBN = N + 1
Bits Required in GBN = ceil(log2 (N + 1))

The extra 1 is required in order to
avoid the problem of duplicate packets
as described below.

Example: Consider an example of GB4. 

This is explained with the help of the illustrations below. Trying with Sequence numbers 4. Now Trying with one extra Sequence Number. Now it is clear as to why we need an extra 1 bit in the GBN protocol. In the next article, we will explain Selective repeat and comparison between the 2 proto

Article Tags :