Refine Priority Queuing Scheduling Algorithm By Applying Time Expired Packets Algorithm

Quality of service (QoS) is a corner stone in recent Internet applications. One of the requirements of achieving QoS in routers is scheduling algorithms. Priority Queuing (PQ) is the simplest most used scheduling algorithm. This algorithm may cause starvation in less priority queues. Time Expired (TE) algorithm is a refine of PQ which discards packets that would reach the receiver out of time. Thus improving through put and delay for less priority queues with the discard of retarded useful packets in time sensitive – loss tolerant Internet applications. A simulation study using OPNET Modeler is carried out. The results show a 20% improvement in throughput of less priority applications. The delay performance is improved for all applications by a factor of 4% to 42%