ECP-206 practice question 10 of 15
Which two statements are true about priority queuing (PQ)? (Choose two.)
Full set: 60 questionsPriority Queuing (PQ) is a Quality of Service (QoS) scheduling algorithm that services queues based on a strict priority hierarchy. It always dequeues packets from the highest-priority queue first. As long as there are packets in the highest-priority queue, no other queue is serviced. This ensures that the most critical traffic experiences the lowest possible latency and jitter. However, a major drawback of this method is "starvation," where a continuous flow of high-priority traffic can prevent lower-priority queues from ever being serviced, denying them any bandwidth. PQ does not provide minimum bandwidth guarantees.
B. The highest priority queue is not inherently reserved for voice traffic; its use is determined by network policy, though delay-sensitive traffic like voice is a common candidate.
D. PQ provides no minimum bandwidth guarantees. This is a feature of other queuing mechanisms like Class-Based Weighted Fair Queuing (CBWFQ).
1. Cisco Systems
Inc.
"Congestion Management Overview" in QoS: Congestion Management Configuration Guide
Cisco IOS XE Release 3S. The section on "Priority Queuing" states: "PQ ensures that important traffic gets the quickest handling at the expense of other traffic... If traffic in a higher-priority queue is constant
traffic in all lower-priority queues can be completely blocked (a condition called starvation)." This directly supports answers A and C.
2. Kurose
J. F.
& Ross
K. W. (2017). Computer Networking: A Top-Down Approach (7th ed.). Pearson. In Chapter 7
Section 7.2.2 "Scheduling
" the text describes Priority Queuing: "a packet from a low-priority queue can be transmitted only when all of the higher-priority queues are empty... a continuous stream of high-priority packets can block out all low-priority packets." This confirms that high-priority traffic gets minimal delay (A) at the risk of starving low-priority traffic (C).
3. Stallings
W. (2014). Data and Computer Communications (10th ed.). Pearson. In Chapter 19
Section 19.2 "Resource Allocation
" the discussion on "Priority Queuing" explains that this method gives preferential treatment to high-priority packets
which are always chosen for transmission over low-priority packets. It highlights the risk of lower-priority queues being starved for service. This supports both A and C.
Keep practicing
Take the free ECP-206 practice test
Ten exam-style questions with answers and explanations, plus the exam facts and study guides.
More questions
Other ECP-206 practice questions
- Question 1Regarding the BGP decision algorithm, which two statements are correct? (Choose two.)
- Question 2What is the maximum number of unique VLAN IDs available?
- Question 3An IS-IS router has been assigned the NSAP address: 49.00F0.0100.5012.3010.00. What is th…
- Question 4In OSPFv2, which route characteristic is used to determine the best path?
- Question 5Which two statements are true about link-state routing protocols? (Choose two.)
- Question 8Which two statements are true about route summarization? (Choose two.)
