A brokerage-based approach for cloud service selection

Smitha Sundareswaran, Anna Squicciarini, Dan Lin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

154 Scopus citations

Abstract

great opportunities for consumers to find the best service and best pricing, which however raises new challenges on how to select the best service out of the huge pool. It is time-consuming for consumers to collect the necessary information and analyze all service providers to make the decision. This is also a highly demanding task from a computational-perspective, because the same computations may be conducted repeatedly by multiple consumers who have similar requirements. Therefore, in this paper, we propose a novel brokerage-based architecture in the Cloud, where the Cloud brokers is responsible for the service selection. In particular, we design a unique indexing technique for managing the information of a large number of Cloud service providers. We then develop efficient service selection algorithms that rank potential service providers and aggregate them if necessary. We prove the efficiency and effectiveness of our approach through an experimental study with the real and synthetic Cloud data.

Original languageEnglish (US)
Title of host publicationProceedings - 2012 IEEE 5th International Conference on Cloud Computing, CLOUD 2012
Pages558-565
Number of pages8
DOIs
StatePublished - 2012
Event2012 IEEE 5th International Conference on Cloud Computing, CLOUD 2012 - Honolulu, HI, United States
Duration: Jun 24 2012Jun 29 2012

Publication series

NameProceedings - 2012 IEEE 5th International Conference on Cloud Computing, CLOUD 2012

Other

Other2012 IEEE 5th International Conference on Cloud Computing, CLOUD 2012
Country/TerritoryUnited States
CityHonolulu, HI
Period6/24/126/29/12

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'A brokerage-based approach for cloud service selection'. Together they form a unique fingerprint.

Cite this