PRIORITIZED QUEUE WITH ROUND ROBIN SCHEDULER FOR BUFFERED CROSSBAR SWITCHES
Abstract
vioft2nntf2t|tblJournal|Abstract_paper|0xf4ff558c15000000f0fa020001000c00
Research in high speed switching systems is in greater demand as the internet traffic gets rapid increase. Designing an efficient scheduling algorithm with high throughput and low delay is an open challenge. Most of the algorithms achieve 100% throughput in uniform traffics but failed to attain the same performance under non-uniform traffics. Moreover these algorithms are also suffers from starvation leads to extended waiting time of VOQ. In this paper, Prioritized Queue with Round Robin Scheduler (PQRS) is proposed for Buffered Crossbar Switches. We proved that our proposed scheduler can achieve 85% throughput under any non-uniform traffic without starvation.

Authors
N. Narayanan Prasanth1, Kannan Balasubramanian2, R. Chithra Devi3
National College of Engineering, India1, Mepco Schlenk Engineering College, India, Dr. Sivanthi Aditanar College of Engineering, India3

Keywords
Buffered Crossbar Switch, Delay performance, Scheduling Algorithms, Starvation, Throughput
Yearly Full Views
JanuaryFebruaryMarchAprilMayJuneJulyAugustSeptemberOctoberNovemberDecember
000000000000
Published By :
ICTACT
Published In :
ICTACT Journal on Communication Technology
( Volume: 5 , Issue: 1 , Pages: 890 - 893 )
Date of Publication :
March 2014
Page Views :
117
Full Text Views :

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.