Recent questions tagged sliding-window / GATE Overflow for GATE CSE

1 votes

1 answer

181

Sliding window
When full duplex link is given then Rtt=2*pt or pt

When full duplex link is given thenRtt=2*pt or pt

sourabh

356 views

sourabh asked Dec 14, 2015

3 votes

2 answers

182

point to point link to the moon
Suppose you are designing the sliding window protocol for a 1 Mbps point to point link to the moon, which has one way latency(delay) of 1.25 seconds. assuming that each frame carries 1 KB of data, What is minimum number of bits you need for sequence number?

Suppose you are designing the sliding window protocol for a 1 Mbps point to point link to the moon, which has one way latency(delay) of 1.25 seconds. assuming that each f...

Desert_Warrior

8.4k views

Desert_Warrior asked Dec 13, 2015

4 votes

1 answer

183

RTT
A) What is Round Trip Time ? B) Explain R.T.T. clearly for Stop n Wait , Go-Back-N , Selective Repeat ARQ .

A) What is Round Trip Time ?B) Explain R.T.T. clearly for Stop n Wait , Go-Back-N , Selective Repeat ARQ .

Himanshu1

2.9k views

Himanshu1 asked Dec 10, 2015

4 votes

3 answers

184

Size of Sequence Number Field
Consider a Go Back N sliding window protocol that uses a frame size of $2$KB to send data on a $10$KBPS link with a Round Trip Time of $100$ milli seconds.To achieve a link utilization of $50\%$, the minimum number of bits required to ... per frame transmission time is 0.2 seconds & given RTT is 0.1 second. How it is possible? Am I misinterpreting the question?

Consider a Go Back N sliding window protocol that uses a frame size of $2$KB to send data on a $10$KBPS link with a Round Trip Time of $100$ milli seconds.To achieve a li...

अनुराग पाण्डेय

4.2k views

अनुराग पाण्डेय asked Dec 6, 2015

6 votes

2 answers

185

Sliding window protocol
Consider three nodes $ A,B,C$ connected in series. Node $A$ is connected to Node B via $ 3 \text{Gbps}$ link, $500 \text{km}$ length. The links are full duplex, but no other traffic on the links. A large file is to be sent from node $A$ to node $C$. Packets ... protocol is used what is the optimal value of sender’s window (a). $28$ (b). $38$ (c). $54$ (d). $72$

Consider three nodes $ A,B,C$ connected in series. Node $A$ is connected to Node B via $ 3 \text{Gbps}$ link, $500 \text{km}$ length. The links are full duplex, but no ot...

Shefali

1.6k views

Shefali asked Nov 7, 2015

2 votes

3 answers

186

window size in sliding window protocol
A $50 kbps$ satellite channel with $550 ms$ round trip propagation delay using sliding window protocol sends 2000 bits frame then window size, w will be: $w>=7.75 \text{bits}$ $w>=14.5 \text{bits}$ $w>=15.5 \text{bits}$ $w>=20.5 \text{bits}$

A $50 kbps$ satellite channel with $550 ms$ round trip propagation delay using sliding window protocol sends 2000 bits frame then window size, w will be:$w>=7.75 \text{bi...

gate_forum

4.0k views

gate_forum asked Oct 16, 2015

0 votes

2 answers

187

Which utilization formula to use and why?
Consider sliding window protocol for a 10 MBps point to point link with propagation delay of 2 sec. If frame size is of 4kB then what wil be the minimum number of bits number required for the sequence number? Which approach to take and ... difference in frame numbers, why does this arise and which one is correct. The answer is not affected in this question.

Consider sliding window protocol for a 10 MBps point to point link with propagation delay of 2 sec. If frame size is of 4kB then what wil be the minimum number of bits nu...

dirac

2.1k views

dirac asked Oct 6, 2015

3 votes

3 answers

188

Transmission rate in a 3 node 2 link sliding window system
The distance between A to B is 4000 km. The distance between B and C is 1000 km.The propogation delay is 5 micro sec/ km for both the links. The data rate between A and B is 100kbps. Both the links are full duplex. All data frames are ... rate (in kbps) between B and C so that buffers of node B are not flooded? A. 100 B.150 C.200 D.250

The distance between A to B is 4000 km. The distance between B and C is 1000 km.The propogation delay is 5 micro sec/ km for both the links. The data rate between A and B...

dirac

3.4k views

dirac asked Oct 5, 2015

1 votes

1 answer

189

Throughput Calculation.
What should be the throughput in sliding window protocol for a window size of $100$ bits in terms of mbps is?. If RTT is equal to $100$ $\mu$sec and bandwidth is $10$mbps.

What should be the throughput in sliding window protocol for a window size of $100$ bits in terms of mbps is?.If RTT is equal to $100$ $\mu$sec and bandwidth is $10$mbps...

sourav.

3.8k views

sourav. asked Aug 31, 2015

4 votes

1 answer

190

GO-BACK-N problem

Suvam Chatterjee

5.0k views

Suvam Chatterjee asked Aug 7, 2015

47 votes

10 answers

191

GATE CSE 2015 Set 3 | Question: 28
Consider a network connecting two systems located $8000$ $\text{Km}$ apart. The bandwidth of the network is $500 \times 10^6$ $\text{bits}$ per second. The propagation speed of the media is $4 \times 10^6$ $\text{meters}$ per ... . Assume that processing delays at nodes are negligible. Then, the minimum size in bits of the sequence number field has to be ______.

Consider a network connecting two systems located $8000$ $\text{Km}$ apart. The bandwidth of the network is $500 \times 10^6$ $\text{bits}$ per second. The propagation sp...

go_editor

14.6k views

go_editor asked Feb 15, 2015

1 votes

3 answers

192

Sliding window size?
In sliding window protocol, assume a 3-bit sequence number field. A and B have windows, which has 3-bit sequence number. If A sends 3 frames and waits for all the 3 acknowledgments until the timer expires. Which of the following "could not be" the sender's "window ... . But ACK's send by receivers may be lost. a. 4 b. 7 c. 6 d. 5 answer is given as 4.

In sliding window protocol, assume a 3-bit sequence number field. A and B have windows, which has 3-bit sequence number. If A sends 3 frames and waits for all the 3 ackno...

Vikrant Singh

5.3k views

Vikrant Singh asked Jan 29, 2015

61 votes

10 answers

193

GATE IT 2004 | Question: 88
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the connection is in slow-start phase with a current transmit window of $4000$ $\text{bytes}$. ... transmit window? $4000$ $\text{bytes}$ $8000$ $\text{bytes}$ $10000$ $\text{bytes}$ $12000$ $\text{bytes}$

Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the co...

Ishrat Jahan

24.0k views

Ishrat Jahan asked Nov 2, 2014

30 votes

5 answers

194

GATE IT 2004 | Question: 83
A $20$ $\text{Kbps}$ satellite link has a propagation delay of $400$ $\text{ms}$. The transmitter employs the "go back $n$ $ARQ$" scheme with $n$ set to $10$. Assuming that each frame is $100$ $\text{byte}$ long, what is the maximum data rate possible? $5$ $\text{Kbps}$ $10$ $\text{Kbps}$ $15$ $\text{Kbps}$ $20$ $\text{Kbps}$

A $20$ $\text{Kbps}$ satellite link has a propagation delay of $400$ $\text{ms}$. The transmitter employs the "go back $n$ $ARQ$" scheme with $n$ set to $10$. Assuming th...

Ishrat Jahan

11.1k views

Ishrat Jahan asked Nov 2, 2014

30 votes

5 answers

195

GATE IT 2004 | Question: 81
In a sliding window $ARQ$ scheme, the transmitter's window size is $N$ and the receiver's window size is $M$. The minimum number of distinct sequence numbers required to ensure correct operation of the $ARQ$ scheme is $\min (M, N)$ $\max (M, N)$ $M + N$ $MN$

In a sliding window $ARQ$ scheme, the transmitter's window size is $N$ and the receiver's window size is $M$. The minimum number of distinct sequence numbers required to ...

Ishrat Jahan

10.6k views

Ishrat Jahan asked Nov 2, 2014

43 votes

8 answers

196

GATE IT 2006 | Question: 68
On a wireless link, the probability of packet error is $0.2$. A stop-and-wait protocol is used to transfer data across the link. The channel condition is assumed to be independent of transmission to transmission. What is the average number of transmission attempts required to transfer $100$ packets? $100$ $125$ $150$ $200$

On a wireless link, the probability of packet error is $0.2$. A stop-and-wait protocol is used to transfer data across the link. The channel condition is assumed to be in...

Ishrat Jahan

13.5k views

Ishrat Jahan asked Nov 1, 2014

60 votes

5 answers

197

GATE IT 2006 | Question: 64
Suppose that it takes $1$ unit of time to transmit a packet (of fixed size) on a communication link. The link layer uses a window flow control protocol with a window size of $N$ packets. Each packet causes an ack or a nak to be generated by the receiver, and ack/nak transmission times are ... $1- \dfrac{ N}{i}$ $\dfrac{i}{(N + i)}$ $1$ $1 - e^{\left(\frac{i}{N}\right)}$

Suppose that it takes $1$ unit of time to transmit a packet (of fixed size) on a communication link. The link layer uses a window flow control protocol with a window size...

Ishrat Jahan

12.9k views

Ishrat Jahan asked Nov 1, 2014

77 votes

6 answers

198

GATE IT 2008 | Question: 64
A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/s}.$ What should be the packet size for a channel utilization of $25\%$ for ... there are no errors during communication. $120\;\text{bytes}$ $60\;\text{bytes}$ $240\;\text{bytes}$ $90\;\text{bytes}$

A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/...

Ishrat Jahan

24.9k views

Ishrat Jahan asked Oct 28, 2014

47 votes

8 answers

199

GATE CSE 2006 | Question: 46
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets are ready and immediately available for transmission. If every $5$th packet that $A$ ... what is the number of packets that $A$ will transmit for sending the message to $B$? $12$ $14$ $16$ $18$

Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets ...

Rucha Shelke

41.6k views

Rucha Shelke asked Sep 26, 2014

55 votes

12 answers

200

GATE CSE 2006 | Question: 44
Station $A$ uses $32\; \text{byte}$ packets to transmit messages to Station $B$ using a sliding window protocol. The round trip delay between A and $B$ is $80\; \text{milliseconds}$ and the bottleneck bandwidth on the path between $A$ and $B$ is $128\; \text{kbps}$ . What is the optimal window size that $A$ should use? $20$ $40$ $160$ $320$

Station $A$ uses $32\; \text{byte}$ packets to transmit messages to Station $B$ using a sliding window protocol. The round trip delay between A and $B$ is $80\; \text{mil...

Rucha Shelke

27.0k views

Rucha Shelke asked Sep 26, 2014

41 votes

6 answers

201

GATE CSE 2014 Set 1 | Question: 28
Consider a selective repeat sliding window protocol that uses a frame size of $1$ $\text{KB}$ to send data on a $1.5$ $\text{Mbps}$ link with a one-way latency of $50$ $\text{msec}$. To achieve a link utilization of $60\%$, the minimum number of bits required to represent the sequence number field is ________.

Consider a selective repeat sliding window protocol that uses a frame size of $1$ $\text{KB}$ to send data on a $1.5$ $\text{Mbps}$ link with a one-way latency of $50$ $\...

go_editor

27.3k views

go_editor asked Sep 26, 2014

25 votes

8 answers

202

GATE CSE 2005 | Question: 25
The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is: $2^n$ $2^{n-1}$ $2^n-1$ $2^{n-2}$

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

Kathleen

38.7k views

Kathleen asked Sep 22, 2014

126 votes

18 answers

203

GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$

Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into ...

Kathleen

48.9k views

Kathleen asked Sep 22, 2014

56 votes

10 answers

204

GATE CSE 2007 | Question: 69
The distance between two stations $M$ and $N$ is $L$ kilometers. All frames are $K$ bits long. The propagation delay per kilometer is $t$ seconds. Let $R$ bits/second be the channel capacity. Assuming that the processing delay is negligible, the $\text{minimum}$ number ... $\lceil \log_2 \frac{2LtR +K}{K} \rceil$ $\lceil \log_2 \frac{2LtR +2K}{2K} \rceil$

The distance between two stations $M$ and $N$ is $L$ kilometers. All frames are $K$ bits long. The propagation delay per kilometer is $t$ seconds. Let $R$ bits/second be ...

Kathleen

18.3k views

Kathleen asked Sep 21, 2014

78 votes

7 answers

205

GATE CSE 2003 | Question: 84
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5$ packets each. Data packets (sent only from $A$ to $B$) are all $1000$ bytes long and the ... ? $7.69 \times 10^6$ Bps $11.11 \times 10^6$ Bps $12.33 \times 10^6$ Bps $15.00 \times 10^6$ Bps

Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5...

Kathleen

28.2k views

Kathleen asked Sep 17, 2014

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true