A new scheduler for real-time applications in differentiated services networks
Duc Long Pham, S. Suawara, Takahiro Miki · 2005
In this paper we propose a new scheduler. Deadline fair sharing (DFS), which consists of link scheduling and dropping mechanisms to provide absolute delay and loss guarantees in DiffServ networks. The scheduling mechanism uses dynamic weight associated with each class to schedule the packets and to make a dropping decision when an absolute delay guarantee violation occurs. The dropping mechanism drops packets and detects the onset of an early violation for absolute loss guarantee. When an early violation for the absolute loss guarantee of a class is detected, the scheduling mechanism gives that class more priority for transmitting its packets to prevent that violation. The simulation results show that the proposed scheduler can provide a wide range of absolute loss and delay bounds under various traffic load conditions without controlling the traffic.