A novel pairing algorithm for high-speed large-scale switches

Motivated by the observation that switch throughput is mainly limited by the number of the maximum matching or pairing, instead of the head-of-line (HOL) effect, a pairing algorithm trying to maximize the number of pairing, for switches with K buffers in each input port is proposed. As shown in the...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE communications letters 2000-01, Vol.4 (1), p.23-25
Hauptverfasser:	WU, J. S.-C, LIN, Y.-D
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Bipartite graph Buffers Computer architecture Computer simulation Exact sciences and technology High speed Impedance matching Large-scale systems Matching Memory architecture Packet switching Ports Queueing analysis Switches Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Throughput Traffic control
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Motivated by the observation that switch throughput is mainly limited by the number of the maximum matching or pairing, instead of the head-of-line (HOL) effect, a pairing algorithm trying to maximize the number of pairing, for switches with K buffers in each input port is proposed. As shown in the related formula and simulation data, this algorithm performs well and can boost the switch throughput to 0.981 from traditional 0.632 when K=4 even as the switch size/spl rarr//spl infin/.
ISSN:	1089-7798 1558-2558
DOI:	10.1109/4234.823538