Project overview

This project aims at comparing different packet scheduling methods that are used now and finding out the best algorithm that can be used for a wireless networks. In the algorithms which we consider, the schedulers are allotted a flow and have to transmit their packets during each flow, using the resources allocated to them. In the normal algorithms, when a flow encounters an error, the scheduler is then allocated a larger resource at a later time so that the flow can be compensated. On the other hand, the Opportunity Based Scheduler is based on the premise that fairness should be ensured in the opportunity given to the flows in the use of resource and not the actual benefit received by the flows from the use of the resource. This strategy emphasizes the schedulers to use the resources more efficiently. In this project we are comparing three algorithms namely Weighted Round Robin, Deficit Round Robin and Opportunity Based Deficit Round Robin. The algorithms are compared based on the throughput values. Finally, we prove that ODRR algorithm is the best among all the three algorithms. The ODRR scheduler is versatile enough for use in allocating resources other than bandwidth and can be used in different contexts such as in ATM, Internet Backbone networks carrying IP packets.