Research Article
A New Smoothed Fair Scheduling Algorithm based on Timeslot Reservation
@INPROCEEDINGS{10.4108/infoscale.2007.913, author={Ji Li and Huaxin Zeng and Dengyuan Xu}, title={A New Smoothed Fair Scheduling Algorithm based on Timeslot Reservation}, proceedings={2nd International ICST Conference on Scalable Information Systems}, proceedings_a={INFOSCALE}, year={2010}, month={5}, keywords={fair scheduling quality of service timeslot reservation SUPANET (Single physical-layer User-data-transfer Platform Architecture Network).}, doi={10.4108/infoscale.2007.913} }
- Ji Li
Huaxin Zeng
Dengyuan Xu
Year: 2010
A New Smoothed Fair Scheduling Algorithm based on Timeslot Reservation
INFOSCALE
ICST
DOI: 10.4108/infoscale.2007.913
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.