Random Graphs for Peer-to-Peer Overlays
C. Schindelhauer, P. Mahlmann, in: The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.
Download
No fulltext has been uploaded.
Conference Paper
| English
Author
Schindelhauer, Christian;
Mahlmann, Peter
Abstract
Modern peer-to-peer networks consist of several network layers and distributed algorithms providing features like indexing, resource balancing, entry protocols, security, anonymity, and cryptography. Since peer-to-peer networks are highly dynamic, a fundamental task in the design of these networks is to provide high connectivity. We propose a solution by distributed random link exchange algorithms such that the overlay network can be a connected random graph or use a random graph as backbone. Random graphs are expander graphs have logarithmic diameter, high node connectivity, excellent communication properties, and are expander graphs with high probability. In summary: they are an excellent choice to improve the stability and robustness of a dynamic network.
Publishing Year
Proceedings Title
The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop
Issue
222
Page
1-22
LibreCat-ID
Cite this
Schindelhauer C, Mahlmann P. Random Graphs for Peer-to-Peer Overlays. In: The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2008:1-22.
Schindelhauer, C., & Mahlmann, P. (2008). Random Graphs for Peer-to-Peer Overlays. The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, 222, 1–22.
@inproceedings{Schindelhauer_Mahlmann_2008, title={Random Graphs for Peer-to-Peer Overlays}, number={222}, booktitle={The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schindelhauer, Christian and Mahlmann, Peter}, year={2008}, pages={1–22} }
Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer Overlays.” In The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, 1–22. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.
C. Schindelhauer and P. Mahlmann, “Random Graphs for Peer-to-Peer Overlays,” in The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, 2008, no. 222, pp. 1–22.
Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer Overlays.” The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, no. 222, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.
Google Scholar