通信学报2001，Vol.22Issue(1)：28-37,10.
基于公平期的循环服务——一种用于ATM网络的简单公平信元调度机制
Fair-cycle-based round robin service——a simple and fair cell scheduling scheme for ATM networks
程东年 1刘增基2
作者信息
- 1. 西安电子科技大学综合业务网国家重点实验室，陕西西安710071
- 2. 西安电子科技大学综合业务网国家重点实验室，陕
- 折叠
摘要
Abstract
In order to schedule cells fairly and cost-effectively in ATMnetworks，this paper develops a new type of fair service scheme called the “fair-cycle-based”round robin service(FCRR for short below).FCRR combines efficiently the fairness of an ideal fair service with the simplicity of a typical“round-robin”service so that it can provide real fair service over each“fair-allocation-cycle”to all connections at low cost very close to that of a simple round robin.Also，we analyze the worse-case fairness(i.e.the maximum unfairness)，the upper cell delay bound，and the computation complexity of an FCRR server.The analysis presented in this paper shows that FCRR compares favorably with the“carry-over round robin”(CORR for short)in terms of both fairness and computation complexity.The numerical results obtained from a simulation study further support the theoretical analysis，with two main conclusions that FCRR is evidently superior to CORR in terms of fairness and can offer higher-rate connections much better delay properties.关键词
异步转移模式/服务质量/公平服务/信元调度分类
信息技术与安全科学引用本文复制引用
程东年,刘增基..基于公平期的循环服务——一种用于ATM网络的简单公平信元调度机制[J].通信学报,2001,22(1):28-37,10.
