浏览全部资源
扫码关注微信
1. 解放军理工大学通信工程学院,江苏,南京,210007
2. 南京邮电学院,江苏,南京,210003
3. 解放军理工大学通信工程学院,江苏,南京,210007
4. 南京邮电学院,江苏,南京,210003
Published:2004
移动端阅览
PENG Lai-xian, TIAN Chang, ZHENG Shao-ren. A Novel Fair Scheduling Algorithm for Input-Queued Crossbars[J]. Acta Electronica Sinica, 2004, 32(S1): 48-51.
DOI:
PENG Lai-xian, TIAN Chang, ZHENG Shao-ren. A Novel Fair Scheduling Algorithm for Input-Queued Crossbars[J]. Acta Electronica Sinica, 2004, 32(S1): 48-51. DOI:
本文提出一种新的输入排队crossbar调度算法WMFS(weighted max-min fair scheduling)算法
可以为各个竞争的流提供近似的归一化公平服务
保证了带宽分配的加权max-min公平性.另外
仿真结果表明在均匀业务流到达情况下
WMFS具有100%的吞吐量和良好的时延性能.
We proposed a weighted max-min fair scheduling (WMFS) algorithm
that provides approximately normalized fair service guarantees and weighted max-min fair bandwidth allocation distribution among the contending flows
for input-queued crossbars.Furthermore
results from simulation show that the algorithm is able to achieve asymptotically 100% throughput and low cell latency under uniform traffic.
0
Views
1018
下载量
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution