This paper presents VoRaQue, a software layer supporting range queries on Voronoi P2P overlays. VoRaQue maps data in a 2-dimensional space. The P2P overlay is defined by links connecting nodes that are close in the 2-dimensional space and by a set of long-range links which guarantee a poly-logarithmic routing. When a query is submitted, VoRaQue finds out a node belonging to the region defined by the query. A multicast spanning tree covering that region is then built by applying compass routing, a distributed protocol to embed a spanning tree into a Delaunay Triangulation. The paper presents the basic VoRaQue protocol, then introduces a set of optimizations and finally presents some experimental results.
VoRaQue: RAnge QUeries on voronoi overlays
Baraglia R
2008
Abstract
This paper presents VoRaQue, a software layer supporting range queries on Voronoi P2P overlays. VoRaQue maps data in a 2-dimensional space. The P2P overlay is defined by links connecting nodes that are close in the 2-dimensional space and by a set of long-range links which guarantee a poly-logarithmic routing. When a query is submitted, VoRaQue finds out a node belonging to the region defined by the query. A multicast spanning tree covering that region is then built by applying compass routing, a distributed protocol to embed a spanning tree into a Delaunay Triangulation. The paper presents the basic VoRaQue protocol, then introduces a set of optimizations and finally presents some experimental results.File | Dimensione | Formato | |
---|---|---|---|
prod_91908-doc_128790.pdf
solo utenti autorizzati
Descrizione: VoRaQue: RAnge QUeries on voronoi overlays
Tipologia:
Versione Editoriale (PDF)
Dimensione
3.06 MB
Formato
Adobe PDF
|
3.06 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.