By Topic

Minimum-Cost Load Balancing Document Distribution in Distributed Web Server Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sone, T. ; Div. of Math., Electron. & Informatics, Saitama Univ. ; Yamada, T.

Motivated by load balancing on servers in DWS (distributed Web server) system, this paper considers the following problem: Given a workload of each Web document, a common workload acceptable to all servers, and a cost required to transfer each document to each server, find a document distribution with a minimum total cost required to be transferred satisfying that the total workload of documents on each server does not exceed an acceptable workload when each document is allowed to be placed on multiple servers. In this paper, we prove that this problem is strongly NP-hard even in the case of a unit cost for transfer. Moreover, we present two algorithms for the problem in this case, an approximation one and a greedy one. In particular, the greedy algorithm can be solved in the case of an enough acceptable workload.

Published in:

Circuits and Systems, 2007. ISCAS 2007. IEEE International Symposium on

Date of Conference:

27-30 May 2007