DMCA
Providing performance guarantees for buffered crossbar switches without speedup (2009)
| Venue: | Int. Conf. on Heterogeneous Netw. for Quality, Reliability, Security and Robustness (QSHINE 2009), Las Palmas de Gran Canaria |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Pan09providingperformance,
author = {Deng Pan and Zhenyu Yang and Kia Makki and Niki Pissinou},
title = {Providing performance guarantees for buffered crossbar switches without speedup},
booktitle = {Int. Conf. on Heterogeneous Netw. for Quality, Reliability, Security and Robustness (QSHINE 2009), Las Palmas de Gran Canaria},
year = {2009}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Buffered crossbar switches are special crossbar switches with each crosspoint equipped with a small exclusive buffer. The crosspoint buffers decouple input ports and output ports, and simplify switch scheduling. In this paper, we propose a scheduling algorithm called Fair and Localized Asynchronous Packet Scheduling (FLAPS) for buffered crossbar switches, to provide tight performance guarantees. FLAPS needs no speedup for the crossbar and handles variable length packets without segmentation and reassembly (SAR). With FLAPS, each input port and output port independently make scheduling decisions and rely on only local queue statuses. We theoretically show that a crosspoint buffer size of 4L is sufficient for FLAPS to avoid buffer overflow, where L is the maximum packet length. In addition, we prove that FLAPS achieves strong stability, and provides bounded delay guarantees. Finally, we present simulation data to verify the analytical results.
Keyphrases
buffered crossbar switch performance guarantee input port output port simulation data crossbar switch localized asynchronous packet scheduling bounded delay guarantee strong stability buffer overflow special crossbar switch crosspoint buffer switch scheduling maximum packet length tight performance guarantee small exclusive buffer crosspoint buffer size local queue status handle variable length packet analytical result scheduling algorithm
