SQUID: A practical 100% throughput scheduler for Crosspoint buffered switches

Research output: Contribution to journalArticle

Abstract

Crosspoint buffered switches are emerging as the focus of research in high-speed routers. They have simpler scheduling algorithms and achieve better performance than bufferless crossbar switches. Crosspoint buffered switches have a buffer at each crosspoint. A cell is first delivered to a crosspoint buffer, and then transferred to the output port. With a speedup of 2, a crosspoint buffered switch has previously been proved to provide 100% throughput. In this paper, we propose two 100% throughput scheduling algorithms without speedup for crosspoint buffered switches, called SQUISH and SQUID. We prove that both schemes can achieve 100% throughput for any admissible Bernoulli traffic, with the minimum required crosspoint buffer size being as small as a single cell buffer. Both schemes have a low time complexity of O(log N), where N is the switch size. Simulation results show a delay performance comparable to output-queued switches. We also present a novel queuing model that models crosspoint buffered switches under uniform traffic.

Original languageEnglish (US)
Article number5418854
Pages (from-to)1119-1131
Number of pages13
JournalIEEE/ACM Transactions on Networking
Volume18
Issue number4
DOIs
StatePublished - Aug 2010

Fingerprint

SQUIDs
Switches
Throughput
Scheduling algorithms
Routers

Keywords

  • Crosspoint buffered switches
  • throughput

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

SQUID : A practical 100% throughput scheduler for Crosspoint buffered switches. / Shen, Yanming; Panwar, Shivendra; Chao, H. Jonathan.

In: IEEE/ACM Transactions on Networking, Vol. 18, No. 4, 5418854, 08.2010, p. 1119-1131.

Research output: Contribution to journalArticle

@article{ae0eea7bf2704d5a80b39584e35678ed,
title = "SQUID: A practical 100{\%} throughput scheduler for Crosspoint buffered switches",
abstract = "Crosspoint buffered switches are emerging as the focus of research in high-speed routers. They have simpler scheduling algorithms and achieve better performance than bufferless crossbar switches. Crosspoint buffered switches have a buffer at each crosspoint. A cell is first delivered to a crosspoint buffer, and then transferred to the output port. With a speedup of 2, a crosspoint buffered switch has previously been proved to provide 100{\%} throughput. In this paper, we propose two 100{\%} throughput scheduling algorithms without speedup for crosspoint buffered switches, called SQUISH and SQUID. We prove that both schemes can achieve 100{\%} throughput for any admissible Bernoulli traffic, with the minimum required crosspoint buffer size being as small as a single cell buffer. Both schemes have a low time complexity of O(log N), where N is the switch size. Simulation results show a delay performance comparable to output-queued switches. We also present a novel queuing model that models crosspoint buffered switches under uniform traffic.",
keywords = "Crosspoint buffered switches, throughput",
author = "Yanming Shen and Shivendra Panwar and Chao, {H. Jonathan}",
year = "2010",
month = "8",
doi = "10.1109/TNET.2010.2042460",
language = "English (US)",
volume = "18",
pages = "1119--1131",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - SQUID

T2 - A practical 100% throughput scheduler for Crosspoint buffered switches

AU - Shen, Yanming

AU - Panwar, Shivendra

AU - Chao, H. Jonathan

PY - 2010/8

Y1 - 2010/8

N2 - Crosspoint buffered switches are emerging as the focus of research in high-speed routers. They have simpler scheduling algorithms and achieve better performance than bufferless crossbar switches. Crosspoint buffered switches have a buffer at each crosspoint. A cell is first delivered to a crosspoint buffer, and then transferred to the output port. With a speedup of 2, a crosspoint buffered switch has previously been proved to provide 100% throughput. In this paper, we propose two 100% throughput scheduling algorithms without speedup for crosspoint buffered switches, called SQUISH and SQUID. We prove that both schemes can achieve 100% throughput for any admissible Bernoulli traffic, with the minimum required crosspoint buffer size being as small as a single cell buffer. Both schemes have a low time complexity of O(log N), where N is the switch size. Simulation results show a delay performance comparable to output-queued switches. We also present a novel queuing model that models crosspoint buffered switches under uniform traffic.

AB - Crosspoint buffered switches are emerging as the focus of research in high-speed routers. They have simpler scheduling algorithms and achieve better performance than bufferless crossbar switches. Crosspoint buffered switches have a buffer at each crosspoint. A cell is first delivered to a crosspoint buffer, and then transferred to the output port. With a speedup of 2, a crosspoint buffered switch has previously been proved to provide 100% throughput. In this paper, we propose two 100% throughput scheduling algorithms without speedup for crosspoint buffered switches, called SQUISH and SQUID. We prove that both schemes can achieve 100% throughput for any admissible Bernoulli traffic, with the minimum required crosspoint buffer size being as small as a single cell buffer. Both schemes have a low time complexity of O(log N), where N is the switch size. Simulation results show a delay performance comparable to output-queued switches. We also present a novel queuing model that models crosspoint buffered switches under uniform traffic.

KW - Crosspoint buffered switches

KW - throughput

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

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

U2 - 10.1109/TNET.2010.2042460

DO - 10.1109/TNET.2010.2042460

M3 - Article

AN - SCOPUS:77955768704

VL - 18

SP - 1119

EP - 1131

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 4

M1 - 5418854

ER -