Cell-based Schedulers with Dual-rate Grouping

概要

論文の詳細を見る
The use of fluid Gencralized Processor Sharing (GPS) algorithm for integrated senice networks has received much attention since earls 1990's because of its desirable properties in terms of delay bound and service fairness, Many Packet Fair Queuing (PFQ) algorithms have been developed to approximate GPS. However, owing to the implementation complexity it is difficult to support a large number of sessions with diverse service rates while maintaining the GPS properties. The grouping architecture has been proposed to dramatically reduce the implementation complexity However, the grouping architecture can only support a fixed number of service rates, thus causing the problems of granularity, handwidth fairness, utilization, and immunity of flows. In this paper, we propose a new implementation approach called dual-rate grouping, which can significantly alleviate the above problems. Compared with the grouping architecture, the proposed approach possesses better performance in terms of approximating per session-based PFQ algorithms a withoul increasing the implementation complexity.
社団法人電子情報通信学会の論文
2003-02-01