Grid generation in decentralized systems

Author

Berg, Daniel ; Sukjit, Panchalee ; Unger, Herwig

Author_Institution

Lehrgebiet Kommunikationsnetze, Fernuniversitat in Hagen, Hagen, Germany

fYear

2009

fDate

20-21 July 2009

Firstpage

95

Lastpage

99

Abstract

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.

Keywords

grid computing; multivariable systems; peer-to-peer computing; P2P networks; decentralized systems; global n-dimensional cartesian coordinate-system; grid generation; routing functionality; search functionality; Centralized control; Distributed algorithms; Fault tolerance; Large-scale systems; Mesh generation; Network topology; Pattern formation; Peer to peer computing; Routing; Sections; P2P; evolutionary algorithms; fault-tolerance; grid; pattern formation; scalability; self-organisation;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Klagenfurt

ISSN

1866-7791

Print_ISBN

978-1-4244-3844-0

Type

conf

DOI

10.1109/INDS.2009.5227976

Filename

5227976