QoS-Aware Dependency QoS-Aware Dependency Management for Component Management for Component

Based SystemsBased Systems

Multimedia Operating and Networking System Multimedia Operating and Networking System (MONET) Group(MONET) Group

Yi Cui and Klara NahrstedtYi Cui and Klara Nahrstedt

{yicui, klara}@cs.uiuc.edu{yicui, klara}@cs.uiuc.edu

MotivationMotivation

OutlineOutline

BackgroundBackground Dependency Graph ModelDependency Graph Model MinCostMinCost Algorithm Algorithm Performance StudyPerformance Study SummarySummary

ChallengesChallenges

Customizable SystemsCustomizable Systems– Flexibility, performance improvement, extensibility, Flexibility, performance improvement, extensibility,

etc.etc.– Configuring labor, error-prone, etc.Configuring labor, error-prone, etc.

» A simple group RPC service may have over 200 candidate A simple group RPC service may have over 200 candidate configurations (Matti Hiltunen)configurations (Matti Hiltunen)

Dynamic Heterogeneity of Distributed SystemsDynamic Heterogeneity of Distributed Systems– Ubiquitous Multimedia Service DeliveryUbiquitous Multimedia Service Delivery– Competitive Resource Condition should be Competitive Resource Condition should be

considered in the configuration decisionconsidered in the configuration decision

Our Approach:Our Approach:QoS-Aware Dependency QoS-Aware Dependency

ManagementManagement

Systematic Management vs. Ad hoc Systematic Management vs. Ad hoc ConfigurationConfiguration

Dependency CheckingDependency Checking QoS enforcementQoS enforcement Integration with Resource Integration with Resource

ManagementManagement

Modeling Dependencies in Modeling Dependencies in Graphical RepresentationGraphical Representation

Naming Service

(NS)

Network Observer

(NO)

Location Service

(LS)

Video-on-demand

(VOD)

Network Adaptor

(NA)

Object Request

Broker (ORB)

Voice Mail

(VM)

C5

C1 C2

C3

C6

C4

C7

Related ProblemsRelated Problems

C1 C2

C3

C6

C4 C5

C7

Minimal Cover Problem

C1 C2

C4

C8

C5C6

C9

C3

C7

C10

False Configuration Checking

Multiple Configuration Multiple Configuration ProblemProblem

Naming Service (NS)

TCP Network Adaptor

(TCP_NA)

Video-on-demand (VOD)

TCP based approach

UDP based approach

Badge GPS

Voice Mail (VM)

Badge Location Service

(Badge_LS)

UDP Network Adaptor

(UDP_NA)

TCP Network Observer (TCP_NO)

UDP Network Observer (UDP_NO)

GPS Location Service

(GPS_LS)

Dependency Configuration Dependency Configuration GraphGraph

A1

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2

C2 C3C4 C5 C6

C7 C8 C9 C10

C1

Minimal Cost ConfigurationMinimal Cost Configuration

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A1 = 10 A2 = 12

C2= 7 C3 = 4 C4 = 6 C5 = 4 C6 = 9

C7 = 9 C8 = 1 C9 = 4 C10 = 6

C1 = 6

MinCost Algorithm Retrieve the best Retrieve the best

system configuration system configuration with the minimal with the minimal resource costresource cost

Search through the Search through the Dependency Dependency Configuration GraphConfiguration Graph

Pruning-based Pruning-based ApproachApproach

C7

A1 A2

C1 C2C3 C4 C2 C5 C4 C6

C8 C9 C10

A1 A2

22

minCost =

A1 = 10

C7

A1 A2

A2= 12

C1 C2C3 C4 C2 C5 C4 C6

C8 C9 C10

A1 = 10

C7

A1 A2

A2= 12

C1 C2C3 C4 C2 C5 C4 C6

C8 C9 C10

A1 A2

22

A1A2C1

C2C5

39

minCost =

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2= 12

C2= 7 C5 = 4C1 = 6

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2= 12

C2= 7 C5 = 4C1 = 6

A1 A2

A1A2C1

C2C5

39

22

A1A2C1

C2C5C7

48

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2= 12

C2= 7 C5 = 4C1 = 6

C7 = 9

minCost =minCost = 48

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2= 12

C2= 7 C5 = 4C1 = 6

C7 = 9

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2 = 12

C2= 7 C4 = 6 C6 = 9C1 = 6

A1 A2

A1A2C1

C2C5

A1A2C1

C2C5C7

39

48

22

A1A2C1

C2C4C6

50

minCost = 48

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2 = 12

C2= 7 C4 = 6 C6 = 9C1 = 6

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2 = 12

C3 = 4 C4 = 6 C6 = 9

A1 A2

A1A2C1

C2C5

A1A2C1

C2C4C6

A1A2C1

C2C5C7

39

48

50

A1A2C3

C4C6

41

22

minCost = 48

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2 = 12

C3 = 4 C4 = 6 C6 = 9

A1 A2

A1A2C1

C2C5

A1A2C1

C2C4C6

A1A2C3

C4C6

A1A2C1

C2C5C7

39

48

50 41

22

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2 = 12

C3 = 4 C4 = 6 C6 = 9

C8 = 1

A1A2C3

C4C6C8

42

minCost = 48minCost = 42

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2 = 12

C3 = 4 C4 = 6 C6 = 9

C8 = 1

A1 A2

A1A2C1

C2C5

A1A2C1

C2C4C6

A1A2C3

C4C6

A1A2C1

C2C5C7

39

48

50 41

22

minCost = 42

A1A2C3

C4C6C8

42

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2 = 12

C3 = 4 C4 = 6 C6 = 9

C9 = 4 C10 = 6

A1A2C3C4

C6C9C10

51

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2 = 12

C3 = 4 C4 = 6 C6 = 9

C9 = 4 C10 = 6

A1 A2

A1A2C1

C2C5

A1A2C1

C2C4C6

A1A2C3

C4C6

A1A2C1

C2C5C7

39

48

50 41

22

minCost = 42

A1A2C3

C4C6C8

42

A1A2C3C4

C6C9C10

51

A1 = 10

C1 C2C3 C4 C2 C5 C4 C6

C7 C8

A1 A2

C9 C10

A2 = 12

C3 = 4 C4 = 6C2= 7 C5 = 4

A1A2C3

C4C2C5

43

Complete Searching TreeComplete Searching Tree

A1 A2

A1A2C1C2C5 A1A2C1C2C4C6 A1A2C3C4C2C5A1A2C3C4C6

A1A2C1

C2C5C7

A1A2C1C2

C4C6C7C8

A1A2C1C2C4

C6C7C9C10

A1A2C3C4

C2C5C8

A1A2C3C4

C2C5C9C10

A1A2C3

C4C6C8

A1A2C3C4

C6C9C10

39

48

50 41

42 51

43

22

Associate System Cost with Associate System Cost with Vector RepresentationVector Representation

System cost of components may System cost of components may involve multiple resource typesinvolve multiple resource types

Resource Dependency Vector (RDV)Resource Dependency Vector (RDV)– <CPU, Network, Mem, …><CPU, Network, Mem, …>

RDV preserves the basic properties of RDV preserves the basic properties of single-value-based addition and single-value-based addition and comparisoncomparison

RDV-based AdditionRDV-based Addition

DefinitionDefinition

SymmetricitySymmetricity

AssociativityAssociativity

BM

AM

BABABA rrrrrrRDVRDV ,...,, 2211

ABBA RDVRDVRDVRDV

CBACBA RDVRDVRDVRDVRDVRDV )()(

RDV-based ComparisonRDV-based Comparison DefinitionDefinition

– System Resource CapacitySystem Resource Capacity

SymmetricitySymmetricity

TransitivityTransitivity

BA

M

msysm

Bm

Am

m RDVRDVr

rrw

01

)1(1

M

mmw

sysM

syssyssys rrrRDV ...,, 21

ABBA RDVRDVRDVRDV

BA RDVRDV CB RDVRDV CA RDVRDV and

Performance StudyPerformance Study

Success RateSuccess Rate Configuration OverheadConfiguration Overhead MinCostMinCost algorithm vs. algorithm vs. FixedFixed and and

Random Random approachapproach Simultaneous application requests Simultaneous application requests

under resource competitive conditionunder resource competitive condition

Simulation SetupSimulation SetupC0

C5C6 C7C8

C1

C6C9 C8C10 C15C16 C17C18 C16C19 C18C20C9C17 C5C19

C6

C7

C8

C9

C10

C15

C20

C11

C11

C12 C13 C14

C12 C13 C14

C21 C22 C23 C24

C2 C3 C4

C16

C17

C18

C21 C22 C23 C24

C5

System Capacity = <80% ~ 100%, 0.9 ~ System Capacity = <80% ~ 100%, 0.9 ~ 1.3Mbps>1.3Mbps>

Total Cost of all components = <180%, Total Cost of all components = <180%, 1.98Mbps>1.98Mbps>

Simulation ResultSimulation Result

Success Rate Configuration Overhead

Simulation ResultSimulation Result

Overall Success Rate

Overall Configuration

Overhead

Related WorkRelated Work

Dependency GraphDependency Graph– Database systemDatabase system– Global snapshot of distributed systemGlobal snapshot of distributed system

Configuration ProgrammingConfiguration Programming– Darwin, UNICON, etc.Darwin, UNICON, etc.

Customizable SystemCustomizable System– Reflective MiddlewareReflective Middleware– Cactus ProjectCactus Project

SummarySummary

QoS-Aware Dependency ManagementQoS-Aware Dependency Management Dependency Graph RepresentationDependency Graph Representation Automatic System ConfigurationAutomatic System Configuration Resource Consumption OptimizationResource Consumption Optimization

Thank YouThank You

http://www-monet.cs.uiuc.edu