Knbest - A balanced request allocation method for distributed information systems

Jorge Arnulfo Quiane Ruiz, Philippe Lamarre, Patrick Valduriez

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages237-248
Number of pages12
Volume4443 LNCS
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event12th International Conference on Database Systems for Advanced Applications, DASFAA 2007 - Bangkok, Thailand
Duration: 9 Apr 200712 Apr 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4443 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other12th International Conference on Database Systems for Advanced Applications, DASFAA 2007
CountryThailand
CityBangkok
Period9/4/0712/4/07

Fingerprint

Computer Communication Networks
Information Systems
Distributed Systems
Information systems
Resource allocation
Load Balancing
Experimental Evaluation
Throughput
Response Time
Reaction Time
System Performance
Scenarios
Autonomy

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Quiane Ruiz, J. A., Lamarre, P., & Valduriez, P. (2007). Knbest - A balanced request allocation method for distributed information systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4443 LNCS, pp. 237-248). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4443 LNCS).

Knbest - A balanced request allocation method for distributed information systems. / Quiane Ruiz, Jorge Arnulfo; Lamarre, Philippe; Valduriez, Patrick.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4443 LNCS 2007. p. 237-248 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4443 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Quiane Ruiz, JA, Lamarre, P & Valduriez, P 2007, Knbest - A balanced request allocation method for distributed information systems. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4443 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4443 LNCS, pp. 237-248, 12th International Conference on Database Systems for Advanced Applications, DASFAA 2007, Bangkok, Thailand, 9/4/07.
Quiane Ruiz JA, Lamarre P, Valduriez P. Knbest - A balanced request allocation method for distributed information systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4443 LNCS. 2007. p. 237-248. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Quiane Ruiz, Jorge Arnulfo ; Lamarre, Philippe ; Valduriez, Patrick. / Knbest - A balanced request allocation method for distributed information systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4443 LNCS 2007. pp. 237-248 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bd76dbc014ca4fcebbb5da808b2ecc60,
title = "Knbest - A balanced request allocation method for distributed information systems",
abstract = "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.",
author = "{Quiane Ruiz}, {Jorge Arnulfo} and Philippe Lamarre and Patrick Valduriez",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9783540717027",
volume = "4443 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "237--248",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Knbest - A balanced request allocation method for distributed information systems

AU - Quiane Ruiz, Jorge Arnulfo

AU - Lamarre, Philippe

AU - Valduriez, Patrick

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38049175010&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38049175010&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540717027

VL - 4443 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 237

EP - 248

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -