Summary: A Compressed and Dynamic-range-based Expression
of Timestamp and Period for Timestamp-based Schedulers *
Dong Wei
, Nirwan Ansari
, and Jianguo Chen

Advanced Networking Lab
New Jersey Institute of Technology

Bell Labs
Lucent Technologies
*
This work has been supported in part by the New Jersey Commission on Science and Technology via the NJ Center for Wireless
Telecommunications, and the New Jersey Commission on Higher Education via the NJ I-TOEWR project.
Abstract ­ Scheduling algorithms are implemented in high-
speed switches to provision Quality-of-Service guarantees in
both cell-based and packet-based networks. Being able to
guarantee end-to-end delay and fairness, timestamp-based fair
queuing algorithms have received much attention in the past few
years. In timestamp-based fair queuing algorithms, the size of

Source: Ansari, Nirwan - Department of Electrical and Computer Engineering, New Jersey Institute of Technology

Collections: Engineering