Search results for sliding-window / GATE Overflow for GATE CSE

1 votes

3 answers

41

CN: Go Back N
Station A needs to send a message consisting of 15 packets to station B' using a sling window (window size 4) and go-back-N error control strategy. All packets are ready and immediately available for transmission. If every 6th packet that A' transmits gets lost (but no Acks from ... of packets that A' will transmit for sending the message to B' ? (a) 29 (b) 33 (c) 27 (d) 25

Station A needs to send a message consisting of 15 packets to station ‘B’ using a sling window (window size 4) and go-back-N error control strategy. All packets are r...

Prasanna

2.1k views

Prasanna asked Jan 4, 2016

0 votes

0 answers

42

Computer Networks
In the given solution , while calculating transmission time why 8 is not multiplied i.e. Length = 2000Byte = 2000 * 8 bits formula is not used.

In the given solution , while calculating transmission time why 8 is not multiplied i.e.Length = 2000Byte = 2000 * 8 bits formula is not used.

Overflow04

570 views

Overflow04 asked Aug 7, 2022

2 votes

0 answers

43

Testseries-doubt
“An SR sender’s window base cannot a have lower sequence number than the receiver window base” can some one explain this statement ? Why it is false

“An SR sender’s window base cannot a have lower sequence number than the receiver window base”can some one explain this statement ? Why it is false

Kabir5454

463 views

Kabir5454 asked Jul 13, 2022

1 votes

1 answer

44

MadeEasy Test Series: Computer Networks -Sliding Window
I am unable to understand their explanation,can anyone explain it in a better way?

I am unable to understand their explanation,can anyone explain it in a better way?

sripo

595 views

sripo asked Jan 5, 2019

43 votes

8 answers

45

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.4k views

Ishrat Jahan asked Nov 1, 2014

0 votes

2 answers

46

Self doubt CN
In the connection termination phase, suppose the FIN segment from the client-side contains data ranging from sequence no 100 to 200, So will the ACK no from the server start from 201 or 202? Will the FIN flag consume 1 extra sequence number at the end, ... context of my question, will that sequence number be 99, before the beginning of the data segment or 201, after the data segment

In the connection termination phase, suppose the FIN segment from the client-side contains data ranging from sequence no 100 to 200,So will the ACK no from the server sta...

tusharb

1.0k views

tusharb asked Jan 24, 2022

1 votes

1 answer

47

GATE Overflow Test Series | Mock GATE | Test 6 | Question: 52
Consider the sliding window flow-control protocol operating between a sender and a receiver over a full-duplex error-free link. Assume the following: The size of the data frame is $4,000$ bits and the size of the acknowledgment ... frames, (rounded to the nearest integer) is needed to achieve a link utilization of $80\%$ is ____________

Consider the sliding window flow-control protocol operating between a sender and a receiver over a full-duplex error-free link. Assume the following:The size of the data ...

Arjun

156 views

Arjun asked Jan 30, 2022

0 votes

1 answer

48

slow start phase self doubt
when no of RTT is asked , i am confused when will start from 1 AND when will start from 2 rest part i known folow until thresold size and then increse with given MSS LET SUPPOSE THRESOLD 20 FOR EX ::: 1 2 4 8 16 20 22 24 26 OR 2 4 8 16 20 22 24 26 in ex 1 no of rtt is 9 while in ex 2 no of rtt is 8 can anyone tell me when we will start 1 and when we will start with 2

when no of RTT is asked ,i am confused when will start from 1 AND when will start from 2rest part i known folow until thresold size and then increse with given MSSLE...

jugnu1337

353 views

jugnu1337 asked Dec 28, 2021

30 votes

5 answers

49

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.5k views

Ishrat Jahan asked Nov 2, 2014

3 votes

6 answers

50

Testbook Test Series: Computer Networks - Sliding Window
packets are being transmitted using GB5 and here every 4th packet is lost.How many packets need to be transmitted to transmit 10 packets? my answr 18 given :20

packets are being transmitted using GB5 and here every 4th packet is lost.How many packets need to be transmitted to transmit 10 packets?my answr 18 given :20

Aboveallplayer

2.4k views

Aboveallplayer asked Jan 15, 2017

2 votes

10 answers

51

UGC NET CSE | January 2017 | Part 3 | Question: 26
Station $A$ uses $32$ byte packets t transmit messages to station $B$ using sliding window protocol. The round trip delay between $A$ and $B$ is $40$ milliseconds and the bottleneck bandwidth on the path between $A$ and $B$ is $64$ kbps. The optimal window size of $A$ is $20$ $10$ $30$ $40$

Station $A$ uses $32$ byte packets t transmit messages to station $B$ using sliding window protocol. The round trip delay between $A$ and $B$ is $40$ milliseconds and the...

go_editor

4.1k views

go_editor asked Mar 24, 2020

5 votes

3 answers

52

In Go-Back-N protocol, if the maximum window size is 127, what is the range of the sequence number?
In Go-Back-N protocol, if the maximum window size is 127, what is the range of the sequence number? A. 0 to 127 B. 0 to 128 C. 1 to 127 D. 1 to 128 Answer given is A Please explain :) Thanks.

In Go-Back-N protocol, if the maximum window size is 127, what is the range of the sequence number?A. 0 to 127 B. 0 to 128 C. 1 to 127 D. 1 to 128Answer given is APlease ...

sunil sarode

13.6k views

sunil sarode asked Oct 6, 2017

3 votes

4 answers

53

Go back N (arq) protocol
Q. If maximum sequence number in Go back N ( arq) protocol is 'n' then window size (sender) is ? If your answer is 'n' or 'n'+1' then please design GBN for sender window 5 and 11 .

Q. If maximum sequence number in Go back N ( arq) protocol is 'n' then window size (sender) is ?If your answer is 'n' or 'n'+1' then please design GBN for sender windo...

Abhi Som

12.8k views

Abhi Som asked Jul 19, 2017

0 votes

1 answer

54

Stop and wait protocol
R=transmission rate S=signal speed D=Distance between sender and receiver T=time to create one frame F=number of bits in a frame N=number of data bits in a frame A=number of bits in an acknowledgement F>N Q.1 Calculate the channel utilization My take: (F/R) / (F/R + 2*D/S + A/R ... .2 Calculate the effective data rate. My take: ( (F/R) / (F/R + 2*D/S + A/R + 2*T) ) * (N/F)

R=transmission rateS=signal speedD=Distance between sender and receiver T=time to create one frameF=number of bits in a frameN=number of data bits in a frameA=number of b...

Prashant Sharma 1

1.0k views

Prashant Sharma 1 asked Jun 22, 2016

7 votes

2 answers

55

GATE Overflow Test Series | Mock GATE | Test 2 | Question: 56
Station $A$ is sending data to station $B$ over a full-duplex error-free channel. A sliding window protocol is being used for flow control. The send and receive window size is being used for flow control with both the window ... link is $200\;\mu s.$ What is the max achievable throughput in this communication in Mega bytes per second?

Station $A$ is sending data to station $B$ over a full-duplex error-free channel. A sliding window protocol is being used for flow control. The send and receive window si...

gatecse

520 views

gatecse asked Jan 17, 2021

1 votes

1 answer

56

me test
Consider two stations communicates via 1 Mbps satellite link with propagation delay of 270 msec. The satellite serves merely to retransmit data received from one station to another, with negligible switch delay. If Ethernet frame size is 1024 bits with 3 bits sequence number, then the maximum possible data throughput is ___(upto 2 decimal places).

Consider two stations communicates via 1 Mbps satellite link with propagation delay of 270 msec. The satellite serves merely to retransmit data received from one station ...

newdreamz a1-z0

602 views

newdreamz a1-z0 asked Jan 5, 2019

3 votes

1 answer

57

GATE Overflow Test Series | Mock GATE | Test 5 | Question: 48
Stations $X$ and $Y$ are connected through a line of bandwidth $128$ kbps. Station $X$ uses $32$ byte packets to transmit messages to $Y$ using a sliding window protocol. The propagation delay between $X$ ... to maximize the line utilization? Assume that the acknowledgement frame is of negligible size and processing delay may be ignored.

Stations $X$ and $Y$ are connected through a line of bandwidth $128$ kbps. Station $X$ uses $32$ byte packets to transmit messages to $Y$ using a sliding window protocol....

gatecse

285 views

gatecse asked Feb 8, 2021

0 votes

5 answers

58

Sliding Window Protocol Question 1
Consider 1 Mbps error-free line , The maximum frame size is 1000 bits .New packets are generated about 1 second apart . Timeout interval is 10m/sec if the special acknowledgement timer were eliminated unnecessary timout would occur . How any times average msg would have been transimitted ? a) Only once b) Twice C) thrice d) None

Consider 1 Mbps error-free line , The maximum frame size is 1000 bits .New packets are generated about 1 second apart . Timeout interval is 10m/sec if the special acknow...

pC

4.5k views

pC asked Jul 6, 2016

3 votes

2 answers

59

NIELIT 2017 DEC Scientific Assistant A - Section B: 43
When we use slow-start algorithm, the size of the congestion window increases _______ until it reaches a threshold. Additively Multiplicatively Exponentially None of the options

When we use slow-start algorithm, the size of the congestion window increases _______ until it reaches a threshold.AdditivelyMultiplicativelyExponentiallyNone of the opti...

admin

2.2k views

admin asked Mar 31, 2020

4 votes

1 answer

60

GATE Overflow Test Series | Computer Networks | Test 1 | Question: 20
Host $P$ is sending data to host $Q$ over a full duplex link. $P$ and $Q$ are using the sliding window protocol for flow control. The send and receive window sizes are $4$ ... $120\;\mu s$. The maximum achievable throughput (in Mbps rounded to one decimal points) in this communication is __________

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

gatecse

370 views

gatecse asked Oct 23, 2020

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