Round Robin scheduling method is to poll and send according to the number of bytes defined by each queue, and the bandwidth ratio of each queue is equal to the ratio of the number of bytes defined…

The correct answer is A. TRUE. Option A is correct because Weighted Round Robin (WRR) scheduling does exactly this: it polls each queue and transmits a number of bytes proportional to the weight assigned to that queue. If Queue A is assigned 2 bytes and Queue B is assigned 8 bytes, Queue A gets 2/(2+8) = 20%…

QoS

Question

Round Robin scheduling method is to poll and send according to the number of bytes defined by each queue, and the bandwidth ratio of each queue is equal to the ratio of the number of bytes defined by this queue to the sum of the bytes of all queues.

Options

ATRUE
BFALSE

How the community answered

(34 responses)

A
76% (26)
B
24% (8)

Explanation

Option A is correct because Weighted Round Robin (WRR) scheduling does exactly this: it polls each queue and transmits a number of bytes proportional to the weight assigned to that queue. If Queue A is assigned 2 bytes and Queue B is assigned 8 bytes, Queue A gets 2/(2+8) = 20% of bandwidth and Queue B gets 80% - making the bandwidth ratio directly proportional to the defined byte counts.

Option B is wrong because this statement accurately describes how weighted Round Robin works; there is no falsehood in it.

Memory tip: Think of the byte values as "slices of a pie" - each queue's slice size equals its byte count, and the whole pie is the total bytes across all queues. Your bandwidth share is just your slice divided by the whole pie.

Topics

#Round Robin scheduling#Weighted Round Robin#QoS bandwidth allocation#Queue scheduling

Community Discussion

No community discussion yet for this question.

Full H12-821_V1.0 Practice