Cloud service routing in WDM networks with awareness on delay and link failure probability

Yanli Zhang, Y. Shi, Changde Li, Jie Xiao, Bin Wu, H. Wen, Xiaohong Jiang
{"title":"Cloud service routing in WDM networks with awareness on delay and link failure probability","authors":"Yanli Zhang, Y. Shi, Changde Li, Jie Xiao, Bin Wu, H. Wen, Xiaohong Jiang","doi":"10.1109/ICOCN.2014.6987128","DOIUrl":null,"url":null,"abstract":"Cloud service based on data center (DC) has become an attractive choice for abundant applications. Generally, DCs are distributed at different nodes across a given optical network, and users access DCs through predefined routes. From the perspective of service providers, it is important to offer reliable cloud service while taking service delay and service cost into consideration. In this paper, we study the service routing problem in a given optical network to provide cloud services with high reliability, where failure probability and transmission delay of each link are considered as two coupled parameters. The objective is to minimize the total routing cost and design the access routes for the demands originated from each node. To combine together the corresponding delay and the failure probability of each link, we introduce two cost scaling factors which can be flexibly adjusted to control their relative importance (i.e., the weights). Based on mathematical approximation, a novel method is proposed to compute the failure probabilities of individual service paths. This translates our objective function into a linear expression. Then, we formulate an integer linear program (ILP) to solve the problem. The proposed cloud service routing scheme is validated by extensive numerical experiments.","PeriodicalId":364683,"journal":{"name":"2014 13th International Conference on Optical Communications and Networks (ICOCN)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 13th International Conference on Optical Communications and Networks (ICOCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOCN.2014.6987128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Cloud service based on data center (DC) has become an attractive choice for abundant applications. Generally, DCs are distributed at different nodes across a given optical network, and users access DCs through predefined routes. From the perspective of service providers, it is important to offer reliable cloud service while taking service delay and service cost into consideration. In this paper, we study the service routing problem in a given optical network to provide cloud services with high reliability, where failure probability and transmission delay of each link are considered as two coupled parameters. The objective is to minimize the total routing cost and design the access routes for the demands originated from each node. To combine together the corresponding delay and the failure probability of each link, we introduce two cost scaling factors which can be flexibly adjusted to control their relative importance (i.e., the weights). Based on mathematical approximation, a novel method is proposed to compute the failure probabilities of individual service paths. This translates our objective function into a linear expression. Then, we formulate an integer linear program (ILP) to solve the problem. The proposed cloud service routing scheme is validated by extensive numerical experiments.
考虑时延和链路故障概率的WDM网络云业务路由
基于数据中心(DC)的云服务已成为众多应用的诱人选择。数据中心通常分布在给定光网络的不同节点上,用户通过预定义的路由访问数据中心。从服务提供商的角度来看,在考虑服务延迟和服务成本的同时,提供可靠的云服务非常重要。在给定的光网络中,为了提供高可靠性的云服务,我们研究了业务路由问题,其中将每条链路的故障概率和传输延迟视为两个耦合参数。目标是最小化总路由成本,并为每个节点的需求设计访问路由。为了将每条链路相应的延迟和故障概率结合在一起,我们引入了两个成本缩放因子,可以灵活调整以控制它们的相对重要性(即权重)。基于数学逼近,提出了一种计算服务路径失效概率的新方法。这将我们的目标函数转换成线性表达式。然后,我们用整数线性规划(ILP)来求解这个问题。通过大量的数值实验验证了所提出的云服务路由方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信