首页> 外文期刊>Journal of network and systems management >Designing Connection Oriented Networks for Multi-Domain Path Resilience
【24h】

Designing Connection Oriented Networks for Multi-Domain Path Resilience

机译:设计面向连接的网络以实现多域路径弹性

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

A challenge in network management and control is the ability to account for multi-domain requirements in the network planning process. Especially in Connection Oriented Networks where multi-domain path finding is a critical issue, networks need to be designed in such a manner as to restrict the possibility of erroneous inter-domain path selection. In this paper we propose per-domain topology design considerations that would leverage accurate disjoint path computations in a multi-domain environment, covering requirements of end-to-end path resiliency. In multi-domain environments state information between domains is heavily aggregated, hiding internal topology details dictated by scalability concerns, but also by restrictive domain administration policies for privacy, and security. Disjoint path finding is strongly affected by the aggregation techniques, since they do not provide information on path overlap. To handle this issue we introduce a metric, the Overlap Factor (OF), that quantifies path overlap in domains. The OF can be passed as an additional parameter of the inter-domain information exchange model to evaluate disjoint end-to-end paths. Alternatively, if domains were appropriately designed, this additional parameter might not be needed in evaluating resilient pairs of inter-domain paths. We based our recommended topology design algorithm on exploiting locally known OF values within the context of Genetic Algorithms. Extensive simulations confirm that domains designed using our proposed algorithm, result into accurate multi-domain disjoint path identification, with a high success ratio compared to networks that are designed without inter-domain considerations.
机译:网络管理和控制中的挑战是在网络规划过程中考虑多域需求的能力。尤其是在面向连接的网络中,多域路径查找是一个关键问题,需要以某种方式设计网络,以限制错误的域间路径选择的可能性。在本文中,我们提出了基于域的拓扑设计注意事项,这些构想将在多域环境中利用准确的不相交路径计算来满足端到端路径弹性的要求。在多域环境中,域之间的状态信息被大量聚合,隐藏了内部拓扑详细信息,这些详细信息由可伸缩性问题以及针对隐私和安全性的限制性域管理策略所决定。聚合技术严重影响不相交的路径查找,因为它们不提供有关路径重叠的信息。为了解决此问题,我们引入了一个指标,即“重叠因子(OF)”,用于量化域中的路径重叠。 OF可以作为域间信息交换模型的附加参数传递,以评估不相交的端到端路径。或者,如果对域进行了适当的设计,则在评估域间路径的弹性对时可能不需要此附加参数。我们在遗传算法的上下文中,基于利用本地已知的OF值来建立推荐的拓扑设计算法。大量的仿真证实,使用我们提出的算法设计的域可以实现准确的多域不相交路径识别,与不考虑域间问题而设计的网络相比,具有很高的成功率。

著录项

  • 来源
    《Journal of network and systems management》 |2010年第4期|p.374-394|共21页
  • 作者单位

    Network Management & Optimal Design Laboratory (NETMODE), School of Electrical& Computer Engineering, National Technical University of Athens (NTUA), Zografou,157 73 Athens, Greece;

    rnNetwork Management & Optimal Design Laboratory (NETMODE), School of Electrical& Computer Engineering, National Technical University of Athens (NTUA), Zografou,157 73 Athens, Greece;

    rnNetwork Management & Optimal Design Laboratory (NETMODE), School of Electrical& Computer Engineering, National Technical University of Athens (NTUA), Zografou,157 73 Athens, Greece;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    network design; multi-domain; topology aggregation; disjoint path finding; genetic algorithms;

    机译:网络设计;多域拓扑聚合;不相交的路径发现;遗传算法;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号