1 / 10

Secure Distributed Hashtables with Pastry Routing

Learn about Distributed Hashtables based on Plaxton's work including examples like Tapestry, Chord, and CAN. Understand the concept of Pastry routing and how nodes receive randomly assigned addresses for network proximity. Explore message forwarding using address prefixes for efficient routing.

arthurblake
Download Presentation

Secure Distributed Hashtables with Pastry Routing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Security (part 5) CPS210 Spring 2006

  2. Example SCA Identify the service Identify the SCA type Where to place verification Message to send

  3. SCA Verification

  4. Vulnerable code Stack pointer What is happening here?

  5. Dynamic dataflow analysis 400th byte move byte ptr[esp + eax + 4], cl 100th byte from network

  6. Pastry routing • Distributed Hashtables (DHT) • Based on theoretical work by Plaxton • Other examples: Tapestry, Chord, CAN • All nodes receive an address • Must be assigned randomly • Keep network and address proximity apart • Forward based on address prefixes

  7. Example: send to 10233102 • 1) Fwd to nearest address beginning w/ 1 • 2) “ … “ 10 • … • 7) “…” 1023310 • 8) Forward to host with address 10233102 • Message converges on destination

  8. 221 220 210 View from address space 000 111 111 to 220

  9. 220 221 210 View from network space 111 111 to 220

  10. Closest in NodeId space Closest in network Closest nodes beginning with 0, 1, 2, 3 Closest nodes beginning with 10, 11, 12, 13 Closest nodes beginning with 100, 101, 102, 103 Pastry routing table

More Related