Implementation of Start-time Fair Queuing Algorithm in OPNET:

Project Description:

In 1985 Nagle identified the need to guarantee network performance due to the potential for ill-behaved sources to dominate bandwidth [5]. Since then, Fair Queue (FQ) algorithms have been widely adopted as one of the keys methods to regulate traffic at packet forwarding-agents, such as IP routers [2]. A variety of algorithms based on the original FQ concept have been conceived, with different levels of fairness and complexity; one such algorithm is "Start-Time Fair Queuing" (SFC), which provides good fairness without great complexity. The SFC solution is of particular interest because it provides good performance for real-time traffic (which is very sensitive to delay [6]), something that many earlier techniques did not address [4].

In this project we intend to model SFC in Opnet. In addition, a simple network model using SFC will be built and simiulations will be run on it with different types of traffic to evaluate the behaviour of the algorithm, and to compare its performance with other scheduling schemes such as Weighted Fair Queue [3], Priority Queues and Vitual Clock [1].

Simulation will be done using OPNET

References: