A pipeline-based approach for maximal-sized matching scheduling in input-buffered switches

Eiji Oki, Roberto Rojas-Cessa, H. Jonathan Chao

Research output: Contribution to journalArticle

Abstract

This letter proposes an innovative pipeline-based maximal-sized matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient round-robin-based maximal matching algorithm. We show that PMM provides 100% throughput under uniform traffic since it preserves a desynchronization effect of the round-robin pointers as in the preexisting algorithm. In addition, PMM maintains fairness for best-effort traffic due to the round-robin-based arbitration.

Original languageEnglish (US)
Pages (from-to)263-265
Number of pages3
JournalIEEE Communications Letters
Volume5
Issue number6
DOIs
StatePublished - Jun 2001

Fingerprint

Arbitration
Switch
Pipelines
Scheduling
Switches
Traffic
Desynchronization
Throughput
Matching Algorithm
Fairness
Timing

Keywords

  • Input-buffered switch
  • Maximal-sized matching
  • Pipeline
  • Scheduling

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

A pipeline-based approach for maximal-sized matching scheduling in input-buffered switches. / Oki, Eiji; Rojas-Cessa, Roberto; Chao, H. Jonathan.

In: IEEE Communications Letters, Vol. 5, No. 6, 06.2001, p. 263-265.

Research output: Contribution to journalArticle

@article{bf170b065f6149399603867f2fcd4152,
title = "A pipeline-based approach for maximal-sized matching scheduling in input-buffered switches",
abstract = "This letter proposes an innovative pipeline-based maximal-sized matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient round-robin-based maximal matching algorithm. We show that PMM provides 100{\%} throughput under uniform traffic since it preserves a desynchronization effect of the round-robin pointers as in the preexisting algorithm. In addition, PMM maintains fairness for best-effort traffic due to the round-robin-based arbitration.",
keywords = "Input-buffered switch, Maximal-sized matching, Pipeline, Scheduling",
author = "Eiji Oki and Roberto Rojas-Cessa and Chao, {H. Jonathan}",
year = "2001",
month = "6",
doi = "10.1109/4234.929607",
language = "English (US)",
volume = "5",
pages = "263--265",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - A pipeline-based approach for maximal-sized matching scheduling in input-buffered switches

AU - Oki, Eiji

AU - Rojas-Cessa, Roberto

AU - Chao, H. Jonathan

PY - 2001/6

Y1 - 2001/6

N2 - This letter proposes an innovative pipeline-based maximal-sized matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient round-robin-based maximal matching algorithm. We show that PMM provides 100% throughput under uniform traffic since it preserves a desynchronization effect of the round-robin pointers as in the preexisting algorithm. In addition, PMM maintains fairness for best-effort traffic due to the round-robin-based arbitration.

AB - This letter proposes an innovative pipeline-based maximal-sized matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient round-robin-based maximal matching algorithm. We show that PMM provides 100% throughput under uniform traffic since it preserves a desynchronization effect of the round-robin pointers as in the preexisting algorithm. In addition, PMM maintains fairness for best-effort traffic due to the round-robin-based arbitration.

KW - Input-buffered switch

KW - Maximal-sized matching

KW - Pipeline

KW - Scheduling

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

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

U2 - 10.1109/4234.929607

DO - 10.1109/4234.929607

M3 - Article

VL - 5

SP - 263

EP - 265

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 6

ER -