상세정보
학술지
Priority-based Grant-aware Scheduling for Low-latency Switching
- 발행일
- 201810
- 출처
- Photonic Network Communications, v.36 no.2, pp.175-186
- ISSN
- 1387-974x
- 출판사
- Springer
- 협약과제
- 17HH1800, Photonic Frame 기반 패킷 스위칭 가능한 데이터 센터 광 네트워킹 핵심 기술 개발, 김광준
- 초록
- 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 제안 키워드
- Average delay, Cyclic Scheduling, GA algorithm, Load conditions, Low latency, Priority-Aware, Priority-Based, Queue size, Scheduling algorithm, Scheduling priority, Starvation problem