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

Juan José Jaramillo, Fabio Milan, R. Srikant

Research output: Contribution to journalArticle

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)
Pages (from-to)1212-1225
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume16
Issue number5
DOIs
StatePublished - Aug 12 2008
Externally publishedYes

    Fingerprint

Keywords

  • Birkhoff-von Neumann switch
  • Load-balanced switch
  • Scheduling

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this