Cloud service provisioning in two types of DCN with awareness of delay and link failure probability

Cloud service provisioning in two types of DCN with awareness of delay and link failure probability Cloud service based on data center network (DCN) has become an attractive choice for various applications. Traditionally, multiple DCs are distributed at different nodes across a given optical network, and users access DCs through predefined routes (this architecture is named as Multiple Independent DCN, MI-DCN). However, as there exist transmission delay and failure probability on each link, such a network may not be a good choice for the service providers from the perspective of service reliability and cost. Therefore, we propose the idea of regrouping all the racks and distributing each rack group on a special node, where there exists a gateway (this architecture is named as Integrated Distributed DCN, ID-DCN). As each group can provide service independently, by properly grouping and routing, the whole network can work more efficiently with lower cost and higher reliability. In this paper, we study the service provision in the above two types of DCN. With the given failure probability and transmission delay on each link, we aim to minimize the total service cost and design the access routes for the demands originated from each node. To integrate the system cost, we introduce two cost scaling factors for delay and failure probability, 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 two integer linear programs (ILP) to compare the solutions of the two scenarios. Via extensive numerical experiments, the performance of the two schemes is properly verified. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

Cloud service provisioning in two types of DCN with awareness of delay and link failure probability

Loading next page...
 
/lp/springer_journal/cloud-service-provisioning-in-two-types-of-dcn-with-awareness-of-delay-uzhmREeZr7
Publisher
Springer US
Copyright
Copyright © 2015 by Springer Science+Business Media New York
Subject
Computer Science; Computer Communication Networks; Electrical Engineering; Characterization and Evaluation of Materials
ISSN
1387-974X
eISSN
1572-8188
D.O.I.
10.1007/s11107-015-0537-8
Publisher site
See Article on Publisher Site

Abstract

Cloud service based on data center network (DCN) has become an attractive choice for various applications. Traditionally, multiple DCs are distributed at different nodes across a given optical network, and users access DCs through predefined routes (this architecture is named as Multiple Independent DCN, MI-DCN). However, as there exist transmission delay and failure probability on each link, such a network may not be a good choice for the service providers from the perspective of service reliability and cost. Therefore, we propose the idea of regrouping all the racks and distributing each rack group on a special node, where there exists a gateway (this architecture is named as Integrated Distributed DCN, ID-DCN). As each group can provide service independently, by properly grouping and routing, the whole network can work more efficiently with lower cost and higher reliability. In this paper, we study the service provision in the above two types of DCN. With the given failure probability and transmission delay on each link, we aim to minimize the total service cost and design the access routes for the demands originated from each node. To integrate the system cost, we introduce two cost scaling factors for delay and failure probability, 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 two integer linear programs (ILP) to compare the solutions of the two scenarios. Via extensive numerical experiments, the performance of the two schemes is properly verified.

Journal

Photonic Network CommunicationsSpringer Journals

Published: Aug 12, 2015

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off