ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

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

상세정보

학술지 A New Starting Potential Fair Queuing Algorithm with O(1) Virtual Time Computation Complexity
Cited 7 time in scopus Download 71 time Share share facebook twitter linkedin kakaostory
저자
곽동용, 고남석, 김봉태, 박홍식
발행일
200312
출처
ETRI Journal, v.25 no.6, pp.475-488
DOI
https://dx.doi.org/10.4218/etrij.03.0102.0008
협약과제
02MT2200, 초고속 광가입자망 기술, 양재우
초록
In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate-proportional property. The NSPFQ algorithm recalibrates the system virtual time to the minimum virtual start time among all possible virtual start times for head-of-line packets in backlogged sessions. Through analysis and simulation, we show that the proposed algorithm has good delay and fairness properties. We also propose a hardware implementation framework for the scheduling algorithm.
KSP 제안 키워드
Analysis and simulation, Hardware Implementation, Queuing algorithm, Scheduling algorithm, Virtual time, computation complexity, fair queuing, implementation framework
본 저작물은 공공누리 제4유형 : 출처표시 + 상업적 이용금지 + 변경금지 조건에 따라 이용할 수 있습니다.
제4유형