Weighted start-time fair queuing: a new start-time fair queuing for elastic traffic

In this paper, we present a new Start-time Fair Queuing (SFQ) algorithm called Weighted Start-time Fair Queuing (WSFQ) which is more efficient and achieves better fairness than SFQ in the presence of small and huge elastic traffic flows. WSFQ scheduler, like SFQ uses a start time eligibility criterion to select packets and when the start-time of two packets in two flows are the same, it acts like Weighted Fair Queuing (WFQ) which selects the smallest virtual finish time first. Afterward, we compared the performance of our model with that of the applied scheduling algorithms such as First-In-First-Out (FIFO), SFQ as well as WFQ on the end-to-end delay and the throughput in small and large-scale networks. Our analysis demonstrates that our proposed model is suitable for elastic services networks since it achieves low end-to-end delay for elastic applications as well as providing fairness which is desirable for elastic traffic regardless of variation in one misbehaving flow.