• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International IFIP-TC6 Networking Conference(NETWORKING 2004); 20040509-20040514; Athens; GR >Routing in Turn-Prohibition Based Feed-Forward Networks
【24h】

Routing in Turn-Prohibition Based Feed-Forward Networks

机译：基于禁止转弯的前馈网络中的路由

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

摘要

The application of queuing theory to communications systems often requires that the respective networks are of a feed-forward nature, that is they have to be free of cyclic dependencies. An effective way to ensure this property is to identify a certain set of critical turns and to prohibit their use. A turn is a concatenation of two adjacent, consecutive links. Unfortunately, current routing algorithms are usually not equipped to handle forbidden turns and the required extensions are nontrivial. We discuss the relevant issues for the example of the widely deployed Dijkstra algorithm. Then, we address the general case and introduce the Turnnet concept, which supports arbitrary combinations of routing algorithms with turn-prohibiting feed-forward mechanisms.
机译：排队论在通信系统中的应用通常要求各个网络具有前馈性质，也就是说，它们必须没有循环依赖性。确保此属性的有效方法是确定一组关键转弯并禁止使用。转弯是两个相邻的连续链接的串联。不幸的是，当前的路由算法通常没有装备来处理禁止的转弯，并且所需的扩展是不平凡的。我们以广泛部署的Dijkstra算法为例讨论相关问题。然后，我们介绍一般情况并引入Turnnet概念，该概念支持带有禁止转弯的前馈机制的路由算法的任意组合。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号