Open AccessGrant‐Aware Scheduling Algorithm for VOQ‐Based Input‐Buffered Packet Switches
Author(s) -
Han KyeongEun,
Song Jongtae,
Kim DaeUb,
Youn JiWook,
Park Chansung,
Kim Kwangjoon
Publication year - 2018
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.2017-0057
Subject(s) - computer science , queueing theory , scheduling (production processes) , network packet , latency (audio) , throughput , real time computing , computer network , algorithm , fair queuing , round robin scheduling , fair share scheduling , mathematical optimization , mathematics , quality of service , wireless , telecommunications
In this paper, we propose a grant‐aware (GA) scheduling algorithm that can provide higher throughput and lower latency than a conventional dual round‐robin matching (DRRM) method. In our proposed GA algorithm, when an output receives requests from different inputs, the output not only sends a grant to the selected input, but also sends a grant indicator to all the other inputs to share the grant information. This allows the inputs to skip the granted outputs in their input arbiters in the next iteration. Simulation results using OPNET show that the proposed algorithm provides a maximum 3% higher throughput with approximately 31% less queuing delay than DRRM.