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

被引:9
作者
Yamakoshi, K
Nakai, K
Oki, E
Yamanaka, N
机构
[1] NTT, Network Serv Syst Labs, Musashino, Tokyo 1858585, Japan
[2] NTT, Network Innovat Labs, Musashino, Tokyo 1858585, Japan
关键词
D O I
10.1049/el:20020079
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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 5Tbit/s switching system.
引用
收藏
页码:148 / 149
页数:2
相关论文
共 3 条
  • [1] Nakai K, 1999, IEICE T COMMUN, VE82B, P265
  • [2] Efficient fair quelling using deficit round-robin
    Shreedhar, M
    Varghese, G
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1996, 4 (03) : 375 - 385
  • [3] YAMAKOSHI K, P IEEE ICC 01, P3117