Preventive Start-time Optimization to Determine Link Weights against Multiple Link Failures

Yukikazu Hirano, Fujun He, Takehiro Sato, E. Oki
{"title":"Preventive Start-time Optimization to Determine Link Weights against Multiple Link Failures","authors":"Yukikazu Hirano, Fujun He, Takehiro Sato, E. Oki","doi":"10.1109/CloudNet47604.2019.9064130","DOIUrl":null,"url":null,"abstract":"This paper proposes a network design model to minimize the worst-case network congestion against multiple link failures, where link weights of open shortest path first (OSPF) link weights are determined at the beginning of network operation. In the proposed model, which is called a preventive start-time optimization model with multiple-link failure (PSO-M), the number of multiple link failure patterns to support is restricted by introducing a probabilistic constraint called probabilistic guarantee. Under the condition that the total probability of non-connected failure patterns does not exceed a specified probability, PSO-M supports only connected failure patterns to determine the link weights. Numerical results show the effectiveness of proposed model.","PeriodicalId":340890,"journal":{"name":"2019 IEEE 8th International Conference on Cloud Networking (CloudNet)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 8th International Conference on Cloud Networking (CloudNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CloudNet47604.2019.9064130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper proposes a network design model to minimize the worst-case network congestion against multiple link failures, where link weights of open shortest path first (OSPF) link weights are determined at the beginning of network operation. In the proposed model, which is called a preventive start-time optimization model with multiple-link failure (PSO-M), the number of multiple link failure patterns to support is restricted by introducing a probabilistic constraint called probabilistic guarantee. Under the condition that the total probability of non-connected failure patterns does not exceed a specified probability, PSO-M supports only connected failure patterns to determine the link weights. Numerical results show the effectiveness of proposed model.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
预防性的起始时间优化,在多条链路失效的情况下确定链路权重
本文提出了在网络运行初期确定开放最短路径优先(OSPF)链路权值的网络设计模型,以最大限度地减少在多链路故障情况下网络拥塞的最坏情况。该模型被称为带多链路故障的预防性启动时间优化模型(PSO-M),该模型通过引入一个称为概率保证的概率约束来限制支持多链路故障模式的数量。在非连通故障模式的总概率不超过指定概率的情况下,PSO-M只支持连通故障模式来确定链路权值。数值结果表明了该模型的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Preventive Start-time Optimization to Determine Link Weights against Multiple Link Failures Collaborative Traffic Measurement in Virtualized Data Center Networks A stable matching method for cloud scheduling Dynamic Sketch: Efficient and Adjustable Heavy Hitter Detection for Software Packet Processing Minimizing state access delay for cloud-native network functions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1