Server-based dynamic server selection algorithms

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Server selection is an important problem in replicated server systems distributed over the Internet. In this paper, we study two server selection algorithms under a server-based framework we have developed. These algorithms utilize server load and network performance information collected through a shared passive measurement mechanism to determine the appropriate server for processing a client request. The performance of these algorithms is studied using simulations. Comparison with two naive server selection algorithms is also made. The initial simulation results show that our dynamic server selection algorithms have superior performance over the two naive ones, and as a result, demonstrate the importance of dynamic server selection mechanisms in a replicated server system.

Cite

CITATION STYLE

APA

Dong, Y., Zhang, Z. L., & Thomas Hou, Y. (2002). Server-based dynamic server selection algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2344, pp. 575–584). Springer Verlag. https://doi.org/10.1007/3-540-45801-8_55

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free