By Topic

Cost-effective complex service mapping in cloud infrastructures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

In cloud computing, instead of building their own network and facilities, companies can allocate resources from network operators, thus reducing hardware investment and maintenance cost. The company's IT infrastructure can be designed as an abstract virtual graph of services to be mapped into the substrate network of the operator. In this paper, we refer to the virtual graph mapping problem as service composition. How to identify and locate the substrate components to map the virtual graph to in an optimal way is the subject of this paper. We propose three algorithms for three different graph topologies: path, star, and tree, whose complexity is O(V3) + O(ERV2) where V is the set of substrate network nodes and ER is the set of virtual links. We also provide simulations to evaluate the performance of our algorithms.

Published in:

Network Operations and Management Symposium (NOMS), 2012 IEEE

Date of Conference:

16-20 April 2012