Cell-based schedulers with dual-rate grouping

Dong Wei, Jie Yang, Nirwan Ansari, Symeon Papavassiliou

Research output: Contribution to journalArticle

Abstract

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
VolumeE86-B
Issue number2
StatePublished - Jan 1 2003

Fingerprint

Bandwidth
Fluids

All Science Journal Classification (ASJC) codes

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

Cite this

Wei, D., Yang, J., Ansari, N., & Papavassiliou, S. (2003). Cell-based schedulers with dual-rate grouping. IEICE Transactions on Communications, E86-B(2), 637-645.
Wei, Dong ; Yang, Jie ; Ansari, Nirwan ; Papavassiliou, Symeon. / Cell-based schedulers with dual-rate grouping. In: IEICE Transactions on Communications. 2003 ; Vol. E86-B, No. 2. pp. 637-645.
@article{6a154b13a8f4492a9a8a1e334bc78a76,
title = "Cell-based schedulers with dual-rate grouping",
abstract = "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.",
author = "Dong Wei and Jie Yang and Nirwan Ansari and Symeon Papavassiliou",
year = "2003",
month = "1",
day = "1",
language = "English (US)",
volume = "E86-B",
pages = "637--645",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "2",

}

Wei, D, Yang, J, Ansari, N & Papavassiliou, S 2003, 'Cell-based schedulers with dual-rate grouping', IEICE Transactions on Communications, vol. E86-B, no. 2, pp. 637-645.

Cell-based schedulers with dual-rate grouping. / Wei, Dong; Yang, Jie; Ansari, Nirwan; Papavassiliou, Symeon.

In: IEICE Transactions on Communications, Vol. E86-B, No. 2, 01.01.2003, p. 637-645.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Cell-based schedulers with dual-rate grouping

AU - Wei, Dong

AU - Yang, Jie

AU - Ansari, Nirwan

AU - Papavassiliou, Symeon

PY - 2003/1/1

Y1 - 2003/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0042510230&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042510230&partnerID=8YFLogxK

M3 - Article

VL - E86-B

SP - 637

EP - 645

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 2

ER -

Wei D, Yang J, Ansari N, Papavassiliou S. Cell-based schedulers with dual-rate grouping. IEICE Transactions on Communications. 2003 Jan 1;E86-B(2):637-645.