1 / 5

Dynamic Resource Allocation in Overlay Utility Computing Systems

OPUS is an overlay utility service that dynamically allocates resources based on changing application and network characteristics, SLAs, and topology-based requirements. It addresses peering, application demand, and SLA specification for competing applications. The system aims to optimize performance and cost trade-offs, compete with service and application overlays, scale to 10,000 nodes, and employ ModelNet for network emulation. Open questions include introducing noise, scalability, and accuracy issues, targeting a 10-node core and 100 edge nodes setup.

valdivia
Download Presentation

Dynamic Resource Allocation in Overlay Utility Computing Systems

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. Utility Computing Amin Vahdat Internet Systems and Storage Group http://issg.cs.duke.edu vahdat@cs.duke.edu

  2. OPUS: An Overlay Utility Service • Dynamically allocate resources to competing services • Based on changing application and network characteristics, SLAs • Create topology based app requirements • Bandiwdth, latency, loss rate, cost ($) sensitivity Peering Overlay node App demand

  3. Current Questions • What are the proper SLA’s for specifying utility for competing applications • Allocate resources among competing applications based on changing network/application conditions • Overlays that dynamically trade “performance” for “cost” • Two-metric network optimization (NP-complete with centralized information) • Scale to 10,000 nodes • Service overlays versus application overlays

  4. ModelNet • Step 1: specify target wide-area topology • Graph with edges augmented to include BW, latency, loss rates, etc. • Step 2: map topology to router core • Graph partitioning • Accuracy? Congestion? • Step 3: run real code on edge nodes • Subjected to specified network char’s EdgeNodes 100MbSwitch RouterCore GbSwitch

  5. Open Questions and Status • How to introduce noise into emulation environment? • Scalability versus accuracy • How far can system scale? • Target: 10 node core (gigabit interconnect), 100 edge nodes • Current status • Reproduced CFS results from SOSP 2001 paper • Using RON network connectivity information • Figures 6, 7, 8 • 4000-node gnutella network

More Related