DBSW Algorithm Performance Criteria Using Queueing Theory

큐잉 이론을 이용한 DBSW 알고리즘 성능 분석

  • 조해성 (건양대학교 전자정보공학과)
  • Published : 2006.11.01

Abstract

WRR scheme was developed for scheduling scheme for guaranteeing bandwidth requirement. In these days, WRR scheme can handle multiple queues straightforwardly by putting a different weight on each queue in order to offer differentiated services such as different bandwidth or delay bound in wireless communication network. Also, WRR algorithm can be implemented efficiently by dynamic binary scheduling wheel(DBSW) architecture. This paper performs the mathematical analysis of the DBSW architecture and compares the results with simulation results. The analysis data and simulation data show that the mathematical analysis developed properly.

Keywords

WRR;Scheduling;DBSW;Mathematical Analysis