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

Khac Tuan Le, Thi Thanh Binh Huynh
{"title":"Genetic algorithm for solving Survivable Network Design Problem with Extending-Cycle-Based Protected Working Capacity Envelope","authors":"Khac Tuan Le, Thi Thanh Binh Huynh","doi":"10.1109/NaBIC.2014.6921887","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":209716,"journal":{"name":"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaBIC.2014.6921887","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

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)将以这种拓扑结构为基础构建。设计网络总带宽最大的可生存网络是ca-SNDP的目标。本文提出了求解ca-SNDP的扩展周期模型和遗传算法。我们实验并评估了该方法在解决可生存网络设计问题上的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信