By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yamakoshi, K. ; NTT Network Service Syst. Labs., Tokyo, Japan ; Nakai, K. ; Oki, E. ; Yamanaka, N.

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 in queues. The algorithm, along with the simulation results showing the efficiency, are presented. The DDRR scheduler was implemented for 5 Tbit/s switching system

Published in:

Electronics Letters  (Volume:38 ,  Issue: 3 )