Proportional nested deficit round robin with credit adjusting

In recent years, many fair packet scheduling algorithms have been proposed for switches and routers to provide the quality of service (QoS) guarantees required by many applications. In addition to the fairness and low end-to-end delay that these algorithms have to have, simplicity and scalability are two significant factors that play an important role. In this paper, we present proportional nested deficit round robin with credit adjusting (PNDRR-CA), which is a modified version of PNDRR. PNDRR-CA has a low latency and reduces burstiness. PNDRR-CA takes advantage of the input traffic pattern and decreases the serving size of flows when the input traffic contains many small packets. This helps to interleave packets in many practical scenarios, such as the Internet, where the majority of packets are relatively small. The latency and fairness of PNDRR-CA are studied and compared to other algorithms using simulation