首页> 外文期刊>Networking, IEEE/ACM Transactions on >Maintaining Colored Trees for Disjoint Multipath Routing Under Node Failures
【24h】

Maintaining Colored Trees for Disjoint Multipath Routing Under Node Failures

机译:维护故障节点下不相交多路径路由的彩色树

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

摘要

Colored Trees (CTs) is an efficient approach to route packets along link- or node-disjoint paths in packet-switched networks. In this approach, two trees, namely red and blue, are constructed rooted at a drain such that the path from any node to the drain are link- or node-disjoint. For applications where both the trees are used simultaneously, it is critical to maintain the trees after link or node failures. To this end, this paper develops an algorithm, referred to as SimCT, that efficiently constructs and maintains colored trees under failures using only local information. Even when the entire tree needs to be recomputed, the SimCT algorithm requires 40% lesser messages than previous techniques. The convergence time of the SimCT algorithm is linear in the number of nodes. We show through extensive simulations that the average length of the disjoint paths obtained using the SimCT algorithm is lesser compared to the previously known techniques. The above-mentioned improvements are obtained by exploiting the relationship between DFS numbering, lowpoint values, and the potentials employed for maintaining partial ordering of nodes. The SimCT algorithm is also extended to obtain colored trees in multi-drain networks.
机译:彩色树(CT)是一种有效的方法,可在数据包交换网络中沿链路或节点不相交的路径路由数据包。在这种方法中,两棵树,分别是红色和蓝色,植根于排水沟,使得从任何节点到排水沟的路径都是链接或节点不相交的。对于同时使用两个树的应用程序,在链接或节点发生故障后维护树是至关重要的。为此,本文开发了一种称为SimCT的算法,该算法仅使用本地信息即可有效地构造和维护故障情况下的彩色树。即使需要重新计算整个树,SimCT算法也需要比以前的技术少40%的消息。 SimCT算法的收敛时间在节点数量上是线性的。我们通过广泛的仿真显示,与以前已知的技术相比,使用SimCT算法获得的不相交路径的平均长度要短。通过利用DFS编号,低点值和用于维持节点的部分排序的电位之间的关系可以获得上述改进。 SimCT算法也被扩展为在多排水网络中获得彩色树。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号