Packet delay variation analysis of the CQ switch under uniform traffic

Packet delay variation analysis of the CQ switch under uniform traffic

This paper presents the results of the packet delay variation analysis for 32×32 crosspoint queued switch with uniform arrival traffic. Switches with various buffer lengths are analyzed using different scheduling algorithms: longest-queue-first, round-robin, exhaustive-round-robin and frame-based-ro...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Radonjic, M., Radusinovic, I., Banovic, D., Maljevic, I.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithm design and analysis
Delay
Postal services
Round robin
Switches
Telecommunications
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents the results of the packet delay variation analysis for 32×32 crosspoint queued switch with uniform arrival traffic. Switches with various buffer lengths are analyzed using different scheduling algorithms: longest-queue-first, round-robin, exhaustive-round-robin and frame-based-round-robin-matching. The results have shown that the round-robin algorithm has the least packet delay variation among the observed algorithms.
DOI:10.1109/TELFOR.2011.6143523