• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Distributed resolution of network congestion and potential deadlock using reservation-based scheduling
【24h】

Distributed resolution of network congestion and potential deadlock using reservation-based scheduling

机译：使用基于预留的调度来分布式解决网络拥塞和潜在的死锁

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Efficient and reliable communication is essential for achieving high performance in a networked computing environment. Finite network resources bring about unavoidable competition among in-flight network packets, resulting in network congestion and, possibly, deadlock. Many techniques have been proposed to improve network performance by efficiently handling network congestion and potential deadlock. However, none of them provide an efficient way of accelerating the movement of network packets in congestion toward their destinations. In this paper, we propose a new mechanism for detecting and resolving network congestion and potential deadlocks. The proposed mechanism is based on efficiently tracking paths of congestion and increasing the scheduling priority of packets along those paths. This acts to throttle other packets trying to enter those congested regions - in effect, locking out packets from congested regions until congestion has had the opportunity to disperse. Simulation results show that the proposed technique effectively disperses network congestion and is also applicable in helping to resolve potential deadlock.
机译：高效可靠的通信对于在网络计算环境中实现高性能至关重要。有限的网络资源会在飞行中的网络数据包之间带来不可避免的竞争，从而导致网络拥塞甚至可能导致死锁。已经提出了许多技术来通过有效处理网络拥塞和潜在的死锁来提高网络性能。但是，它们都没有提供一种加速拥塞的网络数据包向其目的地移动的有效方法。在本文中，我们提出了一种检测和解决网络拥塞和潜在死锁的新机制。所提出的机制基于有效地跟踪拥塞路径并增加沿这些路径的数据包的调度优先级。这可以阻止其他试图进入那些拥塞区域的数据包-实际上，将数据包从拥塞区域中锁定，直到拥塞有机会消除为止。仿真结果表明，所提出的技术可以有效地分散网络拥塞，也有助于解决潜在的死锁问题。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号