📝 IntServ Integrated Services in QoS (12 MCQs)
📖 From Data Communication and Networks • 30. Quality of Service • 12 questions available
What is IntServ Integrated Services in QoS?
Integrated Services is a fine-grained QoS architecture that provides end-to-end per-flow guarantees by requiring explicit resource reservation and admission control signaling for every individual stream across all routers in the path.
📝 All IntServ Integrated Services in QoS MCQs
Q1. In weighted fair queuing, the router’s total throughput is . If the highest‑priority class receives , the lowest‑priority class receives , what throughput does the middle‑priority class obtain?
📖 Explanation: The three fractions must sum to 1: . Subtracting the highest and lowest shares () leaves for the middle class, so option B is correct.
Q2. In a leaky‑bucket shaper, the bucket capacity is bytes and the leak rate is bytes per second. If an incoming burst of bytes arrives instantaneously, what happens to the excess bytes beyond the bucket capacity?
📖 Explanation: The bucket can hold at most bytes; any additional bytes cannot be stored and are therefore dropped. The leak rate does not change, so the overflow is lost, making option A correct.
Q3. A token‑bucket regulator has a token generation rate of Mbps and a bucket depth of Mbits. A flow sends packets of size Mbit at an average rate of Mbps. Which statement best describes the regulator’s behavior?
📖 Explanation: The token bucket generates tokens at 1 Mbps, providing a long‑term allowance of that rate. The bucket can store up to 2 Mbits, allowing occasional bursts. When the flow’s average rate exceeds 1 Mbps, tokens are exhausted and packets are queued until new tokens arrive, so packets are delayed but not discarded.
Q4. Which of the following correctly contrasts the leaky‑bucket and token‑bucket mechanisms regarding output traffic burstiness?
📖 Explanation: The leaky‑bucket model releases packets at a constant rate, eliminating bursts, whereas the token‑bucket model permits bursts up to the bucket depth by accumulating tokens. Therefore the leaky bucket smooths traffic and the token bucket allows controlled bursts, making option C correct.
Q5. In weighted fair queuing, how does varying packet size among classes affect the intended share of throughput compared with the ideal fractions ?
📖 Explanation: Weighted fair queuing assumes equal packet sizes; when sizes differ, a class transmitting larger packets consumes more transmission time per packet, potentially gaining a larger share of the link, while a class with smaller packets may fall below its allocated fraction. Thus both effects are possible, making option D correct.
Q6. Consider a router implementing WFQ where the priority weights are adjusted dynamically based on observed delay. If the highest‑priority class begins to experience increased queuing delay, what is the most likely immediate impact on the throughput distribution?
📖 Explanation: When a class suffers higher queuing delay, the scheduler typically reduces its weight to alleviate congestion, thereby lowering its allocated throughput. This reallocation grants additional bandwidth to lower‑priority classes, helping to balance delay across flows. Hence option B reflects the expected immediate impact.
Q7. Using a token‑bucket with token rate and bucket depth , what is the maximum sustained data rate that can be transmitted without incurring delay?
📖 Explanation: The token rate defines the long‑term average rate at which tokens become available. As long as the transmission rate does not exceed , tokens are replenished continuously, preventing any queuing delay. The bucket depth only allows temporary bursts, not sustained higher rates, so option A is correct.
Q8. Which design best combines a leaky‑bucket shaper and a token‑bucket policer to manage a traffic flow that must conform to an average rate of Mbps with occasional bursts up to Mbps lasting no more than ms?
📖 Explanation: The token bucket permits bursts up to 10 Mbps for up to , matching the burst requirement. After the burst, the leaky bucket enforces the average 5 Mbps rate, smoothing traffic. This combination satisfies both average and burst constraints, making option A correct.
Q9. How does Integrated Services (IntServ) guarantee end‑to‑end QoS when packet sizes differ across hops, and what role do token‑bucket parameters play in maintaining those guarantees?
📖 Explanation: IntServ establishes a reservation specifying the maximum bandwidth and latency, typically based on the largest packet a flow may send, ensuring that even in the worst case the network can meet the QoS contract. Token‑bucket parameters at the source enforce the flow’s rate and burstiness so that it conforms to the reserved profile, preserving the guarantee across hops. Hence option B is correct.
Q10. In the token‑bucket algorithm, what does the bucket depth represent?
📖 Explanation: The bucket depth defines the upper limit on the number of tokens that may accumulate in the bucket. It determines the maximum burst size a flow can emit, as each token typically corresponds to one byte or packet. The other choices describe different aspects of the algorithm, making option A the correct definition.
Q11. If a leaky‑bucket shaper has a leak rate of Mbps and the incoming traffic alternates between idle periods and bursts of Mbps lasting s, what is the average output rate over a long interval?
📖 Explanation: The leaky bucket emits at a constant rate Mbps regardless of input bursts, as long as the bucket is not empty. Over a long period, the average output equals the leak rate, because any excess arriving during bursts is buffered and released at . Therefore the average output is 2 Mbps, option A.
Q12. Compare the impact on latency for a flow when using (i) a token‑bucket policer at the ingress and (ii) a leaky‑bucket shaper at the egress. Which statement is true?
📖 Explanation: A policer operates at the network edge by dropping non‑conforming packets without queuing them, so it does not introduce additional delay. In contrast, a shaper (leaky bucket) stores packets that exceed the leak rate and releases them later, thereby adding queuing delay. Consequently, only the shaper contributes to latency, making option B correct.