# GATE2005-25

10.5k views

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

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

edited
0
can anyone plzz explain this question
1
can i say reciever window size = senders windows size
4
Are selective repeat and selective reject same?
3
yes...
0
3
First time saw this girl actually explain her answers, else she just runs away after mentioning the option no.

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

0

@sushmita plz verify this

Ws+Wr=2*N  for SR and Ws +Wr =N+1 for gobackN

2x=2^n so x=2^(n-1)

sender and receiver side have unique sequence no? why so?

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)
1 vote

We know that,

Sender window size + Receiver window size <= Available Sequence No.

i.e. Ws + Wr <= ASN .....(1)

In Selective Repeat/Reject Protocol, Ws = Wr

Say, Ws = Wr = N.....(2)

Also as in question it is given that n-bits have been used for frame sequence no.

Therefore, Available Sequence No. (ASN) = 2^n

Now from equation (1) and (2),

N + N <= 2^n
=>N <= 2^n-1

Therefore, The maximum window size for data transmission using the selective reject protocol
with n-bit frame sequence numbers is 2^n-1

## Related questions

1
7.7k views
Packets of the same session may be routed through different paths in: TCP, but not UDP TCP and UDP UDP, but not TCP Neither TCP nor UDP
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 \rightarrow A$}. What are the candidate keys R? $AE, BE$ $AE, BE, DE$ $AEH, BEH, BCH$ $AEH, BEH, DEH$
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 the number of tag bits are respectively, $10, 17$ $10, 22$ $15, 17$ $5, 17$