Cart (Loading....) | Create Account
Close category search window
 

Replicated servers allocation for multiple information sources in a distributed environment

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)
Feng Chen ; Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Kowloon, Hong Kong ; Bo Li

Recently, we have witnessed a phenomenal growth in the Internet/intranet coupled with rapid deployment of new services. Information dissemination over the network has become one of the most important activities in our daily life. The existing systems, however, often suffer from notorious long delay experienced by clients, especially during the peak hour. This is caused by the combination of a variety of factors including inadequate link bandwidth, server overload, and network congestion. Server replication has been shown to be one of the most effective mechanisms to cope with this problem. The basic idea is to replicate the information across a network so that clients' requests can be spread out. The major issue is in which locations inside the network these replications should take place, i.e., where to place the replicated servers. In this paper we investigate the server replication in a controlled distributed environment. The salient feature of this environment is that the decision that where to replicate information can be determined by a single authority, the intranet being the typical example. We consider the problem of placing multiple replicated servers within a network given there exists multiple target Web servers as information providers. We formulate this as an optimization problem by taking into consideration the characteristics of the network topology. We first show that this is a NP-complete problem, and then present a number of heuristics-based algorithms for server replications. Finally, in order to investigate various tradeoffs in terms of cost and algorithm complexity, we carry out comparison studies among different heuristic algorithms

Published in:

Computer Communications and Networks, 1999. Proceedings. Eight International Conference on

Date of Conference:

1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.