Cell-based Schedulers with Dual-rate Grouping

Dong WEI; Jie YANG; Nirwan ANSARI; Symeon PAPAVASSILIOU

Cell-based Schedulers with Dual-rate Grouping

Dong WEI, Jie YANG, Nirwan ANSARI, Symeon PAPAVASSILIOU

Full Text Views

0

Share
Cite this

Summary :

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, bandwidth 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.

Publication: IEICE TRANSACTIONS on Communications Vol.E86-B No.2 pp.637-645

Publication Date: 2003/02/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Internet Technology III)

Category: Packet Transmission

Cite this

Copy

Dong WEI, Jie YANG, Nirwan ANSARI, Symeon PAPAVASSILIOU, "Cell-based Schedulers with Dual-rate Grouping" in IEICE TRANSACTIONS on Communications, vol. E86-B, no. 2, pp. 637-645, February 2003, doi: .
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, bandwidth 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.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e86-b_2_637/_p

Copy

@ARTICLE{e86-b_2_637,
author={Dong WEI, Jie YANG, Nirwan ANSARI, Symeon PAPAVASSILIOU, },
journal={IEICE TRANSACTIONS on Communications},
title={Cell-based Schedulers with Dual-rate Grouping},
year={2003},
volume={E86-B},
number={2},
pages={637-645},
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, bandwidth 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.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Cell-based Schedulers with Dual-rate Grouping
T2 - IEICE TRANSACTIONS on Communications
SP - 637
EP - 645
AU - Dong WEI
AU - Jie YANG
AU - Nirwan ANSARI
AU - Symeon PAPAVASSILIOU
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2003
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, bandwidth 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.
ER -