Dynamic audit fair queueing

Many core-stateless bandwidth management mechanism s have been proposed to resolve the scalability problem of the core routers, but they heavily rely on the edge routers or anterior core routers to attach correct flow information to departure packets. The relevance may result in extremely unfair bandwidth sharing among populated flow s; therefore, die dynamic audit fair queueing (DAFQ ) scheme is proposed in this paper which is capable of supporting robust fairness of bandwidth sharing. The main idea of the DAFQ is to detect the malicious flow s and then adequate control policies are applied to restrain those ones. Furthermore, a simple probabilistic model is adopted to determine the detection period that is not only simple but effective to capture the randomly generated malicious flow s. Computer simulation compares the fairness of the DAFQ with that of some wellknown mechanism s. The simulation results show that the DAFQ is suitable to be deployed in the high-speed core routers due to its simplicity. Besides, the DAFQ is able to support robust fairness of bandwidth sharing m ore than the other compared mechanism s under various traffic situations.