Tapestry (DHT)

Tapestry (DHT)

Tapestry is a distributed hash table which provides a decentralized object location, routing, and multicasting infrastructure for distributed applications. It is composed of a peer-to-peer overlay network offering efficient, scalable, self-repairing, location-aware routing to nearby resources.


The first generation of peer-to-peer applications, including Napster and Gnutella, had restricting limitations such as a central directory for Napster and scoped broadcast queries for Gnutella limiting scalability. To address these problems a second generation of P2P applications were developed including Tapestry, Chord, Pastry, and CAN. These overlays implement a basic key-based routing mechanism. This allows for deterministic routing of messages and adaptation to node failures in the overlay network.Tapestry is an extensible infrastructure that provides decentralized object location and routing focusing on efficiency and minimizing message latency. This is achieved since Tapestry constructs locally optimal routing tables from initialization and maintains them in order to reduce routing stretch. Furthermore, Tapestry allows object distribution determination according to the needs of a given application. Similarly Tapestry allows applications to implement multicasting in the overlay network.



Each node is assigned a unique nodeID uniformly distributed in a large identifier space. Tapestry uses SHA-1 to produce a 160-bit identifier space represented by a 40 digit hex key.Application specific endpoints GUID's are similarly assigned unique identifiers. NodeID's and GUID's are roughly evenly distributed in the overlay network with each node storing several different ID's. From experiments it is shown that Tapestry efficiency increases with network size so multiple applications sharing the same overlay network increases efficiency. To differentiate between applications a unique application identifier is used.Tapestry uses best-effort to publish and route objects.
*RouteToNode (no exact match instead closest match)


Routing Mesh

Each identifier is mapped to a live node called the root. If a node's nodeID is G then it is the root else use the routing table's nodeID's and IP addresses to find the nodes neighbors. At each hop a message is progressively routed closer to G by incremental suffix routing.Each neighbor map has multiple levels where each level contains links to nodes matching up to a certain digit position in the ID. The primary i'th entry in the j'th level is the ID and location of the closest node that begins with prefix(N, j-1)+i. This means that level 1 has links to nodes that have nothing in common level 2 have the first digit in common, etc. Because of this routing takes approximately log_B N hops in a network of size N and IDs of base B (hex: B=16).If an exact ID can not be found the routing table will route to the closest matching node. For fault tolerance, nodes keep c secondary links such that the routing table has size c*B*log_B N.

Object Publication and Location

Participants in the network can publish objects by periodically routing a publish message toward the root node. Each node along the path stores a pointer mapping the object. Multiple servers can publish pointers to the same object. The redundant links are prioritized by latency and/or locality.Objects are located by routing a message towards the root of the object. Each node along the path checks the mapping and redirects the request appropriately. The effect of routing is convergence of nearby paths heading to the same destination.

Dynamic Nodes

Node Insertion

The new node becomes then root for its nodeID. The root finds the length of the longest prefix of the ID it shares. Then it sends a multicast message that reaches all existing nodes sharing the same prefix. These nodes then add the new node to their routing tables. The new node may take over being the root for some of the roots objects. The nodes will contact the new node to provide a temporary neighborhood list. The new node then performs an iterative nearest neighbor search to fill all levels in its routing table.

Node Departure

To leave the network a node broadcasts its intention of leaving and transmits the replacement node for each level in the routing tables of the other nodes. Objects at the leaving node are redistributed or replenished from redundant copies.

Node Failure

Unexpected node failure is handled through redundancy in the network and backup pointers to reestablish damaged links.


Tapestry provides an overlay routing network that is stable under a variety of network conditions. Therefore Tapestry provides an ideal infrastructure for distributed applications and services. Applications based on tapestry are:
*OceanStore - Distributed storage utility on PlanetLab
* [http://www.cs.rice.edu/Conferences/IPTPS02/107.pdf Mnemosyne] - Steganographic file system
*Bayeux - Self organizing multicasting application
*Spamwatch - Decentralized spam filter


Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph and John D. Kubiatowicz

See also

* Chord (DHT)
* Kademlia
* Pastry (DHT)

External links

* [http://current.cs.ucsb.edu/projects/chimera/ Tapestry project] and new implementation called Chimera
* [http://pdos.csail.mit.edu/~strib/docs/tapestry/tapestry_jsac03.pdf Tapestry: A Resilient Global-Scale Overlay for Service Deployment]

Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Tapestry (disambiguation) — Tapestry is a form of textile art.Tapestry or tapestries may also refer to:In computer science:* Tapestry (DHT), a distributed hash table protocol * Tapestries MUCK, an online MUCK * Tapestry (programming), a Java web application framework that… …   Wikipedia

  • DHT — (англ. Distributed Hash Table  «распределённая хеш таблица»)  это класс децентрализованных распределённых систем, которые обеспечивают поисковый сервис, похожий по принципу работы на таблицу хешей, и имеют структуру: (имя, значение),… …   Википедия

  • Pastry (DHT) — This article describes the Pastry Distributed Hash Table. For the food, see Pastry. Pastry is an overlay and routing network for the implementation of a distributed hash table similar to Chord. The key value pairs are stored in a redundant peer… …   Wikipedia

  • Распределённая хеш-таблица — Стиль этой статьи неэнциклопедичен или нарушает нормы русского языка. Статью следует исправить согласно стилистическим правилам Википедии. DHT (англ. Distributed Hash Table  «распределённая хеш …   Википедия

  • Kademlia — is a distributed hash table for decentralized peer to peer computer networks designed by Petar Maymounkov and David Mazières [* [http://pdos.csail.mit.edu/ petar/papers/maymounkov kademlia lncs.pdf Kademlia: A Peer to peer information system… …   Wikipedia

  • Chord (peer-to-peer) — In computing, Chord is a protocol and algorithm for a peer to peer distributed hash table. A distributed hash table stores key value pairs by assigning keys to different computers (known as nodes ); a node will store the values for all the keys… …   Wikipedia

  • Chord (distributed hash table) — Chord is one of the original distributed hash table protocols. Chord is being developed at MIT and the current Chord source code can be downloaded and used under the MIT License.Overview Using the Chord lookup protocol, node keys are arranged in… …   Wikipedia

  • Distributed hash table — A distributed hash table (DHT) is a class of a decentralized distributed system that provides a lookup service similar to a hash table; (key, value) pairs are stored in a DHT, and any participating node can efficiently retrieve the value… …   Wikipedia

  • Tabla de Hash Distribuido — Las tablas de hash distribuidas (en inglés, Distributed Hash Tables, DHT) son una clase de sistemas distribuidos descentralizados que proveen un servicio de búsqueda similar al de las tablas de hash, donde pares (clave, valor) son almacenados en… …   Wikipedia Español

  • Distributed hash table — Table de hachage distribuée Pour les articles homonymes, voir DHT. Une table de hachage distribuée (ou DHT pour Distributed Hash Table), est une technologie permettant l identification et l obtention, dans un système réparti, comme certains… …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”