n-dimensional border growth
| dc.contributor.author | Berg, Daniel | |
| dc.contributor.author | Unger, Herwig | |
| dc.contributor.editor | Eichler, Gerald | |
| dc.contributor.editor | Kropf, Peter | |
| dc.contributor.editor | Lechner, Ulrike | |
| dc.contributor.editor | Meesad, Phayung | |
| dc.contributor.editor | Unger, Herwig | |
| dc.date.accessioned | 2019-01-11T09:33:35Z | |
| dc.date.available | 2019-01-11T09:33:35Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | Peer-To-Peer (P2P) networks become more and more present in the consumer area as well as in industrial applications. Especially in the industrialand the business area, reliable and scalable protocols are needed, that produce low networkoverhead and react quickly on any network-changes. In this paper a generalization of the Border-Growth-algorithm is introduced, that improves the network's scalability, its connectivity, and decreases its diameter by providing multiple dimensions, rather than just two of them. | en |
| dc.identifier.isbn | 978-3-88579-259-8 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/19025 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | 10th International Conferenceon Innovative Internet Community Systems (I2CS) – Jubilee Edition 2010 – | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-165 | |
| dc.subject | P2P | |
| dc.subject | grid | |
| dc.subject | scalability | |
| dc.subject | decentralized algorithms | |
| dc.subject | self-organization | |
| dc.title | n-dimensional border growth | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 305 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 296 | |
| gi.conference.date | June 3-5, 2010 | |
| gi.conference.location | Bangkok, Thailand | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1