Dynamic Packet Scheduler for Queuing Real Time and Non Real Time Internet Traffic
P. Shanmugaraja1, K. Chokkanathan2, J. Anitha3, A. Parveen Begam4, N.Naveenkumar5

1P. Shanmugaraja, Department of Information Technology, Sona College of Technology, Salem, India.
2K. Chokkanathan, Department of MCA, Madanapalle Institute of Technology and Science, Madanapalle, India.
3J. Anitha, Department of Computer Science and Engineering, Dhayanand Sagar Academy of Technology and Management, Bangalore.
4A. Parveen Begam, Department of Computer Science and Engineering, Taibah University, Yanbu, Saudi Arabia.
5N. Naveen Kumar, Department of MCA , Madanapalle Institute of Technology and Science, Madanapalle, India.

Manuscript received on 4 August 2019. | Revised Manuscript received on 11 August 2019. | Manuscript published on 30 September 2019. | PP: 3424-3428 | Volume-8 Issue-3 September 2019 | Retrieval Number: C5050098319/2019©BEIESP | DOI: 10.35940/ijrte.C5050.098319
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

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.
Keywords: Real-time Flows, Non-real-time Flows, Scheduler, Queues, Throughput, Scheduling Algorithms, Bandwidth Hogging, Jitter, Delay

Scope of the Article:
Foundations Dynamics