Core-stateless fair rate estimation fair queuing

Abstract

Core-stateless mechanisms, such as core-stateless fair queuing (CSFQ), reduce the complexity of fair queuing, which usually need to maintain state, manage buffers, and perform flow scheduling on a per flow basis. However, they require executing label rewriting and dropping decision on a per packet basis. This complexity may prevent them from being widely deployed. In this paper, we proposed a novel architecture based on CSFQ without per-packet labeling. Similarly, we distinguish edge routers and core routers. Edge routers maintain per flow state; they employ a fair queuing mechanism to allocate each flow a fair bandwidth share locally and a token bucket mechanism to regulate those flows with feedback packets sent from egress edge routers. Core routers do not maintain per flow state; they use FIFO packet scheduling extended by a fair rate alarm mechanism that uses an estimate of active flow number based on a matching-mismatching algorithm. The novel scheme is called core-stateless fair rate estimation fair queuing (CSFREFQ). We present and discuss simulations on the performance under different traffic scenarios.