Rate-based packet scheduling paradigm

One of the most important issues in providing timely and predictable communication services is the packet scheduling algorithms used at the end/intermediate nodes in the network. A generic rate-based scheduling paradigm that can serve as a vehicle for implementing existing well-known rate-based packet scheduling algorithms is presented. The proposed scheduling paradigm is general enough to encompass a wide spectrum of rate-based scheduling algorithms and is flexible enough to allow realisation of several desirable features, e.g., rate enforcement, capability of handling overbooking, and capability of providing rate parameters for traffic monitoring. Its modular design also facilitates realisation of multiple scheduling algorithms in a uniform framework