In this paper, we consider optimal mirror allocation problems for the purpose of load balancing 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 trade-off between the reliability and cost. This optimization model is capable of dealing with various kinds of network topologies, although for simplicity, we assume the read-only situation. We formulate this optimization problem into a 0-1 integer programming model, and we use an approximate method for numerical analysis in order to analyze more large-scale systems. Our objective is to find the optimal mirror allocation by solving this model, and to show quantitatively the general characteristics of the load balancing and the improvement of the system reliability by the distributed mirror allocation.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Akiko NAKANIWA, Jun TAKAHASHI, Hiroyuki EBARA, Hiromi OKADA, "Reliability-Based Mirroring of Servers in Distributed Networks" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 2, pp. 540-549, February 2002, doi: .
Abstract: In this paper, we consider optimal mirror allocation problems for the purpose of load balancing 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 trade-off between the reliability and cost. This optimization model is capable of dealing with various kinds of network topologies, although for simplicity, we assume the read-only situation. We formulate this optimization problem into a 0-1 integer programming model, and we use an approximate method for numerical analysis in order to analyze more large-scale systems. Our objective is to find the optimal mirror allocation by solving this model, and to show quantitatively the general characteristics of the load balancing and the improvement of the system reliability by the distributed mirror allocation.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_2_540/_p
Copy
@ARTICLE{e85-b_2_540,
author={Akiko NAKANIWA, Jun TAKAHASHI, Hiroyuki EBARA, Hiromi OKADA, },
journal={IEICE TRANSACTIONS on Communications},
title={Reliability-Based Mirroring of Servers in Distributed Networks},
year={2002},
volume={E85-B},
number={2},
pages={540-549},
abstract={In this paper, we consider optimal mirror allocation problems for the purpose of load balancing 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 trade-off between the reliability and cost. This optimization model is capable of dealing with various kinds of network topologies, although for simplicity, we assume the read-only situation. We formulate this optimization problem into a 0-1 integer programming model, and we use an approximate method for numerical analysis in order to analyze more large-scale systems. Our objective is to find the optimal mirror allocation by solving this model, and to show quantitatively the general characteristics of the load balancing and the improvement of the system reliability by the distributed mirror allocation.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Reliability-Based Mirroring of Servers in Distributed Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 540
EP - 549
AU - Akiko NAKANIWA
AU - Jun TAKAHASHI
AU - Hiroyuki EBARA
AU - Hiromi OKADA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2002
AB - In this paper, we consider optimal mirror allocation problems for the purpose of load balancing 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 trade-off between the reliability and cost. This optimization model is capable of dealing with various kinds of network topologies, although for simplicity, we assume the read-only situation. We formulate this optimization problem into a 0-1 integer programming model, and we use an approximate method for numerical analysis in order to analyze more large-scale systems. Our objective is to find the optimal mirror allocation by solving this model, and to show quantitatively the general characteristics of the load balancing and the improvement of the system reliability by the distributed mirror allocation.
ER -