Fairly redistributing failed server load in a distributed system

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

Abstract

We recently proposed a novel method for large-object replication and load balancing. Our method is particularly well-suited to data grids, data warehousing providers, and hosting of dynamic web sites. The method attempts to distribute object request load fairly to servers according to server capacity so that the likelihood of them overloading, and hence failing, is reduced. Unfortunately, server failures cannot be eliminated entirely. When a server fails, the load carried by that server must be absorbed by the rest of the system. Unless this load is distributed fairly across the remaining servers, they may also overload, creating a cascade of failures and reduced quality of service. In this paper, we propose an efficient method for fairly redistributing the load of a failed server or set of failed servers within our replication system. We also report on experimental results that verify the validity of our approach. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Sangam, V., Mayer, C. B., & Candan, K. S. (2003). Fairly redistributing failed server load in a distributed system. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2889, 871–884. https://doi.org/10.1007/978-3-540-39962-9_86

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