A Satisfaction Balanced Query Allocation Process for Distributed Information Systems - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

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.
Fichier principal
Vignette du fichier
main.pdf (694.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00374995 , version 1 (10-04-2009)

Identifiants

  • HAL Id : hal-00374995 , version 1

Citer

Jorge-Arnulfo Quiane-Ruiz, Philippe Lamarre, Sylvie Cazalens, Patrick Valduriez. A Satisfaction Balanced Query Allocation Process for Distributed Information Systems. Base de Données Avancées (BDA), Oct 2007, Marseille, France. ⟨hal-00374995⟩
428 Consultations
47 Téléchargements

Partager

Gmail Facebook X LinkedIn More