首页> 外文会议>World Congress on Nature and Biologically Inspired Computing >Genetic algorithm for solving Survivable Network Design Problem with Extending-Cycle-Based Protected Working Capacity Envelope
【24h】

Genetic algorithm for solving Survivable Network Design Problem with Extending-Cycle-Based Protected Working Capacity Envelope

机译:基于扩展周期的保护工作容量包络的可生存网络设计问题的遗传算法

获取原文

摘要

The study of protection and prevention against failures is an important problem in communication networks due to the growth of capacity demands for data transmission, especially in the Internet traffic. In this paper, we consider the Survivable Network Design Problem (SNDP) with Protected Working Capacity Envelope (PWCE) called capacity SNDP (ca-SNDP) in which a network topology is modeled by a weighted and undirected graph. The weight of each edge is maximum capacity bandwidth of this edge. A working network (Wn) and a backup network (Bn) will be constructed from this topology. Design survivable network with maximum total bandwith in Wn is objective of ca-SNDP. This paper proposes Extending Cycle (EC) model and genetic algorithm for solving ca-SNDP. We experimented and evaluated the effectiveness of proposed aprroach for solving survivable network design problem.
机译:由于数据传输能力需求的增长,特别是在互联网流量中,对故障的保护和预防的研究是通信网络中的一个重要问题。在本文中,我们考虑具有受保护的工作容量包络(PWCE)的可生存网络设计问题(SNDP),称为容量SNDP(ca-SNDP),其中,网络拓扑是通过加权无向图来建模的。每个边缘的权重是该边缘的最大容量带宽。从此拓扑将构建一个工作网络(Wn)和一个备用网络(Bn)。设计具有最大Wn带宽的可生存网络是ca-SNDP的目标。提出了一种求解ca-SNDP的扩展周期(EC)模型和遗传算法。我们对提出的方法解决可生存的网络设计问题的有效性进行了实验和评估。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号