Sheriff: A Regional Pre-Alert Management Scheme in Data Center - - PowerPoint PPT Presentation

sheriff a regional pre alert management scheme in data
SMART_READER_LITE
LIVE PREVIEW

Sheriff: A Regional Pre-Alert Management Scheme in Data Center - - PowerPoint PPT Presentation

Sheriff: A Regional Pre-Alert Management Scheme in Data Center Networks Xiaofeng Gao, Wen Xu, Fan Wu, Guihai Chen and Ding-Zhu Du Shanghai Jiao Tong University Background Data Center Networks Background Goal of a data center network


slide-1
SLIDE 1

Sheriff: A Regional Pre-Alert Management Scheme in Data Center Networks

Xiaofeng Gao, Wen Xu, Fan Wu, Guihai Chen and Ding-Zhu Du Shanghai Jiao Tong University

slide-2
SLIDE 2

Background Data Center Networks

slide-3
SLIDE 3

Background

  • Goal of a data center network management

system is to be:

– Stable – Effective – Robust

  • Several problems of existing management

schemes:

– Weakness of a centralized controller – Short-sighted mechanism

slide-4
SLIDE 4

Introduction Centralization vs Distribution

  • Drawbacks of Centralization

– Sharply increased response time – Upgraded or heterogeneous components

  • What we need

– Distributed managers – Regional self-automatic control

slide-5
SLIDE 5

Introduction Contingency vs Pre-Control

  • Drawbacks of Contingency

– Working after detecting errors – Harmful to device prevention and system maintenance

  • What we need

– Take early warnings – React in advance to avoid congestions

slide-6
SLIDE 6

Introduction

  • Sheriff

– Distributed (at end host side) – Pre-alert – Regional self-automatic

  • Two phases

– PREDICTION

  • ALERT message

– MANAGEMENT

  • VM migration
slide-7
SLIDE 7

System Design

Two kinds of graphs in a DCN

  • 1. Wired Network Graph
  • 2. Dependency Graph
slide-8
SLIDE 8

Problem Formulation Problems & Solutions

  • Overloaded servers

– Migrate VMs – Reshuffle VMs

  • Congestion

– Check QCN – Modify the rate at end host

slide-9
SLIDE 9

Problem Formulation Pre-alert & Actions

  • Monitored servers by shim

– Information collection – Prediction by ARIMA model and NN model – Report ALERT value once it exceeds THRESHOLD

  • Monitored switches by shim

– Flow congestion detection – Signal congestion flows

slide-10
SLIDE 10

Problem Formulation Pre-alert & Actions

  • Alert from servers or from ToR switches

– VM migration

  • Alert from outer switches

– Flow reroute

  • Implement flow reroute first
  • VM migration

– More expensive – Slower

slide-11
SLIDE 11

Problem Formulation Cost of VM Migration

  • Six steps

– Initialization – Reservation – Iterative copy – Stop&Copy – Commitment – Activation

slide-12
SLIDE 12

Problem Formulation Cost of VM Migration

  • Cost of initialization
  • Cost of transmission

– – Transmission time: – Utilization rate of the bandwidth:

  • Cost of dependency

– – Unit cost per distance: – Physical distance of e:

slide-13
SLIDE 13

Problem Formulation Cost of VM Migration

  • Total cost:
  • Gz:
  • Goal: minimize
slide-14
SLIDE 14

Problem Formulation Pre-alert Mechanism

  • Collecting Necessary Information

– Workload profile – Normalized to [0, 1]

slide-15
SLIDE 15

Problem Formulation Pre-alert Mechanism

  • Time series prediction

– Autoregressive Integrated Moving Average (ARIMA)

  • Modeling linear, dynamic signals

– Nonlinear Autoregressive Neural Network (NARNET)

  • Modeling nonlinear, dynamic and chaotic
  • Dynamic Model Selection

– For each method f – Choose method f which has the minimum value

slide-16
SLIDE 16

Problem Formulation Alert Scheme

  • Seriousness of the condition
  • Collect ALERTs

– VM Migration

slide-17
SLIDE 17

Alert-Migration Algorithm

Simplification of VM Migration Algorithm

  • Cost of migration
  • Simplification

– First step – Second step

  • All pair shortest path problem
  • K-median problem

– Only related with the source and destination of the migration

slide-18
SLIDE 18

Alert-Migration Algorithm Framework

  • Running periodically T time
  • Each round

– Collect alerts – Select a group of candidate VMs (as sources) – VM Migration

  • Not all VMs are migrated

– Parameters as portion for migration

slide-19
SLIDE 19

Alert-Migration Algorithm Select Subroutine

  • Remove delay-sensitive flows
  • Pick up as many VMs with lowest value

– Dynamic Knapsack Algorithm

  • If the priority parameter is one

– Pick VM with highest ALERT value

slide-20
SLIDE 20

Alert-Migration Algorithm Migration

  • Find optimal pairs: K-center problem

– Local Search Algorithm – It has an approximation ratio 3 + 2 / p with time complexity O(n^p)

  • ACKs from the destination’s delegation node

– Enough capacity

  • REJECTs from the destination’s delegation

node

– Recalculate possible migration destinations

slide-21
SLIDE 21

Evaluation Network Trace Training

  • Data from ZopleCloud Corp.
  • Combined model has a smaller minimum

square error.

slide-22
SLIDE 22

Evaluation Simulation For VM Migration

  • Fat-tree & Bcube
  • Workload balancing
slide-23
SLIDE 23

Evaluation Simulation For VM Migration

  • Result & Time Complexity
slide-24
SLIDE 24

Conclusion

  • Sheriff: A fast distributed pre-alert manage-

ment scheme in data center network

– Monitor locally – Predict possible ALERTs – Apply Flow Reroute / VM migration

  • Evaluation

– Accuracy of the prediction – Efficiency of the migration algorithm

slide-25
SLIDE 25
  • Thanks for your attention!