Local flow separation
Vincenzo Liberatore · 2004
This paper elaborates on a paradigm for quality-of-service (QoS) that is local, i.e., it does not depend on multinode cooperation. In order to maintain short queuing delays, we individuate flows that occupy a large fraction of a buffer and segregate those flows into a separate queue. The algorithm is provably fair and can avoid all packet reorderings. We show through extensive simulations that state requirements are minimal, and that other flows will benefit from short queuing delays while aggressive flows can still maintain high throughput.