Mimicking Round-Robin Behavior with a Combined Input/Output Queued Switch and Speedup of Two

In recent years, we have seen a steady increase of bit rates in networks like Internet. However, memory access speeds can no longer satisfy the requirements of traditional output-queued (OQ) switches for such high line rates. By choosing an appropriate scheduling algorithm, combined input/output que...

Full description

Saved in:
Bibliographic Details
Main Authors: Schweizer, A., Mercankosk, G.
Format: Conference Proceeding
Language:English
Subjects:
Bit rate
Costs
Fabrics
IP networks
Packet switching
Round robin
Scheduling algorithm
Switches
Telecommunication switching
Throughput
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In recent years, we have seen a steady increase of bit rates in networks like Internet. However, memory access speeds can no longer satisfy the requirements of traditional output-queued (OQ) switches for such high line rates. By choosing an appropriate scheduling algorithm, combined input/output queued (CIOQ) switches can provide the same behavior as pure OQ switches with a moderate speedup. This paper presents an algorithm that can mimic exact round robin (RR) behavior of an OQ switch in a CIOQ architecture with a speedup of two. While previous approaches on CIOQ switches with low speedup mainly focused on high throughput, the RR scheduling in this architecture can also provide fairness and service differentiation
ISSN:2159-3442
2159-3450
DOI:10.1109/TENCON.2006.343960