EC3022D Computer Networks, Winter 2024-25 Problem-set V.
5a
EC3022D Problem-set V.5a with Answer Key
Last updated: March 5, 2025
I. Q O S BASICS Answer: (b).
1) Internet’s best effort service model
6) Use of multiple video encodings for stored video
a) does not guarantee ordered delivery
a) reduces QoS
b) guarantees successful packet delivery
b) reduces buffering events
c) guarantees bandwidth
c) reduces network bandwidth
d) guarantees delay
d) reduces jitter
2) Let per-packet delay of following applications be
Answer: (b).
denoted by
• Stored video streaming: S 7) Consider visualization of timeline of generation
• Live video streaming: L and consumption of segments of conversational
• Conversational video: C video with fixed network delay. Slope of line
• File transfer: F representing generation of segments
Which of the following is desirable?
a) cannot be less than one
a) S<L<C<F b) can only be one
b) F <C<L<S c) is greater than one
c) C<L<S<F d) can be less than or equal to one.
d) L<S<C<F
Answer: (d).
3) QoS mechanisms operate
a) only in application layer 8) Consider visualization of timeline of generation
b) only in transport layer and consumption of segments of conversational
c) only in transport layer video with fixed network delay. Lines represent-
d) across many layers ing generation of segments and consumption of
segments are parallel if
II. V IDEO Q O S MECHANISMS
a) Network delay is small
4) Multiple video encodings is a QoS mechanism at b) Network delay is large
a) link layer c) Network delay is fixed
b) network layer d) Network delay is variable
c) transport layer Answer: (c).
d) none of the above
5) Use of multiple video encodings for conversational 9) Playout buffer is useful when
video a) network delay is low and jitter is low
a) reduces QoS b) network delay is high and jitter is low
b) reduces packet loss c) network delay is high and jitter is high
c) reduces network bandwidth d) none of the above
d) reduces jitter Answer: (c).
1
EC3022D Computer Networks, Winter 2024-25 Problem-set V.5a
10) Jitter is least for d) 20%
a) network delay is 500 ms e) 80%
b) network delay distributed as unif [100, 200] Answer: (d).
ms
c) network delay distributed as unif [100, 300]
III. ROUTER Q O S MECHANISMS : FIFO,
ms
P RIORITY, ROUND - ROBIN
d) network delay distributed as unif [100, 400]
15) Priority based queuing in routers is a QoS mech-
ms
anism at
Answer: (a).
a) link layer
11) Reducing playout delay b) network layer
a) makes user experience less interactive c) transport layer
b) increases risk of packet loss d) application layer
c) reduces risk of packet loss 16) In priority based QoS mechanism in routers, higher
d) increases network delay priority is assigned to flows requiring
Answer: (b). a) low latency
b) low bandwidth
12) Increasing playout delay c) low jitter
a) makes user experience less interactive d) high latency
b) increases risk of packet loss Answer: (a).
c) reduces network delay
d) makes user experience more interactive 17) Suppose there are two flows A and B being served
by a queue. If all previous packets of both flows
Answer: (a).
were served long ago, and packets A1 (first),
13) Consider conversational video being sent over a B1, A2, A3, B2 (last) of the flows arrive almost
network, where a segment has network delay dis- together but in that order.
tributed as unif [100, 200] ms. If maximum accept- What is the order in which packets leave the queue
able segment loss rate is 10%, playout delay should under (indicate the first packet served leftmost, and
be so on)
a) greater than or equal to 100 ms a) FIFO:
b) lesser than or equal to 110 ms b) round robin:
c) greater than or equal to 190 ms
IV. ROUTER Q O S MECHANISMS :
d) lesser than or equal to 200 ms
ROUND - ROBIN WITH BIT- LEVEL FAIRNESS ,
e) greater than or equal to 210 ms
WFQ, DRR
Answer: (c).
18) Basic round robin scheduling may not be bit level
14) Consider conversational video being sent over a fair if
network, where a segment has network delay dis- a) latency is high
tributed as unif [100, 200] ms. If playout delay is b) queue output bandwidth is low
180 ms, segment loss rate is c) datagram sizes are large
a) 0% d) datagram sizes are unequal
b) 5% 19) Consider two flows, pink flow and blue flow, with
c) 10% high packet arrival rate (there are always packets
2
EC3022D Computer Networks, Winter 2024-25 Problem-set V.5a
to serve in the queue). Pink packets’ size is 300
B and Blue packets’ size is 900 B. Percentage of
queue output bandwidth available to pink packets
under (express answer as percentage)
a) round robin without bit-level fairness:
b) round robin with bit-level fairness:
c) WFQ with all weights equal to one:
d) WFQ with pink flow’s weight equal to
one and blue flow’s weight set to three:
20) Compared to round robin with bit-level fairness,
DRR has
a) lower complexity
b) same complexity
c) higher complexity
d) none of the above