SQLB: A Query Allocation Framework for Autonomous Consumers and - - PowerPoint PPT Presentation

sqlb a query allocation framework for autonomous
SMART_READER_LITE
LIVE PREVIEW

SQLB: A Query Allocation Framework for Autonomous Consumers and - - PowerPoint PPT Presentation

1 SQLB: A Query Allocation Framework for Autonomous Consumers and Providers Jorge-Arnulfo Quian-Ruiz, Philippe Lamarre, and Patrick Valduriez Atlas group, INRIA and LINA Universit de Nantes VLDB Conference September 27, 2007 2


slide-1
SLIDE 1

1

SQLB: A Query Allocation Framework for Autonomous Consumers and Providers

September 27, 2007

Jorge-Arnulfo Quiané-Ruiz, Philippe Lamarre, and Patrick Valduriez Atlas group, INRIA and LINA – Université de Nantes

VLDB Conference

slide-2
SLIDE 2

2

5 4 3 2 1

Roadmap

Motivation and Problem Definition Satisfaction Model SQLB Framework Validation Conclusion

ATLAS

slide-3
SLIDE 3

3

Context

Large-scale Distributed Information Systems (DIS) Autonomous participants (consumers and providers) May join and leave the system at will Have interests towards providers and queries Focus on Query Allocation

ATLAS

slide-4
SLIDE 4

4

Query Allocation

Query load balancing (QLB) : maximize overall system performance (throughput and response time) System user

query

load load load

allocate query results results

p1 p2 p3

ATLAS

slide-5
SLIDE 5

5

query results

Problem Overview

System user

load load load

allocate query results

However, participants may have certain expectations (intentions) that are not only performance-related

I would want results from p3 but wouldn’t want those of p1 p1 p2 p3 I would want to perform this query It doesn’t matter if I perform or not this query I wouldn’t want to perform this query

If several times It is crucial to satisfy participants!

ATLAS

slide-6
SLIDE 6

6

Problem Statement

Assumptions: Large-scale and heterogeneous DIS Autonomous participants Queries must be treated whenever possible Let: q = < c, d, n > be an incoming query Pq be the set of providers that are able to deal with q Problem: Allocate each q to a set Pq such that good response time and participants’ satisfaction are ensured

ATLAS

slide-7
SLIDE 7

7

Challenge

Query allocation is hard because: Query demand should be satisfied Participants should be satisfied to some (which?) extent Participants’ expectations may be contradictory

ATLAS

slide-8
SLIDE 8

8

Our Contributions

A model to characterize the participants’ expectations in the long-run SQLB Model A framework to allocate queries based on the participants’ satisfaction SQLB Framework

ATLAS

slide-9
SLIDE 9

9

5 4 3 2 1

Roadmap

Motivation and Problem Definition Satisfaction Model SQLB Framework Validation Conclusion

ATLAS

slide-10
SLIDE 10

10

Satisfaction Model

Captures how well the system meets the participants’ expectations, Three notions: Adequation Satisfaction Allocation Satisfaction They are based on the k last participants’ interactions with the system

ATLAS

slide-11
SLIDE 11

11

Participant Characterization (1/3)

Adequation: enables a participant to know whether it can reach its objectives System

I want to buy CDs and DVDs I want to buy a desktop computer user I want to buy a laser printer

The Math

The k last proposed queries by the system to p p’s desire to perform query q user user Not adequate! A provider of computer add-ons

ATLAS

I am a specialist in network devices

slide-12
SLIDE 12

12

Participant Characterization (2/3)

Satisfaction: enables a participant to know whether it is fulfilling its objectives System

A provider of computer add-ons I am a specialist in network devices request for some speakers request for some monitors request for some webcams request for some sound cards

The Math

The queries that p performed among the k last queries the system proposed to it ( ) p’s desire to perform query q Not satisfied!

ATLAS

slide-13
SLIDE 13

13

Participant Characterization (3/3)

System Satisfied because of the query allocation method! Allocation Satisfaction: enables a participant to know the reason of its dissatisfaction or satisfaction

Request for a PCI network card

ATLAS

However, I prefer to sell network devices I sell all kind of computer add-ons user user user I want to buy a webcam I want to buy a laser printer I want to buy a PCI network card

The Math

p’s satisfaction p’s adequation

slide-14
SLIDE 14

14

5 4 3 2 1

Roadmap

Motivation and Problem Definition Satisfaction Model SQLB Framework Validation Conclusion

ATLAS

slide-15
SLIDE 15

15

Query Allocation Objectives

Give interesting sources to consumers and interesting queries to providers To do so, participants are required to express their intentions Be self-adaptable to the participants’ expectations Guarantee good system performance

ATLAS

slide-16
SLIDE 16

16

Consumer Side: Intention

The Math Defines the consumer’s desire to see a given provider performing its query Is the result of merging consumer’s preferences with the provider’s reputation

Intention of a consumer c to allocate its query q to a provider p c’s preference to allocate q to p p’s reputation Balance in accordance to c’s past experiences with p Prevents the intention from taking zero values

ATLAS

slide-17
SLIDE 17

17

Provider Side: Intention

The Math

Intention of a provider p to perform a query q p’s preference to perform q p’s utilization Balance in accordance to p’s satisfaction It prevents the intention from taking zero values

Defines the provider’s desire to perform a given query Is the result of merging provider’s preferences with the provider’s utilization

ATLAS

slide-18
SLIDE 18

18

ATLAS

Mediator Side: Providers’ Score

The Math

Score of a provider p given a query q p’s intention to perform q Balance in accordance to q.c’s and p’s satisfaction It prevents the score from taking zero values q.c’s intention to allocate q to p

Defines the provider’s importance to be allocated a given query Is the result of merging the consumer’s and provider’s intention

slide-19
SLIDE 19

19

Mediator Side: Query Allocation

where is the best scored provider and is the worst we compute Consumer’s and providers’ intention w.r.t. q if p gets the query

  • therwise

ATLAS

input

slide-20
SLIDE 20

20

5 4 3 2 1

Roadmap

Motivation and Problem Definition Satisfaction Model SQLB Framework Validation Conclusion

ATLAS

slide-21
SLIDE 21

21

Validation

Objectives Tested methods Capacity based (QLB approach) Mariposa-like (economic approach) SQLB (our proposal) Evaluate if participants are satisfied with the query allocation process Evaluate the impact on performance of the participants’ departure

ATLAS

slide-22
SLIDE 22

22

200 k size for consumers 500 k size for providers Poisson Query distribution 1 Number of mediators 400 Number of providers 200 Number of consumers Value Parameter

Setup

ATLAS

We implemented our algorithms in Java and used SimJava to simulate the network communication

slide-23
SLIDE 23

23

Satisfaction Results

Providers’ allocation satisfaction Consumers’ allocation satisfaction SQLB has the same performance than Mariposa-like while Capacity based penalizes providers Consumers are satisfied only with the SQLB approach

ATLAS

slide-24
SLIDE 24

24

Performance Results (1/2)

Captive participants: they are not allowed to leave the system Even if not designed for captive environments, SQLB ensures quite good response times

ATLAS

slide-25
SLIDE 25

25

Dissatisfaction: if p does not perform at least 25% of queries than it expects if p performs a 220% more of queries than it expects if p’s satisfaction < p’s adequation - 0.15 Starvation: Overutilization:

Performance Results (2/2)

ATLAS

Autonomous providers: they may leave the system at will SQLB significantly outperforms Capacity based and Mariposa-like by a factor of 2 in average

slide-26
SLIDE 26

26

5 4 3 2 1

Roadmap

Motivation and Problem Definition Satisfaction Model SQLB Framework Validation Conclusion

ATLAS

slide-27
SLIDE 27

27

Summary

SQLB Model Characterizes the participants’ expectations Allows to design and evaluate query allocation methods for autonomous environments SQLB framework Allows trading consumers’ intentions for providers’ intentions in accordance to their satisfaction Avoids query starvation

ATLAS

Develop an economical version of our approach Consider super-peer and unstructured P2P systems Future work

slide-28
SLIDE 28

28

Danke!

Questions ?

Work partially funded by ARA « Massive Data » of the French ministry of research (Respire project) and the European Strep Grid4All project.

ATLAS