Skip to Main content Skip to Navigation
Conference papers

Satisfaction-based Query Load Balancing

Abstract : We consider the query allocation problem in open and large distributed information systems. Provider sources are heterogeneous, au tonomous, 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Jorge-Arnulfo Quiane-Ruiz Connect in order to contact the contributor
Submitted on : Thursday, April 9, 2009 - 11:21:51 PM
Last modification on : Wednesday, April 27, 2022 - 4:23:37 AM
Long-term archiving on: : Thursday, June 10, 2010 - 6:03:21 PM


Files produced by the author(s)


  • HAL Id : inria-00374834, version 1


Jorge-Arnulfo Quiane-Ruiz, Philippe Lamarre, Patrick Valduriez. Satisfaction-based Query Load Balancing. Cooperative Information Systems (CoopIS), Aug 2006, Montpellier, France. ⟨inria-00374834⟩



Record views


Files downloads