By Topic

Grid generation in decentralized systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Berg, D. ; Lehrgebiet Kommunikationsnetze, Fernuniversitat in Hagen, Hagen, Germany ; Sukjit, P. ; Unger, H.

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.

Published in:

Nonlinear Dynamics and Synchronization, 2009. INDS '09. 2nd International Workshop on

Date of Conference:

20-21 July 2009