Self-Stabilizing Structured Ring Topology P2P Systems

Shaker, Ahmed; Reeves, Douglas S.

doi:10.1109/p2p.2005.34

Cited by 50 publications

(37 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This protocol is specifically tailored to PASTRY and its message complexity is significantly higher than that of T-MAN. More recently, the bootstrapping problem has been addressed in other specific overlays [14,15,16]. These algorithms, although reasonably efficient, are specific to their target overlay networks.…”

Section: Introductionmentioning

confidence: 99%

T-Man: Gossip-based fast overlay topology construction

2009

View full text Add to dashboard Cite

Large-scale overlay networks have become crucial ingredients of fully-decentralized applications and peer-to-peer systems. Depending on the task at hand, overlay networks are organized into different topologies, such as rings, trees, semantic and geographic proximity networks. We argue that the central role overlay networks play in decentralized application development requires a more systematic study and effort towards understanding the possibilities and limits of overlay network construction in its generality. Our contribution in this paper is a gossip protocol called T-MAN that can build a wide range of overlay networks from scratch, relying only on minimal assumptions. The protocol is fast, robust, and very simple. It is also highly configurable as the desired topology itself is a parameter in the form of a ranking method that orders nodes according to preference for a base node to select them as neighbors. The paper presents extensive empirical analysis of the protocol along with theoretical analysis of certain aspects of its behavior. We also describe a practical application of T-MAN for building Chord distributed hash table overlays efficiently from scratch.

show abstract

Section: Introductionmentioning

confidence: 99%

T-Man: Gossip-based fast overlay topology construction

2009

View full text Add to dashboard Cite

show abstract

“…Several papers have addressed fault tolerance in topology maintenance by way of self-stabilization [8,9,43]. Shaker and Reeves [43] give a self-stabilizing maintenance protocol for an ordered ring, where the nodes are organized into a ring based on their logical identifiers (e.g., the identifier ring used by Chord).…”

Section: Related Workmentioning

confidence: 99%

“…Shaker and Reeves [43] give a self-stabilizing maintenance protocol for an ordered ring, where the nodes are organized into a ring based on their logical identifiers (e.g., the identifier ring used by Chord). However, the protocol does not maintain the long jumpers (i.e., the long fingers in Chord), and hence it does not maintain a scalable topology.…”

Section: Related Workmentioning

confidence: 99%

“…In other words, it is not clear how a sophisticated topology can be maintained under arbitrarily concurrent joins and leaves using asynchronous messages. Consequently, most existing work (e.g., [8,27,43]) only maintains the correctness, but not the scalability, of a topology. As a result, the topology deteriorates over time, at a rate proportional to the frequency of joins and leaves.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Maintaining the Ranch topology

Misra

Plaxton

2010

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Topology maintenance, or how to handle the possibly concurrent joining and leaving of nodes, is a central problem for structured peer-to-peer networks. A good topology maintenance protocol should run efficiently, fully maintain the topology, and should not unduly restrict concurrency. In this paper, we present such a protocol for a multi-ring topology called Ranch. The protocol is efficient: for each join or leave, it uses a logarithmic number of messages with high probability. The protocol fully maintains Ranch after joins and leaves, and allows for a high degree of concurrency. To our knowledge, this is the first maintenance protocol that enjoys all of these properties for a structured peer-to-peer network topology.

show abstract

“…We use a standard protocol (such as [2,13,14,20]) to maintain a consistent id space partitioning, i.e. each peer knows its direct left and right neighbor on the ring.…”

Section: Identifier Spacementioning

confidence: 99%