Computer Networks CSE 321 (Tutorial Sheet 2 Flow Control)

Q1. A 10,000 bit block is transmitted at 1 Mbps between to computers at a distance of 10km where
signal propagate at het speed of light(2x108m/s) The ratio a = Tp/Tx is
(A) 2 10-2
Q.2

(B) 2 10-3

(C) 5 10-3

(D) 5 10-4

If the time to transmit a block is 1ms, and the round trip time on a communications link is 5ms,
the utilization of stop & wait protocol will be
[A] Under 9%

Q.3

(B) Greater than 20% (C) Approx. 20%

(D) exact 10%

Assuming a block size of 1000 bits, and a transmission rate of 1Mbps, over a terrestrial link of
20km, sliding window of size 3, no errors, and the link utilization is approximately, assume the
signal propagate at the speed of light.
(A) 50%

Q.4

(B) 100%

(C) 15%

(D) 30%

If a 16 KB packet is sent over a 1000 m fiber channel whose propagation speed is 2 x 10 8

m/sec, what is the propagation delay of the channel?
(A) 65msec

Q.5

Q.6

(B) 5

(C) 0.6 sec

(D) 7.6 msec

In a sliding window protocol the frames to the left of the receiver window are frames
(A) received but not acknowledged

(B) Received and acknowledged

(C) not received

(D) not sent

Using 5-bit sequence numbers, what is the maximum size of the send windows for Stop-andWait ARQ, Go-Back-N ARQ and Selective-Repeat ARQ protocols?
(A) 1, 32, 16

Q.7

(B) 31, 31, 16

(C) 1, 31, 16

(D) 32, 16, 31

In case of Go-Back-N ARQ protocol, for 10 data packets sent,

acknowledgements

may be receive
(A) 1

(B) 5

(C) Exactly 10

(D) all of the above

Consider the following Sliding Window Protocol Parameters for next four questions
n = number of packets within the window
L = Packet size in bits = 10 Kb
R = link rate in bits/second = 10 Mbps
RTT = Round Trip Delay in seconds, = 99 msec
W = Window Size in bits = n*L
Q.8

How long does it take to send the first packet?

(A) 1 ms

(B) 8 ms

(C) 1.5

Course Coordinator (Dr. Praveen Kaushik)

(D) 1

Computer Networks CSE 321 (Tutorial Sheet 2 Flow Control)

Q.9

For an effective rate of 1 Mbps, how many packets must be sent within one window (i.e. what
value of n is required)?
(A) 10

Q.10

(B) 11

(C) 12

(D) 9

Using a round trip delay value of 100msec, what is the Bandwidth-Delay product for this
problem, how many packets can be in transit and what is the link utilization when we set n to
this value?
(A) 1Mb, 100, 100% (B) 1Mb, 50, 75%

Q.11

(C) 1.5Mb, 100, 50% (D) None of the opt.

In a sliding window Go-Back-N ARQ system, A sends packets 0,1,2,3,4,5 and 6. Packet 3
arrives at B corrupted. What do A and B send to each other next?
(A) B sends REJ-3, A then sends packets 3,4,5,6,7,0 and 1
(B) B sends REJ-2, A then sends packets 3,4,5,6,7,0 and 1
(C) B sends REJ-3, A then sends just packets 3
(D) B sends REJ-2, A then sends just packets 3

Q.12

Consider a sliding window protocol operating at the data link layer between two stations 1000
kilometers apart, directly connected by an error-free 1.0 Mbps link. The frame sizes used are
500 bits, of which 50 bits are header and 450 bits are data. Ack frames are 100 bits, and frame
processing time is 100 microseconds. Assume that the signal propagation delay is 10
. If a window size of W = 10 is used, then the efficiency of the channel is:
(A)

10%

(B)

25%

(C)

33%

(D)

17%

For next two questions consider the stop-and-wait protocol on a wired link between nodes A
and B.
Suppose that the propagation delay in each direction is 10ms. The transmission rate is 10
Mbps. Assume that date packet size is 1000 bytes, and Ack is 40 bytes.
Q.13

What is the maximum data throughput (in packets/second) achievable using the stop-and-wait
protocol, if none of the packets are lost?

Q.14

(A) 348 packets per second

(B) 48 packets per second

(C) 35 packets per second

(D) 50 packets per second

What is the maximum data throughput (in packets/second) achievable using the stop-and-wait
protocol, If data packets are lost with probability 0.1, but Ack packets are never lost?
(A) 31.5 packets per second

(B) 345.6 packets per second

(C) 81.9 packets per second

(D) 43.2 packets per second

Course Coordinator (Dr. Praveen Kaushik)

Computer Networks CSE 321 (Tutorial Sheet 2 Flow Control)

Q.15

Suppose you are designing a sliding window protocol for 1-mbps link which has a one-way
latency of 1.25 seconds. Assuming that each frame carries 1 KB of data, what is the minimum
number of bits you need for sequence number?
(A) 9 bit

Q.16

(C) 11 bit

(D) 12 bit

In go-back-N ARQ, if frames 4,5 and 6 are received successfully, the receiver may not send
ACK
(A) 5

Q.17

(B) 10 bit

to the sender.
(B) 6

(C) 7

(D) 8

Two computers A and B have been connected with an unreliable link with a one-way
propagation delay of 50 ms (milliseconds). The link speed is 1 Mbps. The length of data
packets from A to B is 10 Kb, and the length of the ACK packets is negligible compared to the
length of data packets. If sliding window protocol is used for flow control what is optimum
window size?
(A) 9

(B) 10

(C) 11

(D) 12

For next two questions consider a link of length 1000 miles with a 1 Gb/s data rate connection
a sending and receiving node. Assume a fixed packet length of 1250 bytes. Assume that the
sender always has packets to send. Finally, assume that packets are never lost or corrupted and
propagation delay is 1 Killometer/
Q.18

What is the utilization of this link for a stop-and wait (SAW) protocol?
(A) 0.1%

Q.19

(B) 0.62%

(C) 6.2%

(D) 0.31%

What is the necessary window size to achieve 100% utilization for a sliding window (SW)
protocol?
(A) 1000

(B) 321

(C) 642

(D) 800

For next four questions consider a sender A and a receiver B are connected by a 1.544 Mbps
30 km long link. Propagation speed in copper is about 0.77c. (Use c = 3*10 8 m/s.). The data
Link protocol used is Stop-and-Wait, and the total frame size (including flags, trailers, etc.) is
1,000 Byts. The ACK frame is only 2 Bytes long. Assume that processing time (e.g. checking
the CRC) is negligible.
Q.20

A starts sending a data frame at t = 0. What is the earliest time when B can start transmitting
ACK frame?
(A) 5.31 ms

Q.21

(B) 5.18 ms

(C) 0.78 ms

(D) 5.45 ms

What is the earliest time when A finishes receiving the ACK frame?
(A) .31 ms

(B) 5.18 ms

(C) 0.78 ms

Course Coordinator (Dr. Praveen Kaushik)

(D) 5.45 ms

Computer Networks CSE 321 (Tutorial Sheet 2 Flow Control)

Q.22

How many frames can A transmit per second?

(A) 187 fps

(B) 193 fps

(C) 188 fps

(D) 183 fps

Q.23 In the problem above, what percent of the bandwidth is A actually using if it has always data to
transmit?
(A) 95%
Q.24

(B) 97%

(C) 90%

(D) 100%

Stop-and-wait protocol is used for flow control over a link that is 2km long, with 10Mbps
capacity, and 10% packet error rate. Signal propagation speed is 2* 108 m/s and packet length
is 1000bits. What is the efficiency of this protocol?
(A) 75%

Q.25

(B) 25%

(C) 81%

(D) 100%

With Selective Repeat protocol, if the number of bits for sequence number is N bits
(A) The maximum window size 1
(B) The maximum window size is 2^N -1
(C) The maximum window size is N
(D) The maximum window size is (2^N)/2

Q.26

The term piggy backing applied to data link protocols refers to

(A) The incorporation of acknowledgements in data frames
(B) The ability to concatenate multiple data frames
(C) An error control technique

Q.27

(D) None of the above

Assume that the selective repeat data link protocol uses 3-bit sequence number. When the
lower and the upper edges of the senders sliding window are 6 and 1, respectively, what will
be the lower and upper edges of the receivers sliding window?
(A) 5 and 0

Q.28

(B) 6 and 4

(C) 0 and 6

(D) None of the above

In Go-Back N ARQ, if frame 4, 5 and 6 are received correctly then the receiver may send
acknowledgement to the sender?
(A) 5

Q.29

(B) 6

(C) 7

(D) Any of the above

Suppose we are using sliding window protocol for communication between two stations. We
have defined certain constants on senders end for the proper working of protocol. They are as
follows:
(i) SWS: Sender Window Size
(ii) LAR: Last Acknowledgement Received
(iii) LFS: Last Frame Sent
Which of the following relation always hold between all the three constants defined?

Course Coordinator (Dr. Praveen Kaushik)

Computer Networks CSE 321 (Tutorial Sheet 2 Flow Control)

Q.30

(A) LAR LFS

SWS

(B) LFS LAR

SWS

(C) SWS LFS

LAR

(D) SWS LAR

LFS

Suppose we are using sliding window protocol for communication between two stations. We
have defined certain constants on receivers end for the proper working of protocol. They are
described as follows along with their purpose:
(i) RWS: Receiver Window Size
(ii) LFA: Last Frame Acceptable
(iii) LFR: Last Frame Received
Which of the following relation always hold between all the three constants defined?
(A) LFA LFR

RWS

(B) LFR LFA

RWS

(C) LFA LFR

RWS

(D) LFA LFR

RWS

Course Coordinator (Dr. Praveen Kaushik)

Computer Networks CSE 321 (Tutorial Sheet 2 Flow Control)

Answer Keys

Q.01

Q.16

Q.02

Q.17

Q.03

Q.18

Q.04

Q.19

Q.05

Q.20

Q.06

Q.21

Q.07

Q.22

Q.08

Q.23

Q.09

Q.24

Q.10

Q.25

Q.11

Q.26

Q.12

Q.27

Q.13

Q.28

Q.14

Q.29

Q.15

Q.30

Course Coordinator (Dr. Praveen Kaushik)