Users of the peer-to-peer system join and leave the network randomly, which makes the overlay network dynamic and unstable in nature. In this paper, we propose an analytical framework to assess the robustness of p2p networks in the face of user churn. We model the peer churn through degree-independent as well as degree-dependent node failure. Lately, superpeer networks are becoming the most widely used topology among the p2p networks. Therefore, we perform the stability analysis of superpeer networks as a case study. We validate the analytically derived results with the help of simulation.

Dissemination of information has been one of the prime needs in almost every kind of communication network. The existing algorithms for this service, try to maximize the coverage, i.e., the number of distinct nodes to which a given piece of information could be conveyed under the constraints of time and energy. However, the problem becomes challenging for unstructured and decentralized environments. Due to its simplicity and adaptability, random walk (RW) has been a very useful tool for such environments. Different variants of this technique have been studied. In this paper, we study a history-based non-uniform proliferating random strategy where new walkers are dynamically introduced in the sparse regions of the network. Apart from this, we also study the breadth-first characteristics of the random walk-based algorithms through an appropriately designed metrics.