In this paper, we investigate the fundamental trade-offs in aggregatepacketscheduling for support of guaranteed delay service. In our study, we consider two classes of aggregate packet scheduling algorithms: the sta...
详细信息
In this paper, we investigate the fundamental trade-offs in aggregatepacketscheduling 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 aggregatepacketscheduling ( and together with the simple FIFO packetscheduling 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.
暂无评论