Exploiting routing redundancy via structured peer-to-peer overlays

Zhao, Ben Y.; Huang, Ling; Stribling, Jeremy; Joseph, Anthony D.; Kubiatowicz, John

doi:10.1109/icnp.2003.1249775

Cited by 32 publications

(33 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ongoing work 4 is a knob for tuning the tradeoff between resources used and optimality of the resulting routing table. has shown Tapestry's viability as a resilient routing layer [31].…”

Section: ) Involuntary Node Deletionmentioning

confidence: 99%

Tapestry: A Resilient Global-Scale Overlay for Service Deployment

Zhao

Huang

Stribling

et al. 2004

IEEE J. Select. Areas Commun.

Self Cite

1,351

664

View full text Add to dashboard Cite

Abstract-We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable, locationindependent routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic Decentralized Object Location and Routing (DOLR) API using a self-repairing, softstate based routing layer. This paper presents the Tapestry architecture, algorithms, and implementation. It explores the behavior of a Tapestry deployment on PlanetLab, a global testbed of approximately 100 machines. Experimental results show that Tapestry exhibits stable behavior and performance as an overlay, despite the instability of the underlying network layers. Several widely-distributed applications have been implemented on Tapestry, illustrating its utility as a deployment infrastructure.Index Terms-Overlay networks, peer-to-peer (P2P), service deployment, Tapestry.

show abstract

“…Ongoing work 4 is a knob for tuning the tradeoff between resources used and optimality of the resulting routing table. has shown Tapestry's viability as a resilient routing layer [31].…”

Section: ) Involuntary Node Deletionmentioning

confidence: 99%

Tapestry: A Resilient Global-Scale Overlay for Service Deployment

Zhao

Huang

Stribling

et al. 2004

IEEE J. Select. Areas Commun.

Self Cite

1,351

664

View full text Add to dashboard Cite

show abstract

“…More recent protocols applying similar principles include [19] and [20]. Repair protocols used extensively in many DHT overlays also belong to this category (e.g., [8,21,22]). …”

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

“…This school of approaches mainly focuses on network anomaly and dynamic failure and is not beneficial to normal cases. Some other recently proposed algorithms also address the reliability problems of overlay networks [11,12,13,14], but they treat all the nodes equally without distinguishing the "critical" nodes from the ordinary ones. Indeed, critical nodes do exist in all sorts of distributed systems, such as critical nodes in service [16], in data or resources [11], and in topology.…”

Section: Related Workmentioning

confidence: 99%

“…The dynamic and self-organizing nature of large-scale distributed systems brings more challenges to this issue. Over the past few years, numerous methods and techniques have been proposed for monitoring, modeling, detecting failures [8,9,10], and various schemes have been developed to improve the availability and the system resiliency [11,12,13,14,15] to provide reliable services.…”

Section: Related Workmentioning

confidence: 99%