International Journal for Development of Computer Science & Technology (IJDCST)
Peer-to-peer networks are popular platforms for many applications. To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users. The resilience of random graphs to lifetime-based node failure and derives the expected delay before a user is forcefully isolated from the graph and the probability that this occurs within their lifetime. In this paper, the authors revisit link lifetimes in random P2P graphs under dynamic node failure and create a unifying stochastic model that generalizes the majority of previous efforts in this direction.