Affiliation:
1. Ecole Polytechnique Fédérale de Lausanne (EPFL)
2. Nanyang Technological University
Abstract
Recent years have seen advances in building large Internet-scale index structures, generally known as
structured overlays
. Early structured overlays realized distributed hash tables (DHTs) which are ill suited for anything but exact queries. The need to support range queries necessitates systems that can handle uneven load distributions. However such systems suffer from practical problems—including poor latency, disproportionate bandwidth usage at participating peers, or unrealistic assumptions on peers' homogeneity, in terms of available storage or bandwidth resources. In this article we consider a system that is not only able to support uneven load distributions but also to operate in heterogeneous environments, where each peer can autonomously decide how much of its resources to contribute to the system. We provide the theoretical foundations of realizing such a network and present a newly proposed system Oscar based on these principles. Oscar can construct efficient overlays given arbitrary load distributions by employing a novel scalable network sampling technique. The simulations of our system validate the theory and evaluate Oscar's performance under typical challenges, encountered in real-life large-scale networked systems, including participant heterogeneity, faults, and skewed and dynamic load-distributions. Thus the Oscar distributed index fills in an important gap in the family of structured overlays, bringing into life a practical Internet-scale index, which can play a crucial role in enabling data-oriented applications distributed over wide-area networks.
Funder
Swiss National Science Foundation
Science and Engineering Research Council, Agency for Science, Technology and Research
Publisher
Association for Computing Machinery (ACM)
Subject
Software,Computer Science (miscellaneous),Control and Systems Engineering
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Capacity Management Protocol for a Structured P2P-based Online Social Network;2020 Seventh International Conference on Social Networks Analysis, Management and Security (SNAMS);2020-12-14
2. Concurrent deterministic 1–2 skip list in distributed message passing systems;International Journal of Parallel, Emergent and Distributed Systems;2014-03-20
3. Merging ring-structured overlay indices: toward network-data transparency;Computing;2012-06-27
4. Peer-to-Peer Data Management;Synthesis Lectures on Data Management;2011-05-31
5. Fuzzynet: Ringless routing in a ring-like structured overlay;Peer-to-Peer Networking and Applications;2010-08-07