Sciweavers

Share
BDA
2007

A Satisfaction Balanced Query Allocation Process for Distributed Information Systems

9 years 11 months ago
A Satisfaction Balanced Query Allocation Process for Distributed Information Systems
We consider a distributed information system that allows autonomous consumers to query autonomous providers. We focus on the problem of query allocation from a new point of view, by considering consumers and providers’ satisfaction in addition to query load. We define satisfaction as a long-run notion based on the consumers and providers’ intentions. Intuitively, a participant should obtain good satisfaction as far as it (the participant) is adequate to the system. We propose and validate a mediation process, called SBMediation, which is compared to Capacity based query allocation. The experimental results show that SBMediation significantly outperforms Capacity based when confronted to autonomous participants. Keywords Autonomous participants, satisfaction, adequation, query allocation, imposition, payment ∗ Work partially funded by ARA “Massive Data” of the French ministry of research (Respire project) and the European Strep Grid4All project. † This author is supported...
Jorge-Arnulfo Quiané-Ruiz, Philippe Lamarre
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where BDA
Authors Jorge-Arnulfo Quiané-Ruiz, Philippe Lamarre, Sylvie Cazalens, Patrick Valduriez
Comments (0)
books