Per-flow delay performance in a FIFO scheduler fed by policed UDP sources
We consider a FIFO multiplexer fed by UDP sources policed by a token bucket and investigate whether aggregate treatment instead of per-flow queuing determines unfair bandwidth allocation or not. Our main result is the development of a procedure for the upper bounding of per flow delay probability distributions both in the homogeneous source problem and the heterogeneous case. We also report extensive simulation results and conclude that, for time scales higher than packer transmission time, delay probability distribution is equal for every multiplexed source. (C) 2000 Elsevier Science B.V. All rights reserved.
ip-over-atm packer-over-sonet integrated services