On-line load balancing of temporary tasks
Journal of Algorithms
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
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
The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
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
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
The Piazza Peer Data Management System
IEEE Transactions on Knowledge and Data Engineering
Balanced binary trees for ID management and load balance in distributed hash tables
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Brief announcement: prefix hash tree
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Online balancing of range-partitioned data with applications to peer-to-peer systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A framework for structured peer-to-peer overlay networks
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Constructing and querying peer-to-peer warehouses of XML resources
SWDB'04 Proceedings of the Second international conference on Semantic Web and Databases
Self-star Properties in Complex Information Systems
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
The open and autonomous interconnection semantics
ICEC '06 Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet
Delay aware querying with seaweed
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Distributed Storage of High-Volume Environmental Simulation Data: Mantle Modelling
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Peer-to-Peer in Metric Space and Semantic Space
IEEE Transactions on Knowledge and Data Engineering
GridVine: An Infrastructure for Peer Information Management
IEEE Internet Computing
Bootstrapping large-scale DHT networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Decentralized managing of replication objects in massively distributed systems
DaMaP '08 Proceedings of the 2008 international workshop on Data management in peer-to-peer systems
GRaSP: generalized range search in peer-to-peer networks
Proceedings of the 3rd international conference on Scalable information systems
ACM Transactions on Computer Systems (TOCS)
T-Man: Gossip-based fast overlay topology construction
Computer Networks: The International Journal of Computer and Telecommunications Networking
Development Framework for Mobile Social Applications
CAiSE '09 Proceedings of the 21st International Conference on Advanced Information Systems Engineering
Utilizing XML Clustering for Efficient XML Data Management on P2P Networks
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Dynamic Query Processing for P2P Data Services in the Cloud
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Structured overlay for heterogeneous environments: Design and evaluation of oscar
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Information Sharing Modalities for Mobile Ad-Hoc Networks
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Optimal caching for first-order query load-balancing in decentralized index structures
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Data grid model based on structured P2P overlay network
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
The challenges of merging two similar structured overlays: a tale of two networks
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
Scalable distributed indexing and query processing over Linked Data
Web Semantics: Science, Services and Agents on the World Wide Web
A distributed recommender system architecture
International Journal of Web Engineering and Technology
| Hi-index | 0.00 |
The application of structured overlay networks to implement index structures for data-oriented applications such as peer-to-peer databases or peer-to-peer information retrieval, requires highly efficient approaches for overlay construction, as changing application requirements frequently lead to re-indexing of the data and hence (re)construction of overlay networks. This problem has so far not been addressed in the literature and thus we describe an approach for the efficient construction of data-oriented, structured overlay networks from scratch in a self-organized way. Standard maintenance algorithms for overlay networks cannot accomplish this efficiently, as they are inherently sequential. Our proposed algorithm is completely decentralized, parallel, and can construct a new overlay network with short latency. At the same time it ensures good load-balancing for skewed data key distributions which result from preserving key order relationships as necessitated by data-oriented applications. We provide both a theoretical analysis of the basic algorithms and a complete system implementation that has been tested on PlanetLab. We use this implementation to support peer-to-peer information retrieval and database applications.