By Topic

An overlay approach for service discovery in a large-scale decentralized cloud

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
$33 $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

7 Author(s)
Soung-Yue Liew ; Faculty of Information and Communication Technology, Universiti Tunku Abdul Rahman, Kampar, Malaysia ; Ee Na Teoh ; Phooi Yee Lau ; Poh Kit Chong
more authors

Service discovery is a critical feature in cloud computing. It is often centrally controlled within the cloud fabric, which may lead to many risks, such as performance bottleneck and single point of failure. This paper proposes a new service discovery approach based on Pastry, i.e. a structured peer-to-peer network model, to leverage large-scale decentralized cloud computing. In the proposed P2P-Cloud framework, all virtual machines running in a cloud environment on heterogeneous hosts are considered as peer nodes. Each node has its own resources to share and may request resources from other nodes. In addition, each node has a unique NodeID and each service has a unique ServiceID, generated by a hash function. Pastry is used because it maintains locality while performing routing. To reduce complexity, we further propose a fixed-length prefix, say the first m bits, of the ServiceID to be used as the key for service advertisement and discovery. This enables the service capability of a node to be advertised at multiple peer nodes (known as directory nodes of the service) and thus increases the chance that a user can discover within its proximity, a node which can provide the service required. Our proposed prefix routing approach preserves the locality property of Pastry, and the lookup process for service advertisement/discovery has an order of O(logBM), where B is the number base (i.e. radix) used for constructing the Pastry routing table, and M = 2m is the total number of possible keys in the network.

Published in:

Cloud Computing Congress (APCloudCC), 2012 IEEE Asia Pacific

Date of Conference:

14-17 Nov. 2012