ODRR gethu

Along with the ODRR algorithm we have implemented two other algorithms and have compared their performance based on the throughput using the network simulator software. The other two algorithms are Weighted Round Robin and Deficit Round Robin algorithms. Our ultimate aim is to prove that ODRR algorithm is efficient than the other two algorithms. Weighted Round Robin (WRR) and Deficit Round Robin (DRR) do not consider the fact that errors are due to the fault of transmitter (flow) rather than the network. They end up allotting more bandwidth and other resources for the flows which utilizes them inefficiently. But ODRR algorithm penalizes the flows which do not utilize the allocated resources properly by giving them fewer resources. WRR and DRR does not consider what happens after the packets is transmitted. These algorithms simply ensure fairness in scheduling. But ODRR intends to monitor the packets even after they are transmitted and maintains fairness in opportunity given to the flow and at the same time measures the efficiency with which the opportunity given to the flow was utilized. Based on these things, it allots the resources during the next opportunity. The scheduler is versatile enough that the measurement of efficiency of utilization of resources can be based on throughput as well as power. So this algorithm which we propose is well suited for both wireless LANs and power conscious wireless sensor networks. The ODRR algorithm and the other two algorithms which were considered, fall under the category of frame based work conserving algorithms.