1 / 22

Tapestry: A Resilient Global-Scale Overlay for Service Deployment

Tapestry: A Resilient Global-Scale Overlay for Service Deployment. Tao WU , wutao@infosec.pku.edu.cn. T APESTRY A LGORITHMS. DOLR Networking API Routing and Object Location Dynamic Node Algorithms. T APESTRY A LGORITHMS. DOLR Networking API Routing and Object Location

vidal
Télécharger la présentation

Tapestry: A Resilient Global-Scale Overlay for Service Deployment

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. Tapestry: A Resilient Global-Scale Overlay for Service Deployment Tao WU, wutao@infosec.pku.edu.cn

  2. TAPESTRY ALGORITHMS • DOLR Networking API • Routing and Object Location • Dynamic Node Algorithms

  3. TAPESTRY ALGORITHMS • DOLR Networking API • Routing and Object Location • Dynamic Node Algorithms

  4. DOLR Networking API • NodeID • GUID(Globally unique identifiers) • DOLR APIs: • 1) • 2) • 3) • 4)

  5. TAPESTRY ALGORITHMS • DOLR Networking API • Routing and Object Location • Dynamic Node Algorithms

  6. Routing and Object LocationRouting Mesh

  7. Routing and Object LocationRouting Path

  8. Routing and Object LocationPseudocode for NEXTHOP

  9. Routing and Object LocationObject Publication

  10. Routing and Object LocationObject Location

  11. TAPESTRY ALGORITHMS • DOLR Networking API • Routing and Object Location • Dynamic Node Algorithms

  12. Dynamic Node AlgorithmsNode Insertion Four components: a) Need-to-know nodes are notified of N, because N fills a null entry in their routing tables. b) N might become the new object root for existing objects. References to those objects must be moved to N to maintain object availability. c) The algorithms must construct a near optimal routing table for N. d) Nodes near are notified and may consider using in their routing tables as an optimization.

  13. Dynamic Node AlgorithmsNode Deletion • Voluntary • Involuntary Building redundancy into routing tables and object location references (e.g. backup forwarding pointers). To maintain availability and redundancy, use periodic beacons

  14. TAPESTRYNODEARCHITECTURE • Component Architecture • Upcall Interface • Toward a Higher Performance Implementation

  15. TAPESTRYNODEARCHITECTURE • Component Architecture • Upcall Interface • Toward a Higher Performance Implementation

  16. Component Architecture

  17. Component ArchitectureMessage Processing

  18. TAPESTRYNODEARCHITECTURE • Component Architecture • Upcall Interface • Toward a Higher Performance Implementation

  19. Upcall Interface

  20. TAPESTRYNODEARCHITECTURE • Component Architecture • Upcall Interface • Toward a Higher Performance Implementation

  21. Toward a Higher Performance Implementation

  22. THANK YOU! Tao WU, wutao@infosec.pku.edu.cn

More Related