Delay-differentiable fair queueing (D/sup 2/FQ): a low complexity scheduling algorithm for packet-switched networks

Abstract

In a packet-switched network, latency is unavoidable and its characteristic always depends on the type of traffic flows and operating conditions. These affect the kind of services that the network can support as well as the quality of service (QoS) that the system can provide. Providing a fair service for users is always the main concern for operators as well as service providers. A fair delay-differentiable queueing algorithm with QoS support called Delay-Differentiable Fair Queueing (D/sup 2/FQ) is proposed. In the proposed algorithm, an additional delay-slot is used to re-order the departure order of flows according to its delay weight. D/sup 2/FQ can also protect the honest flows in delay and throughput when a node is attacked by defense of service (DoS) and the overall computation of the proposed D/sup 2/FQ is shown to be O(1). Algorithm analysis and simulation results are presented and the performance of D/sup 2/FQ is evaluated.