PMM: A pipelined maximal-sized matching scheduling approach for input-buffered switches

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

Research output: Contribution to conferencePaper

Abstract

This paper 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, where K subschedulers are used. 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 maximal matching algorithm such as iSLIP and DRRM. PMM maximizes the efficiency of the adopted arbitration scheme by allowing sufficient time for a number of iterations. We show that PMM preserves 100% throughput under uniform traffic and fairness for best-effort traffic of the pre-existing algorithm.

Original languageEnglish (US)
Pages35-39
Number of pages5
StatePublished - 2001
EventIEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States
Duration: Nov 25 2001Nov 29 2001

Other

OtherIEEE Global Telecommunicatins Conference GLOBECOM'01
CountryUnited States
CitySan Antonio, TX
Period11/25/0111/29/01

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Fingerprint Dive into the research topics of 'PMM: A pipelined maximal-sized matching scheduling approach for input-buffered switches'. Together they form a unique fingerprint.

  • Cite this

    Oki, E., Rojas-Cessa, R., & Chao, H. J. (2001). PMM: A pipelined maximal-sized matching scheduling approach for input-buffered switches. 35-39. Paper presented at IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States.