Scheduling for input-queued packet switches by a re-configurable parallel match evaluator

Spiridon F. Beldianu; Roberto Rojas-Cessa; Eiji Oki; Sotirios G. Ziavras

doi:10.1109/LCOMM.2010.04.092440

Scheduling for input-queued packet switches by a re-configurable parallel match evaluator

Spiridon F. Beldianu, Roberto Rojas-Cessa, Eiji Oki, Sotirios G. Ziavras

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

A parallel match evaluator (PE) selects the most productive match for an input-queued (IQ) switch among several tested. However, current PE-based approaches use N fixed permutations out of possible N!, where N is the number of switch ports. A fixed permutation represents a permanent match between the inputs and outputs. To improve switching performance, this letter proposes a re-configurable PE (RPE) where permutations are selected according to traffic pattern, queue occupancy, or queuing times. This letter shows the performance improvement achieved with the proposed RPE.

Original language	English (US)
Article number	5439364
Pages (from-to)	357-359
Number of pages	3
Journal	IEEE Communications Letters
Volume	14
Issue number	4
DOIs	https://doi.org/10.1109/LCOMM.2010.04.092440
State	Published - Apr 2010

All Science Journal Classification (ASJC) codes

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Keywords

Input-queued switch
Match evaluator
Maximal matching
Scheduling

Access to Document

10.1109/LCOMM.2010.04.092440

Cite this

@article{802b6facd226455f8602a22847d6d3ba,

title = "Scheduling for input-queued packet switches by a re-configurable parallel match evaluator",

abstract = "A parallel match evaluator (PE) selects the most productive match for an input-queued (IQ) switch among several tested. However, current PE-based approaches use N fixed permutations out of possible N!, where N is the number of switch ports. A fixed permutation represents a permanent match between the inputs and outputs. To improve switching performance, this letter proposes a re-configurable PE (RPE) where permutations are selected according to traffic pattern, queue occupancy, or queuing times. This letter shows the performance improvement achieved with the proposed RPE.",

keywords = "Input-queued switch, Match evaluator, Maximal matching, Scheduling",

author = "Beldianu, {Spiridon F.} and Roberto Rojas-Cessa and Eiji Oki and Ziavras, {Sotirios G.}",

year = "2010",

month = apr,

doi = "10.1109/LCOMM.2010.04.092440",

language = "English (US)",

volume = "14",

pages = "357--359",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Scheduling for input-queued packet switches by a re-configurable parallel match evaluator

AU - Beldianu, Spiridon F.

AU - Rojas-Cessa, Roberto

AU - Oki, Eiji

AU - Ziavras, Sotirios G.

PY - 2010/4

Y1 - 2010/4

N2 - A parallel match evaluator (PE) selects the most productive match for an input-queued (IQ) switch among several tested. However, current PE-based approaches use N fixed permutations out of possible N!, where N is the number of switch ports. A fixed permutation represents a permanent match between the inputs and outputs. To improve switching performance, this letter proposes a re-configurable PE (RPE) where permutations are selected according to traffic pattern, queue occupancy, or queuing times. This letter shows the performance improvement achieved with the proposed RPE.

AB - A parallel match evaluator (PE) selects the most productive match for an input-queued (IQ) switch among several tested. However, current PE-based approaches use N fixed permutations out of possible N!, where N is the number of switch ports. A fixed permutation represents a permanent match between the inputs and outputs. To improve switching performance, this letter proposes a re-configurable PE (RPE) where permutations are selected according to traffic pattern, queue occupancy, or queuing times. This letter shows the performance improvement achieved with the proposed RPE.

KW - Input-queued switch

KW - Match evaluator

KW - Maximal matching

KW - Scheduling

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

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

U2 - 10.1109/LCOMM.2010.04.092440

DO - 10.1109/LCOMM.2010.04.092440

M3 - Article

AN - SCOPUS:77950665017

SN - 1089-7798

VL - 14

SP - 357

EP - 359

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 4

M1 - 5439364

ER -

Scheduling for input-queued packet switches by a re-configurable parallel match evaluator

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this