Skip to Main Content
In order to manage search-, and routing-functionality in structured P2P-networks, a lot of algorithms like CAN, Chord, Tapestry, Pastry, and more have been developed. In this paper we introduce a distributed algorithm which uses a set of simple rules to build and maintain a complete, parallel-growing and although contradiction-free grid-structure just by the use of local knowledge of each node. This leads to a large-scale growth of a decentralized network based on a global n-dimensional cartesian coordinate-system built without any global instance.
Date of Conference: 20-21 July 2009