Reliability-based optimal allocation of mirror servers for Internet

We consider the optimal mirror allocation problems for the purpose of load balance in network servers. We focus on constructing high-reliability networks, and propose the optimal mirror allocation model such that the system reliability is maximized subject to costs and delays, in view of the trading...

Full description

Saved in:
Bibliographic Details
Published in2000 Globecom Vol. 3; pp. 1571 - 1577 vol.3
Main Authors Nakaniwa, A., Takahashi, J., Ebara, H., Okada, H.
Format Conference Proceeding
LanguageEnglish
Japanese
Published IEEE 07.11.2002
Subjects
Concrete
Cost function
File servers
Internet
Linear programming
Mirrors
Network servers
Network topology
Reliability
Web server
Online AccessGet full text

Cover

More Information
Summary:We consider the optimal mirror allocation problems for the purpose of load balance in network servers. We focus on constructing high-reliability networks, and propose the optimal mirror allocation model such that the system reliability is maximized subject to costs and delays, in view of the trading-off relationship between the reliability and cost. This optimization model is capable of dealing with various kinds of network topology. We formulate this optimization problem as a 0-1 integer programming in this model, and we can find the place where each mirror server should be and the concrete assignment of files to mirror servers. Our objective is to find the optimal mirror allocation by solving this model, and to show the general characteristics about the load balance and the improvement of the system reliability by the distributed mirror allocation, quantitatively.
ISBN:0780364511
9780780364516
DOI:10.1109/GLOCOM.2000.891903