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

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.