A hybrid scheduling algorithm with low complexity: Jumping Virtual Clock Round Robin

Multimedia applications will be common in the future Internet and they induce diverse requirements of quality of service (QoS). Hence, the QoS issues are important and worth studying. Scheduling algorithm plays an important role in the provision of QoS. In general, good performed scheduling algorithms are with high complexity, for example Weighted Fair Queueing. The complexity comes from calculating virtual time and selecting next queue. There are some scheduling algorithms, e.g. VirtualClock, Self-Clock Fair Queueing, and Leap Forward Virtual Clock, are developed to reduce the complexity of calculating virtual time. Except there are some problems in these algorithms, the complexity of selecting next queue still exists. In this paper, a hybrid scheduling algorithm is developed to solve these problems and still has O(1) complexity of calculating virtual time and selecting next queue. It is Jumping Virtual Clock Round Robin (JVCRR), which combines dynamic JVC and static RR.