By Topic

On Delay Performance of Peer-to-Peer Networks with Age-Dependent Branching Processes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Youqing Xia ; Res. Center of Comput. Exp. & Parallel Syst. Technol., Nat. Univ. of Defense Technol., Changsha, China ; Hui Wang ; Yubao Zhang ; Pei Li

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.

Published in:

Multimedia Information Networking and Security (MINES), 2011 Third International Conference on

Date of Conference:

4-6 Nov. 2011