Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s11107-018-0787-3 | Photonic Network Communications |
Keywords | Field | DocType |
Input-buffered switch, Switch scheduling, Low latency, Priority scheduling | Scheduling (computing),Computer science,Queue,Computer network,Cyclic scheduling,Latency (engineering),Priority scheduling,Throughput,Hotspot (Wi-Fi) | Journal |
Volume | Issue | ISSN |
36 | 2 | 1387-974X |
Citations | PageRank | References |
1 | 0.35 | 12 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jongtae Song | 1 | 32 | 7.42 |
| Kyeong-Eun Han | 2 | 9 | 2.99 |
| daeub kim | 3 | 2 | 1.72 |
| Chansung Park | 4 | 1 | 1.36 |
| Kwangjoon Kim | 5 | 5 | 4.92 |