DFQ with CSFQ: low complexity scheduler for low delay bounds flows

Interactive network applications, such as VoIP or streaming using the interactive MPEG4, need to transfer their packets with low delay bounds. Because waiting time at routers influences the transfer time on the Internet, it is necessary to improve scheduling algorithm for the purpose of transferring packets of such classes with low delay. The DFQ scheduling algorithm is suitable for guaranteeing the delay bounds of such packets, but its complexity might be a bottleneck if many flows are running simultaneously. We propose DFQ with CSFQ (core stateless fair queueing), which reduces the complexity of DFQ, maintains the maximum delay bound and fairness of bandwidth allocation, and evaluates its performance. Then, we propose DFQ with RFQ, which is the extended version of DFQ, with CSFQ.