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...

Full description

Saved in:
Bibliographic Details
Main Authors: Radonjic, M., Radusinovic, I., Banovic, D., Maljevic, I.
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Delay
Postal services
Round robin
Switches
Telecommunications
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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