Satisfaction-based query load balancing

Jorge Arnulfo Quiane Ruiz, Philippe Lamarreand, Patrick Valduriez

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We consider the query allocation problem in open and large distributed information systems. Provider sources are heterogeneous, autonomous, and have finite capacity to perform queries. A main objective in query allocation is to obtain good response time. Most of the work towards this objective has dealt with finding the most efficient providers. But little attention has been paid to satisfy the providers interest in performing certain queries. In this paper, we address both sides of the problem. We propose a query allocation approach which allows providers to express their intention to perform queries based on their preference and satisfaction. We compare our approach to both query load balancing and economic approaches. The experimentation results show that our approach yields high efficiency while supporting the providers' preferences in adequacy with the query load. Also, we show that our approach guarantees interesting queries to providers even under low arrival query rates. In the context of open distributed systems, our approach outperforms traditional query load balancing approaches as it encourages providers to stay in the system, thus preserving the full system capacity.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages36-53
Number of pages18
Volume4275 LNCS - I
Publication statusPublished - 15 Dec 2006
Externally publishedYes
EventOTM Confederated International Conferences, CoopIS, DOA, GADA, and ODBASE 2006 - Montpellier, France
Duration: 29 Oct 20063 Nov 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4275 LNCS - I
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherOTM Confederated International Conferences, CoopIS, DOA, GADA, and ODBASE 2006
CountryFrance
CityMontpellier
Period29/10/063/11/06

Fingerprint

Computer Communication Networks
Load Balancing
Resource allocation
Query
Information Systems
Reaction Time
Information systems
Economics
Distributed Systems
Finite Capacity
Open Systems
Experimentation
Response Time
High Efficiency
Express

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Quiane Ruiz, J. A., Lamarreand, P., & Valduriez, P. (2006). Satisfaction-based query load balancing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4275 LNCS - I, pp. 36-53). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4275 LNCS - I).

Satisfaction-based query load balancing. / Quiane Ruiz, Jorge Arnulfo; Lamarreand, Philippe; Valduriez, Patrick.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4275 LNCS - I 2006. p. 36-53 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4275 LNCS - I).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Quiane Ruiz, JA, Lamarreand, P & Valduriez, P 2006, Satisfaction-based query load balancing. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4275 LNCS - I, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4275 LNCS - I, pp. 36-53, OTM Confederated International Conferences, CoopIS, DOA, GADA, and ODBASE 2006, Montpellier, France, 29/10/06.
Quiane Ruiz JA, Lamarreand P, Valduriez P. Satisfaction-based query load balancing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4275 LNCS - I. 2006. p. 36-53. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Quiane Ruiz, Jorge Arnulfo ; Lamarreand, Philippe ; Valduriez, Patrick. / Satisfaction-based query load balancing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4275 LNCS - I 2006. pp. 36-53 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d7128d90f96341b9a67a040af012e94c,
title = "Satisfaction-based query load balancing",
abstract = "We consider the query allocation problem in open and large distributed information systems. Provider sources are heterogeneous, autonomous, and have finite capacity to perform queries. A main objective in query allocation is to obtain good response time. Most of the work towards this objective has dealt with finding the most efficient providers. But little attention has been paid to satisfy the providers interest in performing certain queries. In this paper, we address both sides of the problem. We propose a query allocation approach which allows providers to express their intention to perform queries based on their preference and satisfaction. We compare our approach to both query load balancing and economic approaches. The experimentation results show that our approach yields high efficiency while supporting the providers' preferences in adequacy with the query load. Also, we show that our approach guarantees interesting queries to providers even under low arrival query rates. In the context of open distributed systems, our approach outperforms traditional query load balancing approaches as it encourages providers to stay in the system, thus preserving the full system capacity.",
author = "{Quiane Ruiz}, {Jorge Arnulfo} and Philippe Lamarreand and Patrick Valduriez",
year = "2006",
month = "12",
day = "15",
language = "English",
isbn = "3540482873",
volume = "4275 LNCS - I",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "36--53",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Satisfaction-based query load balancing

AU - Quiane Ruiz, Jorge Arnulfo

AU - Lamarreand, Philippe

AU - Valduriez, Patrick

PY - 2006/12/15

Y1 - 2006/12/15

N2 - We consider the query allocation problem in open and large distributed information systems. Provider sources are heterogeneous, autonomous, and have finite capacity to perform queries. A main objective in query allocation is to obtain good response time. Most of the work towards this objective has dealt with finding the most efficient providers. But little attention has been paid to satisfy the providers interest in performing certain queries. In this paper, we address both sides of the problem. We propose a query allocation approach which allows providers to express their intention to perform queries based on their preference and satisfaction. We compare our approach to both query load balancing and economic approaches. The experimentation results show that our approach yields high efficiency while supporting the providers' preferences in adequacy with the query load. Also, we show that our approach guarantees interesting queries to providers even under low arrival query rates. In the context of open distributed systems, our approach outperforms traditional query load balancing approaches as it encourages providers to stay in the system, thus preserving the full system capacity.

AB - We consider the query allocation problem in open and large distributed information systems. Provider sources are heterogeneous, autonomous, and have finite capacity to perform queries. A main objective in query allocation is to obtain good response time. Most of the work towards this objective has dealt with finding the most efficient providers. But little attention has been paid to satisfy the providers interest in performing certain queries. In this paper, we address both sides of the problem. We propose a query allocation approach which allows providers to express their intention to perform queries based on their preference and satisfaction. We compare our approach to both query load balancing and economic approaches. The experimentation results show that our approach yields high efficiency while supporting the providers' preferences in adequacy with the query load. Also, we show that our approach guarantees interesting queries to providers even under low arrival query rates. In the context of open distributed systems, our approach outperforms traditional query load balancing approaches as it encourages providers to stay in the system, thus preserving the full system capacity.

UR - http://www.scopus.com/inward/record.url?scp=33845450255&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33845450255&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33845450255

SN - 3540482873

SN - 9783540482871

VL - 4275 LNCS - I

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 36

EP - 53

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -