Which description describes the low latency queuing algorithm?

Which description describes the low latency queuing algorithm?

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.

Explanation:
A & C denotes to weighted fair queue or DWFQ. B denotes to CBWFQ (class based
weighted fair queue).
Link:

http://www.cisco.com/en/US/docs/ios/12_1/qos/configuration/guide/qcdconmg.html#wp1001019



Leave a Reply 0

Your email address will not be published. Required fields are marked *