Simulation and Analysis of Weighted Fair Queuing Algorithms in OPNET
Zirong Guo, Huaxin Zeng · 2009
Various network applications have different quality of service requirements. The capability to provide flow based QoS support has become very important for the design of modern switches and routers. GPS is an idealized fluid model that can provide flow based performance guarantees, various packet approximation algorithms of GPS were proposed in literatures. These packet fair queueing algorithms can provide the desired performance, and they are often regarded as reference for research on routers and switches. In this paper, we model and simulate OQ switches using various fair queueing algorithms in OPNET, and evaluate their delay and fairness performance in single switch node and multiple switch node case.