DistOS 2014W Lecture 18

• • Tapestry
• Distributed .
• Simple key-value store.
• using DHT ( distributed hash table).
• look up table contains : key and value
• DNS as tree but Tapestry as hercically structure.

• • More dtails about Tapestry:
  • how the information flow?
• each nod has neighbour table which that contains the node neighbour number.

• • Tapestry API:
• have four operations called
• each node has ID and each endpoint has GUID (Globally unique identifier).

• • Tapestry look like operating system.