An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Skip Lists: A Probabilistic Alternative to Balanced Trees
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
NodeWiz: peer-to-peer resource discovery for grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Brushwood: distributed trees in peer-to-peer systems
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
The ArguGRID Platform: An Overview
GECON '08 Proceedings of the 5th international workshop on Grid Economics and Business Models
Intelligent Agents in the Service-Oriented World - An Industrial Experience Report
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Load balance for semantic cluster-based data integration systems
Proceedings of the 17th International Database Engineering & Applications Symposium
A formal model of agent-oriented virtual organisations and their formation
Multiagent and Grid Systems - Agent Based Computing: From Model to Implementation
| Hi-index | 0.00 |
Peer to Peer (P2P) networking is a potential disruptive technology that can be used for the development of scalable, fully decentralized distributed applications. However, to realize its potential, P2P technology should address the needs of a variety of applications, other than file-sharing requiring support for exact-match queries on the file names. Our work complements and contributes to existing P2P overlays that support multiple-attributes and range queries, using the distributed K-Dimensional (K-D) tree structure for organizing shared information among participating peers. This guarantees that the time needed for node join - leave operations and query times are logarithmic with respect to the number of peers. In such systems, an open issue is load balancing of resources among peers, as only load-balanced data structures can guarantee that the complexity for resolving multi-attribute and range queries remains logarithmic (thus scalable) with respect to the number of participating peers. In this paper, we report a novel load balancing algorithm for dynamically keeping the resource load among peers balanced. We prove that the load balancing algorithm is robust and scalable, achieving an O(log2N) complexity, where N is the number of peers. We illustrate how our algorithm can be used to build a scalable Grid Information Service supporting multi-attribute and range queries on available services within the shared Grid infrastructure.