Section 3 – Quality of Service (QoS)

QUESTION 1
Which description describes the low latency queuing algorithm?
A.    Empty queue 1. If queue 1 is empty, empty queue 2, then empty queue 3, unless a packet for a
higher queue arrives.
B.    An administrator defines the traffic classes based on match criteria, including protocols, access
control lists, and input interfaces.
C.    A flow-based algorithm that simultaneously schedules interactive traffic to the front of a queue to
reduce response time and fairly shares the remaining bandwidth among high-bandwidth flows.
D.    This feature brings strict priority queuing to CBWFQ.
E.    Packets are placed into a single queue and serviced in the order they were received.
Answer: D

QUESTION 2
Which description describes the weighted fair queuing algorithm?
A.    Empty queue 1. If queue 1 is empty, empty queue 2, then empty queue 3, unless a packet for a
higher queue arrives.
B.    An administrator defines the traffic classes based on match criteria, including protocols, access control lists, and input interfaces.
C.    A flow-based algorithm that simultaneously schedules interactive traffic to the front of a queue to reduce response time and fairly shares the remaining bandwidth among high-bandwidth flows.
D.    This feature brings strict priority queuing to CBWFQ.
E.    Packets are placed into a single queue and serviced in the order they were received.
Answer: C