KnBest - A Balanced Request Allocation Method for Distributed Information Systems
Résumé
In large-scale distributed information systems, providers are typically autonomous, i.e. free to leave the system at will or to perform certain requests. In this context, request allocation is critical for the efficient system's operation. However, most methods used in distributed information systems aim at maximizing overall system performance (throughput and response times) by allocating requests to the most efficient providers, without considering providers' autonomy. In this paper, we propose a balanced request allocation method, KnBest, which considers providers' autonomy in addition to load balancing. Our method is general and simple, so that it can be easily incorporated in existing distributed information systems. We describe the implementation of KnBest in different scenarios. Finally, we give an experimental evaluation which shows that KnBest significantly outperforms traditional request allocation methods.
Domaines
Base de données [cs.DB]
Origine : Fichiers produits par l'(les) auteur(s)