Implementing the dual-rate grouping scheme in cell-based schedulers

The use of fluid Generalized Processor Sharing (GPS) algorithm for integrated services networks has received a lot of attention since early 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 their 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, it can only support a fixed number of service rates, thus causing the problem of granularity. In this paper, we present a viable implementation of our recently proposed dual-rate grouping architecture, and demonstrate that, as compared with the original grouping architecture, our proposed scheme possesses better performance in terms of approximating per session-based PFQ algorithms without increasing the implementation complexity.