A New Fair Queueing Algorithm with Dynamic Service Probability Adjustment(Communication Theory and Signals)

スポンサーリンク

概要

• 論文の詳細を見る

• This letter proposes a new weighted fair queueing algorithm, which adjusts dynamically each flow's service probability according to its weight and average packet length and then uses the service probability parameters to implement fair queueing. This solves the main drawback of traditional weighted fair queueing algorithms-the packet-based tracing of weight parameters. In addition, this letter proposes a novel service probability calculation method which solves the unfairness problem induced by the variable packet length.

• 一般社団法人電子情報通信学会の論文
• 2007-11-01

著者

• Fan Xun

  Shanghai Jiao Tong Univ. Shanghai Chn

• Yin Debin

  Automation Department Shanghai Jiao Tong University

• XIE Jianying

  Automation Department, Shanghai Jiao Tong University

• FAN Xun

  Electronic Department, Shanghai Jiao Tong University

• Xie Jianying

  Automation Department Shanghai Jiao Tong University

関連論文

• Practical Hierarchical Identity Based Encryption Scheme without Random Oracles
• A New Fair Queueing Algorithm with Dynamic Service Probability Adjustment(Communication Theory and Signals)

スポンサーリンク