Per-flow delay performance in a FIFO scheduler fed by policed UDP sources

Authors:
V. Trecordi;G. Verticale
Affiliations:
CEFRIEL, via Fucini 2, Milan, Italy;CEFRIEL, via Fucini 2, Milan, Italy
Venue:
Computer Communications
Year:
2000

Citing 2
Cited 2

Performance and stability of communication networks via robust exponential bounds

IEEE/ACM Transactions on Networking (TON)
Fundamental limits and tradeoffs of providing deterministic guarantees to VBR video traffic

Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems

Multi-tiered, burstiness-aware bandwidth estimation and scheduling for VBR video flows

Proceedings of the Nineteenth International Workshop on Quality of Service
On flow distribution over multiple paths based on traffic characteristics

ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks

Quantified Score

Hi-index	0.24

Visualization

Abstract

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 packet transmission time, delay probability distribution is equal for every multiplexed source.