Load Adaptation: Options for Basic Services Vance Maverick ADAPT Bologna Feb. 13, 2003.

Slides:



Advertisements
Similar presentations
DISTRIBUTED MULTIMEDIA SYSTEMS
Advertisements

CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 The 21 st Century Intelligent Network Tony Li, Carl DeSousa.
OGF19 -- NC 1 Service Level Agreements and QoS: what do we measure and why? Omer F. Rana School of Computer Science, Cardiff.
Walter Binder University of Lugano, Switzerland Niranjan Suri IHMC, Florida, USA Green Computing: Energy Consumption Optimized Service Hosting.
Dave Bradley Rick Harper Steve Hunter 4/28/2003 CoolRunnings.
1 SEDA: An Architecture for Well- Conditioned, Scalable Internet Services Matt Welsh, David Culler, and Eric Brewer Computer Science Division University.
A Flexible Model for Resource Management in Virtual Private Networks Presenter: Huang, Rigao Kang, Yuefang.
CLOUD COMPUTING AN OVERVIEW & QUALITY OF SERVICE Hamzeh Khazaei University of Manitoba Department of Computer Science Jan 28, 2010.
1 Content Delivery Networks iBAND2 May 24, 1999 Dave Farber CTO Sandpiper Networks, Inc.
OLD DOG CONSULTING Traffic Engineering or Network Engineering? The transition to dynamic management of multi-layer networks Adrian Farrel Old Dog Consulting.
P2P Network for Very Large Virtual Environment Proceedings of the ACM symposium on virtual reality software and technology VRST '06.
A Grid Resource Broker Supporting Advance Reservations and Benchmark- Based Resource Selection Erik Elmroth and Johan Tordsson Reporter : S.Y.Chen.
OnCall: Defeating Spikes with Dynamic Application Clusters Keith Coleman and James Norris Stanford University June 3, 2003.
Mobile Agents: A Key for Effective Pervasive Computing Roberto Speicys Cardoso & Fabio Kon University of São Paulo - Brazil.
Fair Scheduling in Web Servers CS 213 Lecture 17 L.N. Bhuyan.
CS4514 Networks1 Distributed Dynamic Channel Selection in Chaotic Wireless Networks By: Matthias Ihmig and Peter Steenkiste Presented by: James Cialdea.
Basic Services: Architecture Options Vance Maverick ADAPT Bologna Feb. 13, 2003.
Building Resource-Aware Applications and Systems Michael B. Jones Microsoft Research.
Wide-area cooperative storage with CFS
Diameter Agent Overload IETF 88 - Vancouver 1. Goal Get consensus from the working group that Agent overload needs to be addressed If so, get guidance.
N-Tier Architecture.
Authorization architecture sketches draft-selander-core-access-control-02 draft-gerdes-core-dcaf-authorize-02 draft-seitz-ace-design-considerations-00.
SEDA: An Architecture for Well-Conditioned, Scalable Internet Services
Draft-campbell-dime-load- considerations-01 IETF 92 DIME Working Group Meeting Dallas, Texas.
COLLABORATIVE SPECTRUM MANAGEMENT FOR RELIABILITY AND SCALABILITY Heather Zheng Dept. of Computer Science University of California, Santa Barbara.
Multi-Layer Perceptrons Michael J. Watts
CONGESTION CONTROL and RESOURCE ALLOCATION. Definition Resource Allocation : Process by which network elements try to meet the competing demands that.
13-1. McGraw-Hill/Irwin Copyright © 2005 by The McGraw-Hill Companies, Inc. All rights reserved. 13 Channel Management.
1 [3] Jorge Martinez-Bauset, David Garcia-Roger, M a Jose Domenech- Benlloch and Vicent Pla, “ Maximizing the capacity of mobile cellular networks with.
Orbited Scaling Bi-directional web applications A presentation by Michael Carter
Bandwidth Reallocation for Bandwidth Asymmetry Wireless Networks Based on Distributed Multiservice Admission Control Robert Schafrik Lakshman Krishnamurthy.
Aligning Institutions with Technologies Critical transactions in infrastructures John Groenewegen Rolf Künneke Claude Menard.
MP 2: Audio/ Video Streaming
Title : CPU Broker (DSRT Extension) Kihun Kim University of Illinois at Urbana-Champaign.
Reduced Cost for Using The most important justification for the companies who resorts to outsourcing is petty expenses for searching. More of that companies.
1 ACTIVE FAULT TOLERANT SYSTEM for OPEN DISTRIBUTED COMPUTING (Autonomic and Trusted Computing 2006) Giray Kömürcü.
1 Integrating security in a quality aware multimedia delivery platform Paul Koster 21 november 2001.
A Method for Transparent Admission Control and Request Scheduling in E-Commerce Web Sites S. Elnikety, E. Nahum, J. Tracey and W. Zwaenpoel Presented By.
CS Spring 2014 CS 414 – Multimedia Systems Design Lecture 18 – Multimedia Transport (Part 1) Klara Nahrstedt Spring 2014.
K-Anycast Routing Schemes for Mobile Ad Hoc Networks 指導老師 : 黃鈴玲 教授 學生 : 李京釜.
11 CLUSTERING AND AVAILABILITY Chapter 11. Chapter 11: CLUSTERING AND AVAILABILITY2 OVERVIEW  Describe the clustering capabilities of Microsoft Windows.
CHUL LEE, CORE Lab. E.E. 1 Web Server QoS Management by Adaptive Content Delivery September Chul Lee Tarek F. Abdelzaher and Nina Bhatti Quality.
1 Part VII Component-level Performance Models for the Web © 1998 Menascé & Almeida. All Rights Reserved.
CMSC Presentation An End-to-End Approach to Host Mobility An End-to-End Approach to Host Mobility Alex C. Snoeren and Hari Balakrishnan Alex C. Snoeren.
1 Hidra: History Based Dynamic Resource Allocation For Server Clusters Jayanth Gummaraju 1 and Yoshio Turner 2 1 Stanford University, CA, USA 2 Hewlett-Packard.
1 University of Maryland Runtime Program Evolution Jeff Hollingsworth © Copyright 2000, Jeffrey K. Hollingsworth, All Rights Reserved. University of Maryland.
Lecture Network layer -- May Congestion control Algorithms.
DOC Use Case Analysis Client to server use cases 1.
By Chris Zachor CS 650.  Introduction  SSH Overview  Scenarios  How To:  Results  Conclusion.
/ Fast Web Content Delivery An Introduction to Related Techniques by Paper Survey B Li, Chien-chang R Sung, Chih-kuei.
Spark on Entropy : A Reliable & Efficient Scheduler for Low-latency Parallel Jobs in Heterogeneous Cloud Huankai Chen PhD Student at University of Kent.
PERFORMANCE MANAGEMENT IMPROVING PERFORMANCE TECHNIQUES Network management system 1.
Dynamic Resource Allocation for Shared Data Centers Using Online Measurements By- Abhishek Chandra, Weibo Gong and Prashant Shenoy.
Introduction to Mobile-Cloud Computing. What is Mobile Cloud Computing? an infrastructure where both the data storage and processing happen outside of.
Anshul Gandhi 347, CS building
Threads vs. Events SEDA – An Event Model 5204 – Operating Systems.
N-Tier Architecture.
Regulating Data Flow in J2EE Application Server
Load Management in Distributed Video Servers
Replication and Availability in Distributed systems
Determining the Peer Resource Contributions in a P2P Contract
File service architecture
AGENT OS.
Edge computing (1) Content Distribution Networks
DotSlash: An Automated Web Hotspot Rescue System
Dissemination of Dynamic Data on the Internet
Edge Recorder Client
Chapter 5 Architectural Design.
Performance-Robust Parallel I/O
Network management system
Presentation transcript:

Load Adaptation: Options for Basic Services Vance Maverick ADAPT Bologna Feb. 13, 2003

Problem statement Client and service are separated Client does not have exclusive access to service Service performance varies unpredictably depending on load How can the system adapt? –Specifically, how can a CS adapt to variations in load on a service it uses?

Overview Goal: discussion between WP1 and other groups Review options in architecture draft –Load reporting –Dynamic adjustment of support level –Capacity reservation Conclusion and open questions

Load reporting Service tells client how busy it is –Information may be cached in an intermediate node Scenarios –Client chooses between competing services –Client predicts its own computation time Goals of the two parties –Client wants to know how fast its request will be served –Service wants to protect its current clients from overload

How to represent load? Percentage load (artificial, unhelpful) Client counts –Number currently connected –Estimated number of further clients that can be handled without degradation Average recent response times –Affected by complexity of computation, network between client and server –May not be available if service just came up

Dynamic support adjustment After connection, client may request “more support” from service –Representation? Not explicit number of replicas Does not provide any guarantee to client or service May lead to waste –Client of slow service will demand more replicas, even if it doesn’t help Realistic?

Capacity reservation QoS contract between client and service If service is overloaded, then service can’t begin Advantages to both parties –Client receives guarantee of performance –Service can protect its other clients Clear relationship to billing (i.e. institutional contracts) Can be extended to dynamic negotiation

How to represent capacity? Explicit number of allocated replicas –requires client to understand system arch Multiples of fictitious reference system (“horsepower”) –simplistic: relationship between two systems not linear Requests per second –ignores computation complexity Trust

Conclusion First two options not very useful –Load reporting alone –Dynamic adjustment of service level Capacity reservation –QoS representation is an open question –Is this in the scope of ADAPT?