VoroNet: A scalable object network based on Voronoi tessellations

Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Volumn , Issue , 2007, Pages

  Beaumont, Olivier ^a   Kermarrec, Anne Marie ^b   Marchal, Loris ^c   Rivière, Étienne ^d  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b CAMPUS DE BEAULIEU   (France)

^c UNIVERSITÉ DE LYON   (France)

^d UNIVERSITÉ DE RENNES 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DATA ACQUISITION; MATHEMATICAL MODELS;

DATA DISTRIBUTIONS; HASHING FUNCTIONS; OVERLAY NETWORKS; VORONOI DIAGRAM; VORONOI TESSELLATIONS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34548731818     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2007.370210     Document Type: Conference Paper

References (15)

1. E Araújo and L. Rodrigues. Long range contacts in overlay networks. In Euro-par 2005, pages 1153-1162, Lisbon, Portugal, August 2005. Springer-Verlag, LNCS 3648.
2. L. Arge, D. Eppstein, and M. T. Goodrich. Skip-webs: efficient distributed data structures for multi-dimensional data sets. In PODC '05: Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pages 69-76, New York, NY, USA, 2005. ACM Press.
3. F. Aurenhammer and R. Klein. Voronoi diagrams. In J. Sack and G. Urrutia, editors, Handbook of Computational Geometry, pages 201-290. Elsevier Science Publishing, 2000.
4. L. Barrière, P. Fraigniaud, E. Kranakis, and D. Krizanc. Efficient routing in networks with long range contacts. In DISC '01: Proceedings of the 15th International Conference on Distributed Computing, pages 270-284, London, UK, 2001. Springer-Verlag.
5. O. Beaumont, A.-M. Kermarrec, L. Marchal, and É. Rivière. VoroNet: A scalable object network based on voronoi tessellations. Research report, INRIA, Feb 2006.
6. J.-D. Boissonnat and M. Yvinec. Algorithmic Geometry. Cambridge University Press, 1998.
7. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. Could any graph be turned into a small world? Theoretical Computer Science, 2005.
8. J. Kleinberg. Navigation in a small world. Nature, 406, 2000.
9. J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proc. 32nd ACM Symposium on Theory of Computing, 2000.
10. X.-Y. Li, Y. Wang, and O. Frieder. Localized routing for wireless ad hoc networks. In Proc. of IEEE ICC, 2003.
11. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of Middleware, 2001.
12. M. Steiner and E.-W. Biersack. A fully distributed peer to peer structure based on 3D Delaunay triangulation. In Algotel 2005, 7emes Rencontres Francophones sur les aspects Algorithmiques des Télé communications, May 11-13, 2005 - Presqu'île de Giens, France, May 2005.
13. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of SIGCOMM'01, 2001.
14. K. Sugihara. Robust geometric computation based on topological consistency. In ICCS '01: Proceedings of the International Conference on Computational Sciences-Part I, pages 12-26, London, UK, 2001. Springer-Verlag.
15. K. Sugihara and M. Iri. Construction of the Voronoi Diagram for "One Million" Generators in Single-Precision Arithmetic. Proceedings of the IEEE, 80:1471-1484, 1992.