Dynamic packet scheduler for queuing real time and non real time internet traffic

Abstract

Real-time traffic or flows also called as inelastic traffic is that which enforces timely delivery of flows within a specified period of time. There are several applications which generate these flows like multimedia, audio-video conferencing, webinar, Interactive gaming, webcam, Internet TV etc. An interactive application demands a speedy delivery of flows. Flows reaching the destination after this deadline are considered useless. Real-time traffic imposes rigid demands for the delivery. All the real-time flows should be timely delivered and accumulated at the destination. The proposed Dynamic Scheduler relies on Dynamic Packet Scheduling ratio which is dynamic in nature and the ratio changes dynamically with respect to the flows accumulated in both the queues. Flows are scheduled based on the maximum flows allowed on the path that is calculated by TP max. Packet scheduling is based on the available throughput of the network. This dynamic scheduling results in guaranteed fair treatment of both real-time traffic and non-real time traffic. In the this paper we propose a Dynamic Scheduler, [DPS] which dynamically works according to the available number of flows in both real-time and non-real-time queues.