[p2p-hackers] Implementing distributed quadtree in Java

[Günter Dannhäuser]

Hi p2p-hackers,

IŽm looking into what could be summarized as "Geographic service
discovery".
The idea is to use a p2p distributed directory to register and look up
services which provide information about spatial regions.
For efficient search, spatial information is hierarchically organized
in a virtual, distributed quadtree/octree.
This was already done in [1][2][3] and implemented based on the Open
Peer-to-peer Network (C-) library OPeN [4] using the Chord protocol.

Since this is part of a bigger project using Java, I'm now looking for
suitable Java-P2P-middleware to base the implementation on.

Any suggestions or recommendations would be very welcome, especially
opinions on using Bamboo or JXTA (Accord?, JDHT?) for this.

Thanks,
Günter.

[1] Aaron Harwood and Egemen Tanin, Hashing spatial content over
peer-to-peer networks, in Proceedings of the 2003 Australian
Telecommunications, Networks and Applications Conference, CD-ROM,
Melbourne, Australia, 2003
http://www.cs.mu.oz.au/~aharwood/online/HarwoodTanin-2003d.pdf

[2] Egemen Tanin, Aaron Harwood, Hanan Samet, Sarana Nutanong, and
Minh Truong, A serverless 3D world, in Proceedings of the Symposium on
Advances in Geographic Information Systems - ACM GIS, pages 157-165,
Arlington, VA, 2004
http://www.cs.mu.oz.au/~egemen/gis04.pdf

[3] Egemen Tanin, Aaron Harwood, and Hanan Samet, A distributed
quadtree index for peer-to-peer settings, in Proceedings of the
International Conference on Data Engineering - ICDE, pages 254-255,
Tokyo, Japan, 2005
http://www.cs.mu.oz.au/~egemen/icde05.pdf

[4] http://p2p.cs.mu.oz.au/software/OPeN/