Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 30 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 12 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

On the Degree Distribution of Faulty Peer-to-Peer Overlays (1105.0545v4)

Published 3 May 2011 in cs.DC

Abstract: This paper presents an analytical framework to model fault-tolerance in unstructured peer-to-peer overlays, represented as complex networks. We define a distributed protocol peers execute for managing the overlay and reacting to node faults. Based on the protocol, evolution equations are defined and manipulated by resorting to generating functions. Obtained outcomes provide insights on the nodes' degree probability distribution. From the study of the degree distribution, it is possible to estimate other important metrics of the peer-to-peer overlay, such as the diameter of the network. We study different networks, characterized by three specific desired degree distributions, i.e. nets with nodes having a fixed desired degree, random graphs and scale-free networks. All these networks are assessed via the analytical tool and simulation as well. Results show that the approach can be factually employed to dynamically tune the average attachment rate at peers so that they maintain their own desired degree and, in general, the desired network topology.

Citations (1)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)