A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
A peer-to-peer approach to content-based publish/subscribe
Proceedings of the 2nd international workshop on Distributed event-based systems
Information Processing Letters
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Meghdoot: content-based publish/subscribe over P2P networks
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Mirinae: A peer-to-peer overlay network for large-scale content-based publish/subscribe systems
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
A structural approach to latency prediction
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Stabilizing Peer-to-Peer Spatial Filters
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Constructing scalable overlays for pub-sub with many topics
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Approaching neighbor proximity and load balance for range query in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards a lightweight content-based publish/subscribe services for peer-to-peer systems
International Journal of Grid and Utility Computing
Brushwood: distributed trees in peer-to-peer systems
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Hi-index | 0.01 |
Distributed R-trees (DR-trees) are appealing infrastructures for implementing range queries, content based filtering or k-NN structures since they inherit the features of R-trees such as logarithmic height, bounded number of neighbors and balanced shape. Interestingly, the mapping between the DR-tree logical nodes and the physical nodes has not yet received sufficient attention. In previous works, this mapping was naively defined either by the order physical nodes join/leave the system or by their semantics. Therefore, an important gap in terms of load and latency can be observed while comparing the theoretical work and the simulation/experimental results. This gap is partially due to the placement of virtual nodes. A naive placement that totally ignores the heterogeneity of the network may generate an unbalanced load of the physical system. In order to improve the overall system performances, this paper proposes mechanisms for placement and dynamic migration of virtual nodes that balances the load of the network without modifying the DR-tree virtual structure. That is, we reduce the gap between the theoretical results and the practical ones by injecting (at the middleware level) placement and migration strategies for virtual nodes that directly exploit the physical characteristics of the network. Extensive simulation results show that significant performance gain can be obtained with our mechanisms. Moreover, due to its generality, our approach can be easily extended to other overlays or P2P applications (e.g. multi-layer overlays or efficient P2P streaming).