CSE598C Project: Dynamic virtual server placement Yoojin Hong.

Slides:



Advertisements
Similar presentations
Operating systems for mobile computing : Recent Trends and Future Directions Sudhindra Rao.
Advertisements

Test test Please press the F5 key to begin. (Then, press the Page Up or Page Down keys to move through the following 3 slides.)
The vMatrix: A Network Of Virtual Machine Monitors For Dynamic Content Distribution Amr A. Awadallah Mendel Rosenblum Stanford.
Data Set used. K Means K Means Clusters 1.K Means begins with a user specified amount of clusters 2.Randomly places the K centroids on the data set 3.Finds.
B. Ramamurthy 4/17/ Overview of EC2 Components (fig. 2.1) 10..* /17/20152.
Consistency and Replication Chapter 7 Part II Replica Management & Consistency Protocols.
Power Aware Virtual Machine Placement Yefu Wang. 2 ECE Introduction Data centers are underutilized – Prepared for extreme workloads – Commonly.
Technical Architectures
Adaptive Content Delivery for Scalable Web Servers Authors: Rahul Pradhan and Mark Claypool Presented by: David Finkel Computer Science Department Worcester.
K-means Clustering. What is clustering? Why would we want to cluster? How would you determine clusters? How can you do this efficiently?
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
AKAMAI Content Delivery Services AKAMAI Content Delivery Services CIS726 : PRESENTATION Avinash Ponugoti Avinash Ponugoti Nagarjuna Nagulapati Sathish.
DATABASE MANAGEMENT SYSTEMS 2 ANGELITO I. CUNANAN JR.
Algorithms for Self-Organization and Adaptive Service Placement in Dynamic Distributed Systems Artur Andrzejak, Sven Graupner,Vadim Kotov, Holger Trinks.
Static VS Dynamic websites. 1-What are the advantages and disadvantages? 2- Which one should you choose and why?
Name Title Microsoft Windows Azure: Migrating Web Applications.
Health and CS Philip Chan. DNA, Genes, Proteins What is the relationship among DNA Genes Proteins ?
For more notes and topics visit:
Yury Kissin Infrastructure Consultant Storage improvements Dynamic Memory Hyper-V Replica VM Mobility New and Improved Networking Capabilities.
Paper on Best implemented scientific concept for E-Governance projects Virtual Machine By Nitin V. Choudhari, DIO,NIC,Akola.
Dynamic and Decentralized Approaches for Optimal Allocation of Multiple Resources in Virtualized Data Centers Wei Chen, Samuel Hargrove, Heh Miao, Liang.
Design and Implement an Efficient Web Application Server Presented by Tai-Lin Han Date: 11/28/2000.
Topology Design for Service Overlay Networks with Bandwidth Guarantees Sibelius Vieira* Jorg Liebeherr** *Department of Computer Science Catholic University.
A Cloud is a type of parallel and distributed system consisting of a collection of inter- connected and virtualized computers that are dynamically provisioned.
INSTALLING MICROSOFT EXCHANGE SERVER 2003 CLUSTERS AND FRONT-END AND BACK ‑ END SERVERS Chapter 4.
UI and Data Entry UI and Data Entry Front-End Business Logic Mid-Tier Data Store Back-End.
Network Aware Resource Allocation in Distributed Clouds.
Politecnico di Torino Dipartimento di Automatica ed Informatica TORSEC Group Performance of Xen’s Secured Virtual Networks Emanuele Cesena Paolo Carlo.
COMS E Cloud Computing and Data Center Networking Sambit Sahu
From Virtualization Management to Private Cloud with SCVMM 2012 Dan Stolts Sr. IT Pro Evangelist Microsoft Corporation
Xen (Virtual Machine Monitor) Operating systems laboratory Esmail asyabi- April 2015.
ONLINE GAME NETWORK TRAFFIC OPTIMIZATION Jaewoo kim Youngho yi Minsik cho.
11 Copyright © 2009 Juniper Networks, Inc. ANDY INGRAM VP FST PRODUCT MARKETING & BUSINESS DEVELOPMENT.
200 pt 300 pt 400 pt 500 pt 100 pt 200 pt 300 pt 400 pt 500 pt 100 pt 200pt 300 pt 400 pt 500 pt 100 pt 200 pt 300 pt 400 pt 500 pt 100 pt 200 pt 300 pt.
Remote Controller & Presenter Make education more efficiently
Server Performance, Scaling, Reliability and Configuration Norman White.
CS 347Notes101 CS 347 Parallel and Distributed Data Processing Distributed Information Retrieval Hector Garcia-Molina Zoltan Gyongyi.
Clustering Unsupervised learning introduction Machine Learning.
Machine Learning Queens College Lecture 7: Clustering.
Full and Para Virtualization
20409A 7: Installing and Configuring System Center 2012 R2 Virtual Machine Manager Module 7 Installing and Configuring System Center 2012 R2 Virtual.
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.
File Transfer And Access (FTP, TFTP, NFS). Remote File Access, Transfer and Storage Networks For different goals variety of approaches to remote file.
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.
ECE 692 Power-Aware Computer Systems Final Review Prof. Xiaorui Wang.
Management of Broadband Media Assets on Wide Area Networks Lars-Olof Burchard.
The vMatrix: Teleporting Servers via Virtual Machine Monitors (work in progress – LISA’02) Amr A. Awadallah Mendel Rosenblum
Client-Server Movie Service Charles Snyder. Concept  Media recommendation service  Movie database  Categorized by genre relevance  Users have some.
NFV Group Report --Network Functions Virtualization LIU XU →
Chen Qian, Xin Li University of Kentucky
Unit 3 Virtualization.
Cloud-Assisted VR.
VIRTUAL SERVERS Presented By: Ravi Joshi IV Year (IT)
VceTests VCE Test Dumps
Cloud-Assisted VR.
LECTURE 34: WEB PROGRAMMING FOR SCALE
Adaptive Cloud Computing Based Services for Mobile Users
NTC 324 RANK Perfect Education/ ntc324rank.com.
Managing Online Services
20409A 7: Installing and Configuring System Center 2012 R2 Virtual Machine Manager Module 7 Installing and Configuring System Center 2012 R2 Virtual.
LECTURE 32: WEB PROGRAMMING FOR SCALE
LECTURE 33: WEB PROGRAMMING FOR SCALE
KMeans Clustering on Hadoop Fall 2013 Elke A. Rundensteiner
Distributed Systems CS
Specialized Cloud Architectures
LECTURE 33: WEB PROGRAMMING FOR SCALE
Microsoft Virtual Academy
06 | SQL Server and the Cloud
Presentation transcript:

CSE598C Project: Dynamic virtual server placement Yoojin Hong

Mobile VM servers (From the vMatrix) Static mirroring vs. Mobile virtual machine servers

Mobile VM servers Basic ideas  VM servers can be hosted in any real machines across networks  VM servers can be instantiated on demand  VM servers can move closer to end users Advantages of mobile virtual machine servers  Higher availability  Better response time  Absorbing flash crowds  Network bandwidth savings  Lower cost of ownership of server machines

Mobile VM servers Two-tier architectures

Mobile VM servers Disadvantages of mobile virtual machine servers  Difficulty to virtualize large size of database server Closer front-end VM server is beneficial only when # of packets via connection A is larger than that via connection B  Overhead of migrating OS and applications for VM servers FRONT END BACK END Connection AConnection B

Scenarios The service is provided mainly by compute- intensive application server Locations of majority of end users are changing  Suppose users of CNN.com has an access pattern to visit the site around 4-5p.m.  Time difference between east coast and west coast

Problem description Dynamic provisioning + Placement of web server replicas Problems  Determine when a new VM server needs to be added (When) Change of locations of end users  Select a real machine, which is located in an optimal location from end users, to host the new VM server (How) Location of real machines available Location of end users Location of back-end server relative to real machines Size of VM files relative to size of server requests Cost of bandwidth during different times of day Location of real machines to host VM servers currently

Algorithms When  When locations of end users are changing # of users located where current server cannot guarantee a certain response time is increasing

Algorithms How – Modified k-mean algorithm  1. Find k number of centroids at random  2. Assign each end user location to its closest centroid  3. Update the centroids as follows: : # of end user locations assigned to cluster j : location of end user j : application-specific constant weight ( 0) B : location of back-end server  4. Repeat 2, 3 steps until the centroids are converged  5. Select RMs located closest to the centroids

Experiments Simulation Comparison …