1 / 32

Resources Management and Component Placement

Resources Management and Component Placement. Presenter: Bo Sheng. Outline. SHARP: Secure Resources Peering Motivation Overview Key techniques Evaluation Profile-driven Component Placement. Motivation. Research threads: Federated sharing of distributed resources under coordinated control

opal
Download Presentation

Resources Management and Component Placement

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. Resources Management and Component Placement Presenter: Bo Sheng

  2. Outline • SHARP: Secure Resources Peering • Motivation • Overview • Key techniques • Evaluation • Profile-driven Component Placement

  3. Motivation • Research threads: Federated sharing of distributed resources under coordinated control • Internet service utility • Computational network (PlanetLab, Netbed) • P2P and Grid computing • Location independent service naming

  4. Motivation • Resource Management

  5. Motivation • Flexible Policy-based System • Reserve resources across the system • Admission control • Balance global resources sharing • Robust • Secure

  6. SHARP • SHARP (Secure Highly Available Resource Peering) • Soft-state timed claims • Oversubscribe • Accountable delegation

  7. SHARP-Architecture • Overview • Site/node • Slice • Service manager • Site authority • Local resource scheduler • Agents

  8. SHARP-Architecture • Overview

  9. SHARP-Architecture • Resources Claims • Claim record <holder, resource set, term> • Signed by the issuer • Resources Obtainment • Ticket • Lease • Resources Delegation • Self-describing / Self-certifying

  10. SHARP-Architecture • Probabilistic Claims • Oversubscribe • Accountable • Conflict • Rejection • Reputation service • Degree control

  11. SHARP-Architecture • SHARP Interface • Request<reqID, resourceSet, [claims], [option]> • Claim<reqID, claims> • Grant<reqID, claims> • Reject<reqID, rejectRecord, claims>

  12. SHARP-Architecture • Agents • Site agents • Distribute claims for site resources • Peering policy • User agents • Gather tickets for global resources • Brokers • Community banking • Adaptive provisioning

  13. SHARP-Architecture • Security Architecture • T1:Unauthorized service manager • T2:Replay attack • T3:Unauthorized agent or client • T4:Site contributes faulty resources • T5:Malformed requests or claims • T7:Malicious (A) site authority (B) agent falsely advertises tickets or lease for which resources do not exist. • T8:Malicious site authority falsely rejects tickets.

  14. SHARP-Secure Delegation • Resources Sets • Abstract in a ticket <type, count> • Distribution/redeem • Mapping from abstract to concrete resources • Resource Claims • Globally unique claimID • <claimID, issuer, holder, rset, term, parent> • Signature SHAKi

  15. SHARP-Secure Delegation • Secure Delegation and Tickets

  16. SHARP-Secure Delegation • Secure Delegation and Tickets

  17. SHARP-Secure Delegation • Claim Tree

  18. SHARP-Secure Delegation • Tickets Conflicts and Accountability • A set of claims {c0,…,cn} is conflicting at claim p ∑ci.rset.count > p.rset.count • A set of tickets is conflicting iff their final claims are conflicting for some common ancestor p • Accountable claim

  19. SHARP-Secure Delegation • Tickets Conflicts and Accountability

  20. SHARP-Secure Delegation • Detection Algorithm – linear with chain’s length

  21. SHARP-Secure Delegation • Security Analysis and Discussion • Non-repudiation / Sybil attack • Confinement problem • Clock synchronization / monitoring

  22. SHARP-Resources Availability and Efficiency • Soft/hard reservation • Key techniques • Timed claim • Oversubscribe • Degree • Aggressive advertisement • Latency/overhead of resource discovery • Coordination

  23. Case Study-PanetLab • Resource routing and access via pair-wise relationship

  24. Case Study-PanetLab • Evaluation - oversubscribe

  25. Case Study-PanetLab • Evaluation - oversubscribe

  26. Case Study-PanetLab • Evaluation - oversubscribe

  27. SHARP- Conclusion • Resources management • Secure delegation • Oversubscribe

  28. Component Placement • Challenges • Different resource needs / availability • QoS, e.g. response time • Consider runtime factors • Bursty demand • Failures • System upgrades • Goal: Efficient dynamic component placement in cluster-based online service

  29. Component Placement • Overview • Build per-component resource consumption profiles as a function of input workload characteristics • CPU • Network bandwidth • Memory • Average / peak requirements

  30. Component Placement • Overview • Placement decision • Profiles • Available system resources • Runtime workload • Centralized / distributed / dynamical

  31. Component Placement • Overview

  32. Component Placement • Building component profiles • High throughput component placement • Runtime component migration

More Related