Next Article in Journal
K-Means Cloning: Adaptive Spherical K-Means Clustering
Next Article in Special Issue
Modeling and Evaluation of Power-Aware Software Rejuvenation in Cloud Systems
Previous Article in Journal
Cover Time in Edge-Uniform Stochastically-Evolving Graphs
Previous Article in Special Issue
Reducing the Operational Cost of Cloud Data Centers through Renewable Energy
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(10), 150; https://doi.org/10.3390/a11100150

SLoPCloud: An Efficient Solution for Locality Problem in Peer-to-Peer Cloud Systems

1
School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran 19538-33511, Iran
2
Department of Computer Engineering, Sharif University of Technology, Tehran 11365-11155, Iran
*
Author to whom correspondence should be addressed.
Received: 2 September 2018 / Revised: 30 September 2018 / Accepted: 30 September 2018 / Published: 2 October 2018
(This article belongs to the Special Issue Algorithms for the Resource Management of Large Scale Infrastructures)
Full-Text   |   PDF [466 KB, uploaded 15 October 2018]   |  

Abstract

Peer-to-Peer (P2P) cloud systems are becoming more popular due to the high computational capability, scalability, reliability, and efficient data sharing. However, sending and receiving a massive amount of data causes huge network traffic leading to significant communication delays. In P2P systems, a considerable amount of the mentioned traffic and delay is owing to the mismatch between the physical layer and the overlay layer, which is referred to as locality problem. To achieve higher performance and consequently resilience to failures, each peer has to make connections to geographically closer peers. To the best of our knowledge, locality problem is not considered in any well known P2P cloud system. However, considering this problem could enhance the overall network performance by shortening the response time and decreasing the overall network traffic. In this paper, we propose a novel, efficient, and general solution for locality problem in P2P cloud systems considering the round-trip-time (RTT). Furthermore, we suggest a flexible topology as the overlay graph to address the locality problem more effectively. Comprehensive simulation experiments are conducted to demonstrate the applicability of the proposed algorithm in most of the well-known P2P overlay networks while not introducing any serious overhead. View Full-Text
Keywords: P2P cloud systems; overlay networks; locality problem; generalized hypercube connected cycle P2P cloud systems; overlay networks; locality problem; generalized hypercube connected cycle
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Gharib, M.; Malekimajd, M.; Movaghar, A. SLoPCloud: An Efficient Solution for Locality Problem in Peer-to-Peer Cloud Systems. Algorithms 2018, 11, 150.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top