DocumentCode
2657941
Title
On Delay Performance of Peer-to-Peer Networks with Age-Dependent Branching Processes
Author
Xia, Youqing ; Wang, Hui ; Zhang, Yubao ; Li, Pei
Author_Institution
Res. Center of Comput. Exp. & Parallel Syst. Technol., Nat. Univ. of Defense Technol., Changsha, China
fYear
2011
fDate
4-6 Nov. 2011
Firstpage
132
Lastpage
135
Abstract
In this paper, we extended the Snow Ball algorithm to model Peer-to-Peer (P2P) networks based on the age-dependent branching process. We proved the extended Snow Ball algorithm approached a minimum delay bound in P2P networks. Given a fixed delay T, the maximal population to which a piece of content can be disseminated is derived, based on the age-dependent branching process. Similarly, we also mathematically analyze the minimum delay when the population N is fixed.
Keywords
computer network performance evaluation; delays; peer-to-peer computing; P2P networks; Snow Ball algorithm; age-dependent branching processes; fixed delay; minimum delay bound; peer-to-peer network delay performance; Analytical models; Approximation methods; Delay; Density functional theory; Peer to peer computing; Random variables; Snow; age-dependent branching process; average delay time; lower bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia Information Networking and Security (MINES), 2011 Third International Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-4577-1795-6
Type
conf
DOI
10.1109/MINES.2011.114
Filename
6103738
Link To Document