Fundamental trade-offs in aggregate packet scheduling

Zhi-Li Zhang; Zhenhai Duan; Yiwei Thomas Hou

doi:10.1117/12.434407

25 July 2001 Fundamental trade-offs in aggregate packet scheduling

Zhi-Li Zhang, Zhenhai Duan, Yiwei Thomas Hou

Proceedings Volume 4526, Scalability and Traffic Control in IP Networks; (2001) https://doi.org/10.1117/12.434407
Event: ITCom 2001: International Symposium on the Convergence of IT and Communications, 2001, Denver, CO, United States

Abstract

In this paper we investigate the fundamental trade-offs in aggregate packet scheduling for support of guaranteed delay service. In particular, we study the relationships between the worst-case edge-to-edge delay (i.e., the maximum delay experienced by any packet across a network domain), the (maximum) allowable link utilization level of a network and the ``sophistication/complexity'' of aggregate packet scheduling employed by a network. In our study, besides the simple FIFO packet scheduling algorithm, we consider two classes of aggregate packet scheduling algorithms: the static earliest time first} (SETF) and dynamic earliest time first (DETF). In both classes additional control information is encoded in the packet header for scheduling purpose: in the class of SETF, packets are stamped with its entry time at the network edge, and they are scheduled in the order of their (network entry) time stamps at a router; in the class of DETF, the packet time stamps are modified at certain routers as packets traverse them. Through these two classes of aggregate packet scheduling, we show that, with additional time stamp control information encoded in the packet header for scheduling purpose, we can significantly increase the (maximum) allowable link utilization level of a network, and at the same time reduce the worst-case edge-to-edge delay bound. 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.

Citation Download Citation

Zhi-Li Zhang, Zhenhai Duan, and Yiwei Thomas Hou "Fundamental trade-offs in aggregate packet scheduling", Proc. SPIE 4526, Scalability and Traffic Control in IP Networks, (25 July 2001); https://doi.org/10.1117/12.434407

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available