Structured overlay for heterogeneous environments: Design and evaluation of oscar

@article{Girdzijauskas2010StructuredOF,
  title={Structured overlay for heterogeneous environments: Design and evaluation of oscar},
  author={Sarunas Girdzijauskas and Anwitaman Datta and Karl Aberer},
  journal={ACM Trans. Auton. Adapt. Syst.},
  year={2010},
  volume={5},
  pages={2:1-2:25}
}
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… 

Figures from this paper

Merging ring-structured overlay indices: toward network-data transparency
TLDR
How ring structured overlays can be merged, both in terms of the necessary algorithms, as well as how it performs during the merger process is investigated, taking into account not only the ‘network’ merger process, but also looking into how and whether this process is ‘transparent’ for applications/end-users accessing and using the overlay as an index.
DONUT: Building Shortcuts in Large-Scale Decentralized Systems with Heterogeneous Peer Distributions
TLDR
DonUT is proposed, a mechanism to build a local map that approximates the peer distribution, allowing the peer to accurately estimate graph distance to other peers with a local algorithm, and points out that each map is lightweight and can be efficiently propagated through the network by consuming less than 10 bps on each peer.
Magnet: practical subscription clustering for Internet-scale publish/subscribe
An effective means for building Internet-scale distributed applications, and in particular those involving group-based information sharing, is to deploy peer-to-peer overlay networks. The key
SkewCCC+: A Heterogeneous Distributed Hash Table
TLDR
This work proposes a Peer-to-Peer construction that explicitly uses heterogeneity to simplify the routing and maintenance process even in the presence of an adaptive adversary, using a hypercube and cube connected cycles networks as a backbone.
Query Routing and Processing in Peer-To-Peer Data Sharing Systems
TLDR
Query routing and processing are two problems affected by the absence of a global catalog and proposed solutions for the both problems are concentrated on.
Fuzzynet: Ringless routing in a ring-like structured overlay
TLDR
This paper proposes an overlay called Fuzzynet, which does not rely on the ring invariant, yet has all the functionalities of structured overlays, and shows that with sufficient amount of neighbors, even under high churn, data can be retrieved in Fuzzyynet w.p.h.
Capacity Management Protocol for a Structured P2P-based Online Social Network
  • Newton Masinde, Sebastian Bischoff, Kalman Graffi
  • Computer Science
    2020 Seventh International Conference on Social Networks Analysis, Management and Security (SNAMS)
  • 2020
TLDR
A capacity management protocol is presented that categorizes nodes by their capacities in a formerly flat structured p2 $p$ overlay and converts it into a hierarchical structure by assigning dedicated roles and tasks to the peers involved and is implemented and tested on the authors' P2P framework for OSNs called LibreSocial.
Concurrent deterministic 1–2 skip list in distributed message passing systems
TLDR
A set of distributed algorithms for achieving concurrency in a distributed deterministic 1–2 skip list has message complexity similar to the centralised versions of the algorithms.
Peer-to-Peer Data Management
  • K. Aberer
  • Computer Science
    Peer-to-Peer Data Management
  • 2011
TLDR
This lecture introduces systematically into the problem of managing large data collections in peer-to-peer systems the type of data they manage and the search capabilities they support, and introduces semantic overlay networks which support similarity search on information represented in hierarchically organized and multi-dimensional semantic spaces.
On the link(s) between “D” and “A” in Mobile Data Analytics
  • Goce Trajcevski
  • Computer Science
    2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)
  • 2013
TLDR
This paper presents the DNA2 (Data's Natural Associations with Analytics) hypothesis for coupling the data and control aspects in MODA contexts and discusses in detail the role of uncertainty, along with some aspects of declarative specifications for merging the reactive and the pro-active behavior inMODA.
...
...

References

SHOWING 1-10 OF 48 REFERENCES
SkipNet: A Scalable Overlay Network with Practical Locality Properties
TLDR
SkipNet is a scalable overlay network that provides controlled data placement and guaranteed routing locality by organizing data primarily by string names and can result in two disjoint, but well-connected overlay networks.
Indexing Data-oriented Overlay Networks
TLDR
The proposed algorithm is completely decentralized, parallel, and can construct a new overlay network with short latency, and ensures good load-balancing for skewed data key distributions which result from preserving key order relationships as necessitated by data-oriented applications.
Load Balancing in Structured P2P Systems
TLDR
This paper explores the space of designing load-balancing algorithms that uses the notion of “virtual servers” and presents three schemes that differ primarily in the amount of information used to decide how to re-arrange load.
Distributed k-ary System: Algorithms for Distributed Hash Tables
TLDR
This dissertation presents algorithms for data structures called distributed hash tables (DHT) or structured overlay networks, which are used to build scalable self-managing distributed systems, and describes a novel way to place replicas in a DHT, called symmetric replication, that enables parallel recursive lookups.
Load balancing in dynamic structured P2P systems
TLDR
The simulation results show that in the face of rapid arrivals and departures of objects of widely varying load, the proposed distributed algorithm achieves load balancing for system utilizations as high as 90% while moving only about 8% of the load that arrives into the system.
Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems
TLDR
This paper presents Cruiser, a fast and accurate P2P crawler, which can capture a complete snapshot of the Gnutella network of more than one million peers in just a few minutes, and shows how inaccuracy in snapshots can lead to erroneous conclusions-such as a power-law degree distribution.
Oscar: Small-World Overlay for Realistic Key Distributions
TLDR
An overlay network Oscar is presented, based on a novel overlay construction mechanism, which does not depend on the key-distribution complexity and performs well and significantly surpasses Mercury for such realistic workloads.
GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists Principles
TLDR
GosSkip is presented, a self organizing and fully distributed overlay that provides a scalable support to data storage and retrieval in dynamic environments and proposes a simple and efficient mechanism to exploit the presence of multiple data items on a single physical node.
Simple efficient load balancing algorithms for peer-to-peer systems
TLDR
Two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal are given, refine the consistent hashing data structure that underlies the Chord (and Koorde) P2P network.
...
...