| Full text | |
| Author(s): |
Zich, J.
;
Kohayakawa, Y.
;
Rodl, V.
;
Sunderam, V.
Total Authors: 4
|
| Document type: | Journal article |
| Source: | INTERNET MATHEMATICS; v. 5, n. 3, p. 24-pg., 2008-01-01. |
| Abstract | |
We propose a self-organizing algorithm that maintains a high degree of connectivity and robustness in unstructured P2P networks. The algorithm is based on the "jump" primitive that periodically replaces overlay links at each node. The algorithm produces and maintains P2P networks that closely approximate sparse random graphs. Although the sparse random graphs have low degree, they are well connected and possess low diameter. This makes them good candidates for common P2P networks. Through a series of simulation experiments, we confirm that the jump algorithm leads to a network topology with these desirable properties if we start with an ad-hoc network. P2P networks conditioned through jumps also accomplish search and broadcast operations very effectively as compared to both simulated and real-life systems such as the Gnutella ultrapeer network. (AU) | |
| FAPESP's process: | 03/09925-5 - Foundations of computer science: combinatory algorithms and discrete structures |
| Grantee: | Yoshiharu Kohayakawa |
| Support Opportunities: | PRONEX Research - Thematic Grants |