Redirected
edited by
39,102 views
25 votes
25 votes

The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is:

  1. $2^n$
  2. $2^{n-1}$
  3. $2^n-1$
  4. $2^{n-2}$
edited by

8 Answers

Best answer
54 votes
54 votes

Answer is b)

In $\text{selective reject protocol},$ the maximum window size must be half
the Sequence number space $=\dfrac{2^n}{2}=2^{n-1}$.

For Go-back n, the maximum window size can be $2^n-1$.

http://webmuseum.mi.fh-offenburg.de/index.php?view=exh&src=73 or archive

edited by
20 votes
20 votes

NUMBER OF SEQUENCE NUMBERS AVAILABLE >= SENDER WINDOW SIZE+RECEIVER WINDOW SIZE.

Thus with n bits 2^n sequence numbers are available.

In SR protocol SENDER WINDOW SIZE = RECEIVER WINDOW SIZE..

thus window size= 2^n/2= 2^n-1

5 votes
5 votes
Here n bit has been used for sequence no.. so total possible sequence no is = 2^n

As we know sender window size= receiver window size (Selective repeat / Reject protocol)..

So window size= (2^n)/2   => 2^(n-1)
3 votes
3 votes

n bits in sequence no means 2^n sequence numbers are there
we know that in SR ,sender and reciever's window size are same...so divide these 2^n sequence no's equally..
so sender can have maximum 2^(n-1) sequence nos...so maximum possible window size is 2^(n-1)...

edited by
Answer:

Related questions

19.9k
views
5 answers
30 votes
Kathleen asked Sep 22, 2014
19,879 views
Packets of the same session may be routed through different paths in:TCP, but not UDPTCP and UDPUDP, but not TCPNeither TCP nor UDP
13.8k
views
3 answers
27 votes
Kathleen asked Sep 22, 2014
13,825 views
Consider a relation scheme $R = (A, B, C, D, E, H)$ on which the following functional dependencies hold: {$A \rightarrow B$, $BC \rightarrow D$, $E \rightarrow C$, $D \ri...
31.2k
views
5 answers
70 votes
Kathleen asked Sep 22, 2014
31,178 views
The relation book (title, price) contains the titles and prices of different books. Assuming that no two books have the same price, what does the following SQL query list...
15.4k
views
3 answers
24 votes
Kathleen asked Sep 22, 2014
15,414 views
Consider a direct mapped cache of size $32$ $KB$ with block size $32$ $bytes$. The $CPU$ generates $32$ $bit$ addresses. The number of bits needed for cache indexing and ...