Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

Loguinov, Dmitri; Casas, Juan P.; Wang, Xiaoming

doi:10.1109/tnet.2005.857072

Cited by 171 publications

(230 citation statements)

References 44 publications

Supporting

Mentioning

223

Contrasting

Unclassified

Order By: Relevance

“…De Bruijn graphs De Bruijn graphs are used in algorithms such as Koorde [10], Distance-Halving [15], or ODRI [12], and are extensively discussed in [12,20]. In a de Bruijn graph, any node i is represented by an identifier string (i 1 The resulting directed graph has a fixed out-degree ∆, and a diameter D.…”

Section: Theorem 1 If the Number Of Nodesmentioning

confidence: 99%

“…We next compute L i,D by induction on the dimension D. 2 Loguinov et al [12] refined that result by distinguishing between odd and even values of N . …”

Section: D-dimensional Torimentioning

confidence: 99%

“…This paper takes a first step towards quantifying the level of collaboration that can be expected from each participant, by proposing a model to evaluate the cost each peer incurs for being a part of the overlay. Such a cost model has several useful applications, among which, (1) providing a benchmark that can be used to compare between different proposals, complementary to recent works comparing topological properties of various overlays [7,12], (2) allowing for predicting disincentives, and designing mechanisms that ensure a protocol is strategyproof [16], and (3) facilitating the design of load balancing primitives.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On the Cost of Participating in a Peer-to-Peer Network

Christin

Chuang

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, we model the cost incurred by each peer participating in a peer-to-peer network. Such a cost model allows to gauge potential disincentives for peers to collaborate, and provides a measure of the "total cost" of a network, which is a possible benchmark to distinguish between proposals. We characterize the cost imposed on a node as a function of the experienced load and the node connectivity, and show how our model applies to a few proposed routing geometries for distributed hash tables (DHTs). We further outline a number of open questions this research has raised.

show abstract

Section: Theorem 1 If the Number Of Nodesmentioning

confidence: 99%

“…We next compute L i,D by induction on the dimension D. 2 Loguinov et al [12] refined that result by distinguishing between odd and even values of N . …”

Section: D-dimensional Torimentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Cost of Participating in a Peer-to-Peer Network

Christin

Chuang

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…ODRI [48] is a dynamic overlay based on de Bruijn graphs that preserves the properties of these graphs namely an average constant in and out degree at each node, a diameter that grows logarithmically with the number of nodes, and good resilience to node and link failures. Whereas in a k-Araneola overlay each node is connected to either k or k+1 nodes, in ODRI with the same k parameter, each node has k incoming and between k and O(k ln N ) outgoing links.…”

Section: Tree/mesh-based Systemsmentioning

confidence: 99%

“…However, due to scalability, reliability, security, and congestion and flow control problems, nowadays IP multicast is mostly unavailable over the Internet [30,45]. In recent years, Application Level Multicast (ALM) systems have emerged as a promising alternative to IP multicast for scalable wide-area multicast [6,10,13,14,16,21,24,30,32,37,42,45,47,48,59,60]. In such systems, the multicast is supported at the application level, and hence these systems can be deployed over any network without requiring router support.…”

Section: Introductionmentioning

confidence: 99%

Araneola: A scalable reliable multicast system for dynamic environments

Melamed

Keidar

2008

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

This paper presents Araneola 1 , a scalable reliable application-level multicast system for highly dynamic wide-area environments. Araneola supports multi-point to multi-point reliable communication in a fully distributed manner while incurring constant load (in terms of message and space complexity) on each node. For a tunable parameter k ≥ 3, Araneola constructs and dynamically maintains a basic overlay structure in which each node's degree is either k or k + 1, and roughly 90% of the nodes have degree k. Empirical evaluation shows that Araneola's basic overlay achieves three important mathematical properties of k-regular random graphs (i.e., random graphs in which each node has exactly k neighbors) with N nodes: (i) its diameter grows logarithmically with N ; (ii) it is generally k-connected; and (iii) it remains highly connected following random removal of linear-size subsets of edges or nodes. The overlay is constructed and maintained at a low cost: each join, leave, or failure is handled locally, and entails the sending of only about 3k messages in total, independent of N . Moreover, this cost decreases as the churn rate increases.The low degree of Araneola's basic overlay structure allows for allocating plenty of additional bandwidth for specific application needs. In this paper, we give an example for such a need -communicating with nearby nodes; we enhance the basic overlay with additional links chosen according to geographic proximity and available bandwidth. We show that this approach, i.e., a combination of random and nearby links, reduces the number of physical hops messages traverse without hurting the overlay's robustness as compared to completely random Araneola overlays (in which all the links are random) with the same average node degree.Given Araneola's overlay, we sketch out several message dissemination techniques that can be implemented on top of this overlay. We present a full implementation and evaluation of a gossip-based multicast scheme with up to 10,000 nodes. We show that compared to a (non-overlay-based) gossipbased multicast protocol, gossiping over Araneola achieves substantial improvements in load, reliability, and latency.

show abstract

Multi‐factors oriented study of P2P Churn

Yang

Zhang

et al. 2009

Int J Communication

View full text Add to dashboard Cite

SUMMARYThe dynamics of peers, namely Churn, is an inherent property of peer-to-peer (P2P) systems and is critical to their design and evaluation. Although every excellent P2P protocol has some solution to this issue, studies on Churn are still seldom. This paper studies various factors related to Churn, and uses them to analyze and evaluate P2P protocols. Prior researches on Churn are all based on the P2P network factors in Churn environment, and their difference is whether to use these factors as predecessor references to build Churn analytical models or as successor references to test the models. According to this difference, this paper first divides various factors into two categories: impacting Churn and affected by Churn. There is a causal relationship between these two categories. Factors impacting Churn are cause, and the factors affected by Churn are effect. In this paper, we use this causality to simulate and analyze P2P Churn. Cause is used as the input data and effect is used as the output result. Second, based on the classification of Churn factors, we present a performance evaluation framework and two comparing models. Based on the framework and models, we simulate and analyze three P2P protocols and get some useful results such as the performance of these protocols under Churn, the advantage of Chord over others, and the most important factors impacting Churn. Finally, we present a method to improve recent P2P Churn models by adding some influence factors.

show abstract

Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

Cited by 171 publications

References 44 publications

On the Cost of Participating in a Peer-to-Peer Network

On the Cost of Participating in a Peer-to-Peer Network

Araneola: A scalable reliable multicast system for dynamic environments

Multi‐factors oriented study of P2P Churn

Contact Info

Product

Resources

About