DISQUO: A distributed 100% throughput algorithm for a buffered Crossbar switch

Shunyuan Ye, Yanming Shen, Shivendra Panwar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The promise of a buffered crossbar switch - a crossbar switch with a packet buffer at each crosspoint - is that it can provide good delay performance with much less complex, practical scheduling algorithms. With today's technology, it is now possible to implement it in a single chip. Thus it has attracted great attention recently. Though simple distributed algorithms can achieve 100% throughput under uniform traffic, so far there are no distributed algorithms which can achieve 100% throughput under general admissible arrival patterns. In this paper, we propose a distributed scheduling algorithm which achieves 100% throughput for any admissible Bernoulli arrival traffic. To the best of our knowledge, this is the first distributed algorithm which can achieve this. The algorithm is called DISQUO: DIStributed QUeue input-Output scheduler. Our simulation results also show that DISQUO can provide good delay performance for different traffic patterns.

Original languageEnglish (US)
Title of host publication2010 International Conference on High Performance Switching and Routing, HPSR 2010
Pages75-81
Number of pages7
DOIs
StatePublished - 2010
Event2010 International Conference on High Performance Switching and Routing, HPSR 2010 - Richardson, TX, United States
Duration: Jun 13 2010Jun 16 2010

Other

Other2010 International Conference on High Performance Switching and Routing, HPSR 2010
CountryUnited States
CityRichardson, TX
Period6/13/106/16/10

Fingerprint

Parallel algorithms
Switches
Throughput
Scheduling algorithms

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Ye, S., Shen, Y., & Panwar, S. (2010). DISQUO: A distributed 100% throughput algorithm for a buffered Crossbar switch. In 2010 International Conference on High Performance Switching and Routing, HPSR 2010 (pp. 75-81). [5580261] https://doi.org/10.1109/HPSR.2010.5580261

DISQUO : A distributed 100% throughput algorithm for a buffered Crossbar switch. / Ye, Shunyuan; Shen, Yanming; Panwar, Shivendra.

2010 International Conference on High Performance Switching and Routing, HPSR 2010. 2010. p. 75-81 5580261.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ye, S, Shen, Y & Panwar, S 2010, DISQUO: A distributed 100% throughput algorithm for a buffered Crossbar switch. in 2010 International Conference on High Performance Switching and Routing, HPSR 2010., 5580261, pp. 75-81, 2010 International Conference on High Performance Switching and Routing, HPSR 2010, Richardson, TX, United States, 6/13/10. https://doi.org/10.1109/HPSR.2010.5580261
Ye S, Shen Y, Panwar S. DISQUO: A distributed 100% throughput algorithm for a buffered Crossbar switch. In 2010 International Conference on High Performance Switching and Routing, HPSR 2010. 2010. p. 75-81. 5580261 https://doi.org/10.1109/HPSR.2010.5580261
Ye, Shunyuan ; Shen, Yanming ; Panwar, Shivendra. / DISQUO : A distributed 100% throughput algorithm for a buffered Crossbar switch. 2010 International Conference on High Performance Switching and Routing, HPSR 2010. 2010. pp. 75-81
@inproceedings{6cf4a5938d16404e991fe26ded7a7fb1,
title = "DISQUO: A distributed 100{\%} throughput algorithm for a buffered Crossbar switch",
abstract = "The promise of a buffered crossbar switch - a crossbar switch with a packet buffer at each crosspoint - is that it can provide good delay performance with much less complex, practical scheduling algorithms. With today's technology, it is now possible to implement it in a single chip. Thus it has attracted great attention recently. Though simple distributed algorithms can achieve 100{\%} throughput under uniform traffic, so far there are no distributed algorithms which can achieve 100{\%} throughput under general admissible arrival patterns. In this paper, we propose a distributed scheduling algorithm which achieves 100{\%} throughput for any admissible Bernoulli arrival traffic. To the best of our knowledge, this is the first distributed algorithm which can achieve this. The algorithm is called DISQUO: DIStributed QUeue input-Output scheduler. Our simulation results also show that DISQUO can provide good delay performance for different traffic patterns.",
author = "Shunyuan Ye and Yanming Shen and Shivendra Panwar",
year = "2010",
doi = "10.1109/HPSR.2010.5580261",
language = "English (US)",
isbn = "9781424469710",
pages = "75--81",
booktitle = "2010 International Conference on High Performance Switching and Routing, HPSR 2010",

}

TY - GEN

T1 - DISQUO

T2 - A distributed 100% throughput algorithm for a buffered Crossbar switch

AU - Ye, Shunyuan

AU - Shen, Yanming

AU - Panwar, Shivendra

PY - 2010

Y1 - 2010

N2 - The promise of a buffered crossbar switch - a crossbar switch with a packet buffer at each crosspoint - is that it can provide good delay performance with much less complex, practical scheduling algorithms. With today's technology, it is now possible to implement it in a single chip. Thus it has attracted great attention recently. Though simple distributed algorithms can achieve 100% throughput under uniform traffic, so far there are no distributed algorithms which can achieve 100% throughput under general admissible arrival patterns. In this paper, we propose a distributed scheduling algorithm which achieves 100% throughput for any admissible Bernoulli arrival traffic. To the best of our knowledge, this is the first distributed algorithm which can achieve this. The algorithm is called DISQUO: DIStributed QUeue input-Output scheduler. Our simulation results also show that DISQUO can provide good delay performance for different traffic patterns.

AB - The promise of a buffered crossbar switch - a crossbar switch with a packet buffer at each crosspoint - is that it can provide good delay performance with much less complex, practical scheduling algorithms. With today's technology, it is now possible to implement it in a single chip. Thus it has attracted great attention recently. Though simple distributed algorithms can achieve 100% throughput under uniform traffic, so far there are no distributed algorithms which can achieve 100% throughput under general admissible arrival patterns. In this paper, we propose a distributed scheduling algorithm which achieves 100% throughput for any admissible Bernoulli arrival traffic. To the best of our knowledge, this is the first distributed algorithm which can achieve this. The algorithm is called DISQUO: DIStributed QUeue input-Output scheduler. Our simulation results also show that DISQUO can provide good delay performance for different traffic patterns.

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

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

U2 - 10.1109/HPSR.2010.5580261

DO - 10.1109/HPSR.2010.5580261

M3 - Conference contribution

AN - SCOPUS:78149272750

SN - 9781424469710

SP - 75

EP - 81

BT - 2010 International Conference on High Performance Switching and Routing, HPSR 2010

ER -