A priority based packet scheduler with deadline considerations

QoS issues have become a focal point of research on next generation networks (NGNs). In order to supply the various QoS requirement for different kinds of applications, new scheduling policies need to be developed and evaluated. This paper introduces a new kind of packet scheduler which tries to integrate an important QoS parameter (the delay) with the classical schedulers. The two sets of algorithms introduced; static priority with deadline considerations (SPD) and dynamic priority with deadline considerations (DPD); not only simplify the complexity and overhead of a classical earliest deadline first (EDF) or static priority (SP) algorithm, but also provide a better QoS based on the results of the simulations conducted