A new smoothed fair scheduling algorithm based on timeslot reservation

Authors:
Ji Li;Huaxin Zeng;Dengyuan Xu
Affiliations:
Southwest Jiaotong University, Chengdu, China;Southwest Jiaotong University, Chengdu, China;Chongqing JiaoTong University, Chongqing, China
Venue:
Proceedings of the 2nd international conference on Scalable information systems
Year:
2007

Citing 8
Cited 0

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Delay guarantee of virtual clock server

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Generalized guaranteed rate scheduling algorithms: a framework

IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms

IEEE/ACM Transactions on Networking (TON)
SRR: an O(1) time-complexity packet scheduler for flows in multiservice packet networks

IEEE/ACM Transactions on Networking (TON)
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the background of SUPANET, this paper present a novel fair scheduling algorithm, which we call Smoothed Fair Scheduling based on Timeslot Reservation (TRSFS). TRSFS decomposes the data scheduling process into two stages: 1) data-queues generate and sent out schedule-requests at fixed rate according to the reserved timeslots and 2) The arbiter serves schedule-requests in the FIFO manner. By exactly emulating the idealized fair scheduling, TRSFS realized the design purpose of distributing the output traffic evenly. We also prove theoretically that TRSFS is a Guarantee Rate scheduling algorithm with good scheduling constant. Through parallel and distributed technology, TRSFS can be implemented easily in high-speed networks to provide quality of service due to its simplicity and the feature of asynchronous operation.