Referenced Items are not available for this document.
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
- Page(s):
- 95 - 99
- ISSN :
- 1866-7791
- E-ISBN :
- 978-3-8322-7943-1
- Print ISBN:
- 978-1-4244-3844-0
- INSPEC Accession Number:
- 10861828
- Conference Location :
- Klagenfurt
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
