Algorithmic geometry
ACM Transactions on Computer Systems (TOCS)
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Efficient Routing in Networks with Long Range Contacts
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Meghdoot: content-based publish/subscribe over P2P networks
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Skip-webs: efficient distributed data structures for multi-dimensional data sets
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Ordered Slicing of Very Large-Scale Overlay Networks
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Compositional gossip: a conceptual architecture for designing gossip-based applications
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Small-world networks: from theoretical bounds to practical systems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
Application-layer multicasting with Delaunay triangulation overlays
IEEE Journal on Selected Areas in Communications
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Peer-to-peer architectures for massively multiplayer online games: A Survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way that they reflect the structure of the application. Peers represent objects of the application so that neighbours in the peer to peer network are objects having similar characteristics from the application's point of view. Such structured peer to peer overlay networks provide a natural support for range queries. While some complex structures such as a Voronoï tessellation, where each peer is associated to a cell in the space, are clearly relevant to structure the objects, the associated cost to compute and maintain these structures is usually extremely high for dimensions larger than 2. We argue that an approximation of a complex structure is enough to provide a native support of range queries. This stems from the fact that neighbours are important while the exact space partitioning associated to a given peer is not as crucial. In this paper, we present the design, analysis and evaluation of RayNet, a loosely structured Voronoï-based overlay network. RayNet organizes peers in an approximation of a Voronoï tessellation in a fully decentralized way. It relies on a Monte-Carlo algorithm to estimate the size of a cell and on an epidemic protocol to discover neighbours. In order to ensure efficient (polylogarithmic) routing, RayNet is inspired from the Kleinberg's small world model where each peer gets connected to close neighbours (its approximate Voronoï neighbours in Raynet) and shortcuts, long range neighbours, implemented using an existing Kleinberg-like peer sampling.