Skip to search formSkip to main contentSkip to account menu

VoroNet: A scalable object network based on Voronoi tessellations

@article{Beaumont2007VoroNetAS,
  title={VoroNet: A scalable object network based on Voronoi tessellations},
  author={Olivier Beaumont and Anne-Marie Kermarrec and Loris Marchal and Etienne Rivi{\`e}re},
  journal={2007 IEEE International Parallel and Distributed Processing Symposium},
  year={2007},
  pages={1-10},
  url={https://api.semanticscholar.org/CorpusID:8844431}
}
The theoretical analysis of thesystem proves that routing in VoroNet can be achieved in a poly-logarithmic number of hops in the size of the system, and it is shown that Voro net can be built and maintained in a fully decentralized way.
View on IEEE
graal.ens-lyon.fr
71 Citations
Highly Influential Citations
10
Background Citations
28
Methods Citations
25

Figures from this paper

71 Citations

VoRaQue: Range queries on Voronoi overlays

The paper presents the basic VoRaQue protocol, a software layer supporting range queries on Voronoi P2P overlays, then introduces a set of optimizations and finally presents some experimental results.

Hivory: Range Queries on Hierarchical Voronoi Overlays

Hivory is presented, a P2P overlay based on a Voronoi tessellation defined by the objects published by peers, and a set of experimental results are provided.

Peer to Peer Multidimensional Overlays: Approximating Complex Structures

It is argued that an approximation of a complex structure is enough to provide a native support of range queries and this stems from the fact that neighbours are important while the exact space partitioning associated to a given peer is not as crucial.

Polystyrene: the Decentralized Data Shape That Never Dies

The results show that a 51,200-node torus converges back to a full torus in only 10 rounds after 50% of the nodes have crashed, and the dynamic decoupling between physical nodes and virtual ones enabling a fast reshaping.

Efficient Broadcast on Area of Interest in Voronoi Overlays

The proposed algorithm is an advanced version of the Compass Routing algorithm, and it is able to guarantee the delivery of 100% of the packets, while minimizing the total number of packets that travel the network.

A Distributed Greedy Heuristic for Computing Voronoi Tessellations with Applications Towards Peer-to-Peer Networks

The Distributed Greedy Voronoi Heuristic is fast, scalable, works in any geometric space with a distance and midpoint function, and has interesting applications in embedding metrics such as latency in the links of a distributed network.

Metrized Small World Approach for Nearest Neighbor Search

This paper gives the regular approach to the construction of links between data items which provides logarithmical time complexity of the nearest neighbor search in the structure and proposes different construction and search algorithms depending on the properties of the metric which determines the proximity of data items.

Approximate nearest neighbor algorithm based on navigable small world graphs

Optimally Efficient Prefix Search and Multicast in Structured P2P Networks

The DTC approach enables structured P2P networks to perform prefix search, range queries, and multicast in an optimal way by creating a spanning tree over the peers in the search area, using only information available locally on each peer.

AoI-Based Multicast Routing Over Voronoi Overlays With Minimal Overhead

The MABRAVO (Multicast Algorithm for Broadcast and Routing over AoIs in Voronoi Overlays) protocol suite is presented, showing its ability to reduce communication costs to the strictly minimum required.
...
...

22 References

VoroNet : A scalable object network based on Voronoi tessellations 0

The theoretical analysis of the system proves that the routing in VoroNet can be achieved in a poly-logarithmic number of hops in the size of the system and it is shown that VoroNet can be built and maintained in a fully decentralized way.

Pastry: Scalable, distributed object location and routing for large-scale peer-to-

Experimental results obtained with a prototype implementa tion on a simulated network of up to 100,000 nodes confirm Pastry’s scalability, its ability to selfconfigure and adapt to node failures, and its good network loc ality properties.

A fully distributed peer to peer structure based on 3D Delaunay triangulation

The results obtained indicate that there are upper bounds on the time needed to join and on the average number of neighbours maintained by a peer, independent of the total number of nodes in the system.

Long Range Contacts in Overlay Networks

Hop Level can handle churn very well, because it postpones creation of the LRCs until it is necessary, and in this way, nodes that have short lives do not overload the network with their state update requests.

Efficient Routing in Networks with Long Range Contacts

The study shows that the model of Kleinberg can be simplified by using the ring rather than the mesh while preserving the main features of the model, and defines a probability distribution p and studies the performance of greedy routing in G augmented with p.

Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.

Chord: A scalable peer-to-peer lookup service for internet applications

Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.

Could any graph be turned into a small-world?

Kleinberg showed in [4] that these models lack the essential navigability property: in spite of a polylogarithmic diameter, decentralized routing requires the visit of a polynomial number of nodes in these models.

Localized routing for wireless ad hoc networks

The experiments show that the delivery rates of existing localized Delaunay triangulation is used instead of several previously proposed topologies, and the localized routing protocol based on Delauny triangulating works well in practice.

Skip-webs: efficient distributed data structures for multi-dimensional data sets

This work presents a framework for designing efficient distributed data structures for multi-dimensional data, which includes skip-webs, and applies to a general class of data querying scenarios, which include linear (one-dimensional) data, such as sorted sets, as well as multi- dimensional data,such as d-dimensional octrees and digital tries of character strings defined over a fixed alphabet.
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.