Fundamental trade-offs in aggregate packet scheduling

作     者：Duan, ZH Zhang, ZL Hou, YWT 

作者机构：Florida State Univ Dept Comp Sci Tallahassee FL 32306 USA Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA Virginia Tech Bradley Dept Elect & Comp Engn Blacksburg VA 24061 USA 

出 版 物：《IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS》 (IEEE Trans Parallel Distrib Syst)

年 卷 期：2005年第16卷第12期

页      面：1166-1177页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Science Foundation, NSF, (EIA-9818338, ITR ANI-0085824, NCR-9734428) National Science Foundation, NSF 

主　　题：packet scheduling algorithms aggregate packet scheduling algorithms quality of services (QoS) performance analysis 

摘      要：In this paper, we investigate the fundamental trade-offs in aggregate packet scheduling for support of guaranteed delay service. In our study, we consider two classes of aggregate packet scheduling algorithms: the static earliest time first (SETF) and dynamic earliest time first ( DETF). Through these two classes of aggregate packet scheduling ( and together with the simple FIFO packet scheduling algorithm), we show that, with additional timestamp information encoded in the packet header for scheduling purposes, we can significantly increase the maximum allowable network utilization level, while, at the same time, reducing the worst-case edge-to-edge delay bound. Furthermore, we demonstrate how the number of the bits used to encode the timestamp information affects the trade-off between the maximum allowable network utilization level and the worst-case edge-to-edge delay bound. In addition, the more complex DETF algorithms have far superior performance than the simpler SETF algorithms. These results illustrate the fundamental trade-offs in aggregate packet scheduling algorithms and shed light on their provisioning power in support of guaranteed delay service.