Output details
11 - Computer Science and Informatics
King's College London
Output title
The Flip Markov Chain and a Randomising P2P Protocol
Type
E - Conference contribution
Name of conference/published proceedings
28th Annual ACM Symposium on Principles of Distributed Computing
Volume number
-
Issue number
-
First page of article
141
ISSN of proceedings
-
Year of publication
2009
URL
-
Number of additional authors
2
Additional information
<12>A peer-to-peer network consists of computers sharing a common protocol, and all peers have identical responsibilities and behavior. The Flip protocol makes local transformations to randomize the network structure. We show this makes the network robust, and easy to search. It allows the network to repair damage and embed new peers in a fully distributed manner. We also prove Flip randomization reaches stationarity in a time polynomial in the network size. This confirms the practical value of the Flip protocol. Research carried out within EPSRC AMORPH project (EP/D00232X/1) for design of P2P networks.
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Algorithms and Bioinformatics
Citation count
4
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
