Dynamic deficit round-robin scheduling scheme for variable-length packets

K. Yamakoshi, K. Nakai, E. Oki, N. Yamanaka

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

A dynamic deficit round-robin (DDRR) scheduling scheme for variable-length packets is proposed. It can resolve the drawback of the conventional deficit round-robin (DRR) scheduler that short-packet delay performance and high throughput cannot be satisfied simultaneously. DDRR uses an adaptive granularity for the deficit counter, where the granularity is dynamically changed according to packet lengths is queues. The algorithm, along with the simulation results showing the efficiency, are presented. The DDRR scheduler was implemented for 5 Tbit/s switching system.

Original languageEnglish
Pages (from-to)148-149
Number of pages2
JournalElectronics Letters
Volume38
Issue number3
DOIs
Publication statusPublished - 2002 Jan 31
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this