The Science of Fractal Images
Representation of fractal curves by means of L systems
APL '96 Proceedings of the conference on Designing the future
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating 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
Towards Optimal Locality in Mesh-Indexings
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Flexible Information Discovery in Decentralized Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
A scalable content-addressable network
A scalable content-addressable network
From Home to World - Supporting Context-aware Applications through World Models
PERCOM '04 Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications (PerCom'04)
Efficiently Managing Context Information for Large-Scale Scenarios
PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
On the metric properties of discrete space-filling curves
IEEE Transactions on Image Processing
Performance Evaluation of Overlay-Based Range Queries in Mobile Systems
Wireless Systems and Mobility in Next Generation Internet
Replication in Peer-to-Peer Systems
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
Scalable spatial information discovery over Distributed Hash Tables
Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE
| Hi-index | 0.00 |
Running context-based systems with a fixed infrastructure involves substantial investments. There have been efforts to replace those systems with self-organizing ones. Therefore, recent systems use peer-to-peer (P2P) technology as a basis. Context-information is bound to a specific location and thus should be stored on a nearby node. Common P2P algorithms use one-dimensional ID spaces. However, locations have at least two coordinates, namely x and y. We use space-filling curves to map the two-dimensional area onto the one-dimensional ID space. In this paper we discuss the suitability of different space-filling curves for the average case and for stochastic scenarios.