Cell-based schedulers with dual-rate grouping

Dong Wei, Jie Yang, Nirwan Ansari, Symeon Papavassiliou

Research output: Contribution to journalArticlepeer-review


The use of fluid Generalized Processor Sharing (GPS) algorithm for integrated service networks has received much 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 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, band-width 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 without increasing the implementation complexity.

Original languageEnglish (US)
Pages (from-to)637-645
Number of pages9
JournalIEICE Transactions on Communications
Issue number2
StatePublished - Feb 2003

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


  • Granularity
  • High-speed
  • Scheduling
  • Service rate


Dive into the research topics of 'Cell-based schedulers with dual-rate grouping'. Together they form a unique fingerprint.

Cite this