TY - GEN
T1 - DISQUO
T2 - 2010 International Conference on High Performance Switching and Routing, HPSR 2010
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
T3 - 2010 International Conference on High Performance Switching and Routing, HPSR 2010
SP - 75
EP - 81
BT - 2010 International Conference on High Performance Switching and Routing, HPSR 2010
Y2 - 13 June 2010 through 16 June 2010
ER -