The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Proceedings of the thirteenth ACM international conference on Information and knowledge management
A Scalable P2P Platform for the Knowledge Grid
IEEE Transactions on Knowledge and Data Engineering
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Multi-ring Infrastructure for Content Addressable Networks
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Dynamic load balancing in RCAN content addressable network
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Use of the TRIPOD overlay network for resource discovery
Future Generation Computer Systems
P2P-based multidimensional indexing methods: A survey
Journal of Systems and Software
Semi-structured semantic overlay for information retrieval in self-organizing networks
Proceedings of the 21st international conference companion on World Wide Web
XL peer-to-peer pub/sub systems
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
This paper presents a structured P2P overlay SCAN that augments CAN overlay with long links based on Kleinberg's small-world model in a d-dimensional Cartesian space. The construction of long links does not require the estimate of network size. Queries in multi-dimensional data space can achieve O(log n) hops by equipping each node with O(log n) long links and O(d)short links.