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.
[1]
Chandrakant D. Patel,et al.
Everything as a Service: Powering the New Information Economy
,
2011,
Computer.
[2]
Jing Yuan,et al.
DAC: Generic and Automatic Address Configuration for Data Center Networks
,
2012,
IEEE/ACM Transactions on Networking.
[3]
Pin-Han Ho,et al.
ILP formulations for p-cycle design without candidate cycle enumeration
,
2010,
TNET.
[4]
Bu-Sung Lee,et al.
Cloud service recommendation and selection for enterprises
,
2012,
2012 8th international conference on network and service management (cnsm) and 2012 workshop on systems virtualiztion management (svm).
[5]
Hong Wen,et al.
Scalable data center network architecture with distributed placement of optical switches and racks
,
2014,
IEEE/OSA Journal of Optical Communications and Networking.