Requirements for a scheduling algorithm

There are different packet scheduling algorithms for wireless networks which tries to ensure fairness and QoS. A scheduling algorithm must satisfy the following requirements. It should be easier to implement and the order of complexity should be o (1) not o (N). Performance bounds should be deterministic or statistical. Other parameters like Bandwidth, delay, jitter and loss should be easy to monitor and all these values should be close to optimum values. Fairness and protection should be ensured to each and every flow that is associated with a link. In our project we are considering three such algorithms and compare their performance based on the throughput and bandwidth analysis. The algorithms are Weighted Round Robin, Deficit Round Robin and Opportunity based Deficit Round Robin.