ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Grant-Aware Scheduling Algorithm for VOQ-Based Input-Buffered Packet Switches
Cited 8 time in scopus Download 135 time Share share facebook twitter linkedin kakaostory
저자
한경은, 송종태, 김대업, 윤지욱, 박찬성, 김광준
발행일
201806
출처
ETRI Journal, v.40 no.3, pp.337-346
ISSN
1225-6463
출판사
한국전자통신연구원 (ETRI)
DOI
https://dx.doi.org/10.4218/etrij.2017-0057
협약과제
17HH1800, Photonic Frame 기반 패킷 스위칭 가능한 데이터 센터 광 네트워킹 핵심 기술 개발, 김광준
초록
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.
KSP 제안 키워드
GA algorithm, Packet switch, Scheduling algorithm, queuing delay, round robin, simulation results
본 저작물은 공공누리 제4유형 : 출처표시 + 상업적 이용금지 + 변경금지 조건에 따라 이용할 수 있습니다.
제4유형