DocumentCode :
1631361
Title :
Stable, distributed P2P protocols based on random peer sampling
Author :
Oguz, Barlas ; Anantharam, Venkat ; Norros, Ilkka
Author_Institution :
EECS Dept., Univ. of California Berkeley, Berkeley, CA, USA
fYear :
2012
Firstpage :
915
Lastpage :
919
Abstract :
In a peer-to-peer file sharing system based on random contacts where the upload capacity of the seed is small, a single chunk of the file may become rare, causing an accumulation of peers who lack the rare chunk. To prevent this from happening, we propose a protocol where each peer samples a small population of peers and makes an intelligent decision to pick which chunk to download based on this sample. We prove that the resulting system is stable under any arrival rate of peers even if the seed has small, bounded upload capacity.
Keywords :
peer-to-peer computing; protocols; distributed P2P protocols; intelligent decision; peer-to-peer file sharing system; random peer sampling; Bismuth; Lyapunov methods; Markov processes; Peer-to-peer computing; Protocols; Silicon; Stability analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on
Conference_Location :
Monticello, IL
Print_ISBN :
978-1-4673-4537-8
Type :
conf
DOI :
10.1109/Allerton.2012.6483316
Filename :
6483316
Link To Document :
بازگشت