Dichotomy slot allocation: A low-jitter scheduling scheme for input-queued switches

Jingjing Zhang, Yaohui Jin, Nirwan Ansari, Weisheng Hu

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

2 Scopus citations

Abstract

Recently, jitter is becoming an important performance criterion in switch scheduling to accommodate many emerging real-time applications. Formerly proposed low-jitter scheduling algorithms decompose traffic demands into a weighted sum of permutation matrices and then schedule these decomposed permutation matrices. However, a port pair's appearance in these decomposed matrices may exceed their actual traffic demand. Such extra allocation may result in high jitter for a port pair. In order to smoothly schedule each port pair, we propose a novel scheduling algorithm termed as Dichotomy Slot Allocation (DSA). To achieve low jitter and small cell loss, DSA allocates slots to port pairs based on a designed Dichotomy Order. Both analysis and simulation results demonstrate that DSA achieves relatively lower jitter as compared to the state of the art.

Original languageEnglish (US)
Title of host publication2007 IEEE Workshop on High Performance Switching and Routing, HPSR
Pages88-93
Number of pages6
DOIs
StatePublished - Dec 1 2007
Event2007 IEEE Workshop on High Performance Switching and Routing, HPSR - Brooklyn, NY, United States
Duration: May 30 2007Jun 1 2007

Other

Other2007 IEEE Workshop on High Performance Switching and Routing, HPSR
CountryUnited States
CityBrooklyn, NY
Period5/30/076/1/07

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Dichotomy slot allocation: A low-jitter scheduling scheme for input-queued switches'. Together they form a unique fingerprint.

Cite this