A Satisfaction Balanced Query Allocation Process for Distributed Information Systems
Résumé
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 CapacityBased query allocation. The experimental results show that SBMediation significantly outperforms CapacityBased when confronted to autonomous participants.
Domaines
Base de données [cs.DB]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...