Distributed Construction of a Fault-Tolerant Network from a Tree

Reiter, Michael K.; Samar, Asad; Wang, C.

doi:10.1109/reldis.2005.16

Cited by 14 publications

(11 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the proposal in [11] requires obtaining global locks on Hamiltonian cycles when nodes join, which is clearly impractical in a dynamic P2P environment. In contrast, other studies, e.g., [12], [13], have presented less sophisticated algorithms for building random ðd; Þ-regular graphs, where each node in the graph has the degree within ½d À ; d. Although random d-regular or ðd; Þ-regular graphs are attractive to unstructured P2P systems due to low diameter and large flooding scope, nodes connect one another with the same probability, and therefore, cannot minimize their communication latencies. In Section 5, we will show that the averaged broadcasting scope provided by our proposal is comparable to that of random regular graphs.…”

Section: Related Workmentioning

confidence: 67%

“…Notably, a random regular graph in which nodes have degrees within ½Á À ; Á þ is a good expander [11], [12], [13], thus guaranteeing a large broadcasting scope for any node in the graph. However, to the best of our knowledge, building unstructured overlay networks based on random graph techniques (e.g., the designs in [11], [12], [13]) does not take physical communication delays into consideration.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks

Hsiao

Liao

Huang

2009

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Prior studies show that more than 70 percent of communication paths in a popular unstructured peer-to-peer (P2P) system (i.e., Gnutella) do not exploit the physical network topology, leading to the topology mismatch problem, and thus, lengthen communication between participating peers. While previous efforts in solving overlay topology matching problems do not guarantee the bounds of performance metrics (e.g., the communication delay between any two overlay peers and the broadcasting scope of any participating peer), in this paper, we present a novel topology matching algorithm that has provable performance qualities. In our proposal, each participating node creates and manages a constant number of overlay connections to other peers in a distributed manner. In rigorous performance analysis, we show that 1) the expected overlay communication delay between any two nodes in our P2P network is a constant; 2) in addition, any joining node has the exponential broadcasting scope in expectation; 3) furthermore, a participating node takes a polylogarithmic overhead to exploit the physical network locality and maintain its flooding scope. Together with extensive simulations, we present our proposal that significantly outperforms two recent solutions, i.e., THANCS and mOverlay, in terms of overlay communication latency and/or broadcasting scope.

show abstract

Section: Related Workmentioning

confidence: 67%

Section: Introductionmentioning

confidence: 99%

Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks

Hsiao

Liao

Huang

2009

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Additionally, bypassing the root superpeer makes query responses more efficient especially in the case of a degenerated tree. Reiter [17] presented an algorithm for constructing a fault-tolerant communication structure out of a core tree structure where each node initially only knows its parent and children. Their focus is the construction of an expander graph from a tree, using a random walk for collecting new edges such that the nodes in the graph have node degrees close to some constant.…”

Section: Interconnectionsmentioning

confidence: 99%

Globase.KOM - A P2P Overlay for Fully Retrievable Location-based Search

Kovačević

Liebau

Steinmetz

2007

Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007)

View full text Add to dashboard Cite

Location based services are becoming increasingly popular as devices that determine geographical position become more available to end users. The main problem of existing solutions to location-based search is keeping information updated requires centralized maintenance at specific times. Therefore, retrieved results do not include all objects that exist in reality. A peer-to-peer (P2P) approach can easily overcome this issue as peers are responsible for the information users are searching for. Unfortunately, current state-of-the-art overlays cannot fulfill the requirements for efficient and fully retrievable location-based search. In this paper we present Globase.KOM, a hierarchical treebased P2P overlay that enables fully retrievable locationbased overlay operations which proved to be highly efficient and logarithmically scalable.

show abstract

“…A different approach for distributed construction of expanders is proposed in [22]. The authors suggest using uniform sampling to select, for each node, a set of expander-neighbors.…”

Section: Introductionmentioning

confidence: 99%

“…The authors suggest using uniform sampling to select, for each node, a set of expander-neighbors. The goal in [22] is to construct an "almost" regular graph, where each node maintains a list of expander neighbors of size between d − c and d + c, where d is the desired degree of the almost regular graph and c is a small constant. When a node v selects a node u to be its neighbor, v sends a JOIN message to u.…”

Section: Introductionmentioning

confidence: 99%

Spanders

Tzachar

2010

Proceedings of the 2010 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. We use folklore results to randomly define an expander graph. Given the randomized nature of our algorithms, a monitoring technique is presented for ensuring the desired results. The monitoring is based on the fact that expanders have a rapid mixing time and the possibility of examining the rapid mixing time by O(nlogn) short (O(log 4 n) length) random walks even for non regular expanders. We then employ our results to construct a hierarchical sequence of spanders, each of them an expander spanning the previous one. Such a sequence of spanders may be used to achieve different quality of service assurances in different applications. Several snap-stabilizing algorithms that are used to utilize the monitoring are presented, including reset and token tracing algorithms for message passing systems.

show abstract

Distributed Construction of a Fault-Tolerant Network from a Tree

Abstract: Abstract

Cited by 14 publications

References 44 publications

Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks

Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks

Globase.KOM - A P2P Overlay for Fully Retrievable Location-based Search

Spanders

Contact Info

Product

Resources

About