首页> 外文期刊>IEEE Journal on Selected Areas in Communications >A local fairness algorithm for gigabit LAN's/MAN's with spatial reuse
【24h】

A local fairness algorithm for gigabit LAN's/MAN's with spatial reuse

机译:具有空间复用功能的千兆位局域网/城域网的局部公平算法

获取原文
获取原文并翻译 | 示例
       

摘要

The authors present an algorithm to provide local fairness for ring and bus networks with spatial bandwidth reuse. Spatial bandwidth reuse can significantly increase the effective throughput delivered by the network. The proposed algorithm can be applied to any dual ring or bus architecture such as MetaRing. In the dual bus configuration, when transporting ATM cells, the local fairness algorithm can be implemented using two generic flow control (GFC) bits in the ATM cell header. In the performance it is shown that this local fairness algorithm can exploit the throughput advantage offered by spatial bandwidth reuse better than a global fairness algorithm. This is accomplished because it ensures fair use of network resources among nodes that are competing for the same subset of links, while permitting free access to noncongested parts of the network. The performance advantage of the local fairness scheme is demonstrated by simulating the system under various traffic scenarios and comparing the results to that of the MetaRing SAT-based global fairness algorithm. It is also shown that under certain traffic patterns, the performance of this algorithm achieves the optimal throughput result predicted by the known Max-Min fairness definition.
机译:作者提出了一种算法,可为具有空间带宽重用的环和总线网络提供局部公平性。空间带宽的重用可以显着提高网络交付的有效吞吐量。所提出的算法可以应用于任何双环或总线架构,例如MetaRing。在双总线配置中,当传输ATM信元时,可以使用ATM信元头中的两个通用流控制(GFC)位来实现局部公平算法。在性能上表明,与全局公平算法相比,该局部公平算法可以更好地利用空间带宽重用所提供的吞吐量优势。之所以能够做到这一点,是因为它确保了争用链路的同一子集的节点之间网络资源的合理使用,同时允许自由访问网络的未拥塞部分。通过在各种交通场景下模拟系统并将结果与​​基于MetaRing SAT的全局公平算法的结果进行比较,证明了本地公平方案的性能优势。还表明,在某些流量模式下,该算法的性能可达到由已知的最大-最小公平性定义预测的最佳吞吐量结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号