摘要
主要提出了一种基于RPR环网中的带宽公平分配方案。该方案以R IAS公平为原则,首先为环网中的每个数据流确定一条瓶颈链路,然后根据瓶颈链路的约束条件得出各数据流速率的取值范围,并最终为环网上所有的数据流确定一个可行的速率分配。给出了该方案具体的运作机制,并通过实例进一步验证了该方案能达到R IAS公平的要求,实现环网上链路带宽的公平分配与充分利用。
This paper mainly proposes one fair rate allocation scheme in RPR networks. Based on the RIAS fairness, the scheme firstly determines a bottleneck link for each flow on the RPR ring, then produces a rate range for each flow according to the relevant constraints on its bottleneck link, and finally results in a feasible rate allocation for all the flows on the RPR ring. One algorithm for the scheme is presented in detail. On example further demonstrates that the algorithm meets the requirements of the RIAS fairness and realizes the fair allocation and full utilization on the whole RPR ring.
出处
《计算机应用研究》
CSCD
北大核心
2005年第11期198-199,202,共3页
Application Research of Computers
基金
国家"973"基金资助项目(2003CB314804)
国家自然科学基金资助项目(60473085)
关键词
RPR网络
RIAS公平
瓶颈链路
最大数据流
RPR Network
RIAS ( Ring Ingress Aggregated With Spatial Reuse) Fairness
Bottleneck-Link
Maximal Flow