首页> 外文期刊>AEU: Archiv fur Elektronik und Ubertragungstechnik: Electronic and Communication >Reducing average delay after link failure in single-link recovery trees using distributed switching mechanism
【24h】

Reducing average delay after link failure in single-link recovery trees using distributed switching mechanism

机译:使用分布式交换机制减少单链路恢复树中链路故障后的平均延迟

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

摘要

Based on the modified MFBG algorithm, the distributed switching mechanism (DSM) is proposed to reduce the average delay after link failure in the preplanned single-link recovery trees. The main principle of the DSM is to use as many links in the blue tree as possible to keep connected, and the key feature is that all the active links comprise a new spanning tree after distributed switching. Simulation results demonstrate the effectiveness of the DSM in reducing the average delay. (c) 2007 Elsevier GmbH. All rights reserved.
机译:基于改进的MFBG算法,提出了一种分布式交换机制(DSM),以减少预先计划的单链路恢复树中链路故障后的平均延迟。 DSM的主要原理是在蓝树中使用尽可能多的链接来保持连接,并且关键特性是在分布式交换之后,所有活动链接都包括一个新的生成树。仿真结果证明了DSM在减少平均延迟方面的有效性。 (c)2007 Elsevier GmbH。版权所有。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号