WF/sup 2/Q-M : a worst-case fair weighted fair queueing with maximum rate control
Jeng-Farn Lee, Meng Chang Chen, Yeali S. Sun · 2004
Maximum rate control in a shared channel is important to service providers and carriers for various reasons. Previous approaches either use a concatenation of regulator and scheduler, which employs two set of queues and two management systems, or a policer in front of scheduler. The former requires extra management overhead and inaccuracy, and the latter causes bursty traffic as well as inaccuracy. In this paper, we propose a new scheduling algorithm, called WF/sup 2/Q-M (worst-case fair weighted fair queueing with maximum rate control), to simultaneously support maximum rate control and provide minimum service rate guarantee. WF/sup 2/Q-M has similar worst case time complexity with WF/sup 2/Q designed to provide accurate scheduling. WF/sup 2/Q-M employs virtual clock adjustment to distribute the excess bandwidth of saturated sessions to other sessions without recalculating their virtual starting and finishing times. WF/sup 2/Q-M performance is theoretically bounded by a fluid reference mode, and simulations show WF/sup 2/Q-M performs just as claimed.