Haar Wavelet prediction-based Fair Queuing

since the Internet is developing rapidly in size and in complexity as well, it is very hard to adjust quality of service (QoS) parameters. In order to guarantee service quality, efficient resource reservation is needed. The allocation of resources requires a dynamic reconfiguration mechanism that configures a switch, taking into account the incoming traffic fluctuations. This paper presents a new efficient bandwidth allocation algorithm called HaarWavelet prediction-based Fair Queuing (HWFQ) which is designed to schedule bandwidth adaptively, fairly and efficiently among all competing flows. The key feature of the new scheduling scheme is to predict the scheduling weights. The proposed algorithm has no need to prior knowledge about the incoming traffics and complexity of HWFQ algorithm is very low; therefore, it can be simply implemented in routers and switches. The performance of the proposed algorithm is evaluated using ns-2 simulator and compared with static weighted round robin.