An efficient expression of the timestamp and period in packet-and cell-based schedulers
Department of Electrical and Computer Engineering
Master of Science
Carpinelli, John D.
Scheduling algorithms are implemented in hardware in high-speed switches to provide Quality-of-Service guarantees in both cell-based and packet-based networks. Being able to guarantee end-to-delay and fairness, timestamp-based fair queuing algorithms, which include SCFQ, WFQ, WF2Q and WF2Q+, have received much attention in the past few years. In timestamp-based fair queuing algorithms, the size of timestamp and period determines the supportable rates in terms of the range and accuracy. Furthermore, it also determines the scheduler's memory in terms of offchip bandwidth and storage space. An efficient expression can reduce the size of the timestamp and period without compromising the accuracy. In this thesis, we propose a new expression for the timestamp and period, which can be implemented in hardware for both high-speed packet-based and cell-based switches. As compared to fixed-point and floating-point number expressions, when the size is fixed, the proposed expression has a better accuracy.
njit-etd2001-003 (56 pages ~ 3,768 KB pdf)
Please complete this Feedback Form to inform us about your experience using this website. It will assist us in better serving your information needs in the future. Thank You!
Created August 20, 2001