BROWSE
Detail
Journal Article
Priority-based Grant-aware Scheduling for Low-latency Switching
Cited 4 time in 
Share 
Share
- Authors
- Jongtae Song, Kyeong-Eun Han, Dae-Ub Kim, Chansung Park, Kwangjoon Kim
- Issue Date
- 2018-10
- Citation
- Photonic Network Communications, v.36, no.2, pp.175-186
- ISSN
- 1387-974x
- Publisher
- Springer
- Language
- English
- Type
- Journal Article
- Abstract
- This paper introduces new scheduling algorithms supporting low-latency switching. The proposed grant-aware (GA) algorithm improves the average delay performance by using the grant information of previous iteration. The simulation result shows that the average delay of GA algorithm is about one-tenth of the existing algorithm in high-load condition. We also introduce two priority-based scheduling algorithms grant-aware and priority-aware (GAPA) algorithm and cyclic scheduling with the longest-queue-first (C-LQF) algorithm. In the priority-based scheduling, the scheduling priority of VoQ is determined based on its queue size. GAPA and C-LQF consider the priority only after the first iteration to prevent the starvation problem. The simulation result shows that GAPA and C-LQF scheduling achieves better performance than GA in terms of average delay, maximum delay, and hotspot throughput.
- KSP Keywords
- Average delay, Cyclic Scheduling, GA algorithm, Load conditions, Low latency, Priority-Aware, Priority-Based, Queue size, Scheduling algorithm, Scheduling priority, Starvation problem