Scheduling CBR Flows: FIFO or Per-flow Queuing?
Jasleen Sahni, Pawan Goyalzand, Harrick M. Vin · 1999
In this paper, we study the effect of using FIFO or fair queuing on the end-to-end delay and jitter observed by CBR traffic in large-scale networks, where: (1) the bandwidth requirement and the packet sizes vary considerably across the CBR flows; (2) the class of CBR flows occupy different fractions of the total link bandwidth; and (3) the class of CBR flows share each network link with several other flows with different packet arrival patterns. Our results provide an empirical basis to evaluate the effectiveness of FIFO and per flow scheduling for CBR flows, as well as guidelines for deploying CBR services in the Internet.