LVT-SCFQ: A Modified Self Clocked Fair Queueing Algorithm for Broadband Networks

Abstract

A self-clocked traffic scheduling algorithm is proposed by modifying the virtual time function in the well known fair queueing algorithm, SCFQ. It can be shown that by this modification, the fairness index and the packets worst case delay will remain bounded and these bound are the same as those of SCFQ. Then, simulation is invoked to show the effectiveness of our modification, by showing improvements in the distribution and average of delay.

Surveying Best Suitable Scheduling Algorithm for Wimax- Wi-Fi Integrated Heterogeneous Network

“…In addition, the SCFQ algorithm can accomplish easier implementation and it can maintain the fairness attribute in virtual time function. [22,23,24].…”

“…However, the weaknesses of WFQ algorithm are, the start time of a packet is not taken into consideration, and it can lower the scheduler system if many packets occur in the priority region [25,26].…”

“…Since the bandwidth is assigned according to the weights, the algorithm will not provide good performance in the presence of variable size packets. However, WRR method makes certain that all service classes have access to at least some configured amount of network band width to avoid bandwidth starvation [14,25,27]. …”