Two-dimensional round-robin schedulers for packet switches with multiple input queues

Richard O. LaMaire, Dimitrios N. Serpanos

Research output: Contribution to journalArticle

88 Citations (Scopus)

Abstract

We present a new scheduler, the two-dimensional round-robin (2DRR) scheduler, that provides high throughput and fair access in a packet switch that uses multiple input queues. We consider an architecture in which each input port maintains a separate queue for each output. In an N × N switch, our scheduler determines which of the queues in the total of N2 input queues are served during each time slot. We demonstrate the fairness properties of the 2DRR scheduler and compare its performance with that of the input and output queueing configurations showing that our scheme achieves the same saturation throughput as output queueing. The 2DRR scheduler can be implemented using simple logic components thereby allowing a very high-speed implementation.

Original languageEnglish
Pages (from-to)471-482
Number of pages12
JournalIEEE/ACM Transactions on Networking
Volume2
Issue number5
DOIs
Publication statusPublished - 1 Oct 1994
Externally publishedYes

Fingerprint

Switches
Throughput

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Two-dimensional round-robin schedulers for packet switches with multiple input queues. / LaMaire, Richard O.; Serpanos, Dimitrios N.

In: IEEE/ACM Transactions on Networking, Vol. 2, No. 5, 01.10.1994, p. 471-482.

Research output: Contribution to journalArticle

LaMaire, Richard O. ; Serpanos, Dimitrios N. / Two-dimensional round-robin schedulers for packet switches with multiple input queues. In: IEEE/ACM Transactions on Networking. 1994 ; Vol. 2, No. 5. pp. 471-482.
@article{e5bc8283c3124046b49cb8928e5f7597,
title = "Two-dimensional round-robin schedulers for packet switches with multiple input queues",
abstract = "We present a new scheduler, the two-dimensional round-robin (2DRR) scheduler, that provides high throughput and fair access in a packet switch that uses multiple input queues. We consider an architecture in which each input port maintains a separate queue for each output. In an N × N switch, our scheduler determines which of the queues in the total of N2 input queues are served during each time slot. We demonstrate the fairness properties of the 2DRR scheduler and compare its performance with that of the input and output queueing configurations showing that our scheme achieves the same saturation throughput as output queueing. The 2DRR scheduler can be implemented using simple logic components thereby allowing a very high-speed implementation.",
author = "LaMaire, {Richard O.} and Serpanos, {Dimitrios N.}",
year = "1994",
month = "10",
day = "1",
doi = "10.1109/90.336324",
language = "English",
volume = "2",
pages = "471--482",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Two-dimensional round-robin schedulers for packet switches with multiple input queues

AU - LaMaire, Richard O.

AU - Serpanos, Dimitrios N.

PY - 1994/10/1

Y1 - 1994/10/1

N2 - We present a new scheduler, the two-dimensional round-robin (2DRR) scheduler, that provides high throughput and fair access in a packet switch that uses multiple input queues. We consider an architecture in which each input port maintains a separate queue for each output. In an N × N switch, our scheduler determines which of the queues in the total of N2 input queues are served during each time slot. We demonstrate the fairness properties of the 2DRR scheduler and compare its performance with that of the input and output queueing configurations showing that our scheme achieves the same saturation throughput as output queueing. The 2DRR scheduler can be implemented using simple logic components thereby allowing a very high-speed implementation.

AB - We present a new scheduler, the two-dimensional round-robin (2DRR) scheduler, that provides high throughput and fair access in a packet switch that uses multiple input queues. We consider an architecture in which each input port maintains a separate queue for each output. In an N × N switch, our scheduler determines which of the queues in the total of N2 input queues are served during each time slot. We demonstrate the fairness properties of the 2DRR scheduler and compare its performance with that of the input and output queueing configurations showing that our scheme achieves the same saturation throughput as output queueing. The 2DRR scheduler can be implemented using simple logic components thereby allowing a very high-speed implementation.

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

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

U2 - 10.1109/90.336324

DO - 10.1109/90.336324

M3 - Article

VL - 2

SP - 471

EP - 482

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 5

ER -