2006/12/07 by Rudi Cilibrasi, R. Cilibrasi, Zvi Lotker +12
Computer Science · #Peer-to-Peer Network Technologies #cs.DC #cs.IR
paper · pdf · doi:10.48550/arxiv.cs/0612043
15 pages, LaTeX, 1 figure, Proc. 10th Int'nl Conf. Principles Of Distributed Systems (OPODIS), Lecture Notes in Computer Science, Vol. 4305, Springer Verlag, Berlin, 2006, 290--305
arxiv created 2006/12/07 · arxiv updated 2009/12/01
We analyze the ability of peer to peer networks to deliver a complete file among the peers. Early on we motivate a broad generalization of network behavior organizing it into one of two successive phases. According to this view the network has two main states: first centralized - few sources (roots) hold the complete file, and next distributed - peers hold some parts (chunks) of the file such that the entire network has the whole file, but no individual has it. In the distributed state we study two scenarios, first, when the peers are ``patient'', i.e, do not leave the system until they obtain the complete file; second, peers are ``impatient'' and almost always leave the network before obtaining the complete file.