Hong Jin Moon, Hae Seong Cho

The KIPS Transactions:PartC, Vol. 8, No. 2, pp. 134-140, Apr. 2001
10.3745/KIPSTC.2001.8.2.134,   PDF Download:

Abstract

The scheduling algorithms provide the guaranteed bandwidth for each connection with bounded packet delay. The Weighted Round Robin(WRR) discipline which is a sort of scheduling algorithm is quite simple and straightforward for handling multiple queues, and by putting a different weight on each queue. BSW algorithm was proposed to carry on buffer management efficiently at implementing of WRR scheduler. But, BSW algorithm cause serious performance degradation of cell delay and maximum queue length because it allocates more weight than the weight allocated actually in VC and could not serve cell if the VC queue is empty. In this paper, we propose new BSW structure, which can execute the WRR scheduling algorithm efficiently. Also, we develop a cell scheduling algorithm which is adapt in the new BSW structure. The proposed BSW structure and the algorithm is capable of maintaining an allocated VC's weight correctly and decrease of average cell delay and maximum buffer length by serving other VC cell when empty in each VC queue and increase of cell service ratio as a whole.

Statistics
Cite this article