Padded frames: A novel algorithm for stable scheduling in load-balanced switches

Juan José Jaramillo, Fabio Milan, R. Srikant

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The load-balanced Birkhoff-von Neumann switching architecture consists of two stages: a load balancer and a deterministic input-queued crossbar switch. The advantages of this architecture are its simplicity and scalability, while its main drawback is the possible out-of-sequence reception of packets belonging to the same flow. Several solutions have been proposed to overcome this problem; among the most promising are the Uniform Frame Spreading (UFS) and the Full Ordered Frames First (FOFF) algorithms. In this paper, we present a new algorithm called Padded Frames (PF), which eliminates the packet reordering problem, achieves 100% throughput, and improves the delay performance of previously known algorithms.

Original languageEnglish (US)
Title of host publication2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1732-1735
Number of pages4
ISBN (Print)1424403502, 9781424403509
DOIs
StatePublished - 2006
Event2006 40th Annual Conference on Information Sciences and Systems, CISS 2006 - Princeton, NJ, United States
Duration: Mar 22 2006Mar 24 2006

Publication series

Name2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Other

Other2006 40th Annual Conference on Information Sciences and Systems, CISS 2006
Country/TerritoryUnited States
CityPrinceton, NJ
Period3/22/063/24/06

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'Padded frames: A novel algorithm for stable scheduling in load-balanced switches'. Together they form a unique fingerprint.

Cite this