Enhancing Availability for Distributed Replicated Services Considering Network Edge Availability
M. Tu. International Journal of Computer Networks & Communications (IJCNC), 11 (1):
1-25(January 2019)
DOI: 10.5121/ijcnc.2019.11101
Abstract
Mechanism to improve data or service availability is critical for an enterprise to ensure the quality of
service in terms of availability. Replication has been used to improve system availability. The number and
location of the replicas are two impact factors on availability. In this paper, we will consider the impact of
the node and network edge failures on the availability of replicated data or services. The Effective
availability modeling approach is designed and efficient availability computing algorithms are developed
to model and compute availability of replicated services for systems with the tree topology. The availability
enhancement problem (maximizing the objective function) is transformed to a p-median problem
(minimizing the objective function) through re-define the availability enhancement problem. An efficient
replica allocation algorithm is developed to improve data availability in tree networks, with a runtime
complexity of O(K|V|2), where K is the number of replicas and |V| is the number of nodes in the tree
network. Finally, experimental studies have been conducted to evaluate how efficient and effective the
proposed availability computing algorithm and the availability enhancement algorithm on improving the
availability of replicated data or services. The results show that the proposed solutions are efficient and
effective on availability computing and availability enhancement.
%0 Journal Article
%1 tuenhancing
%A Tu, Manghui
%D 2019
%E Natarajan, Meghanathan
%J International Journal of Computer Networks & Communications (IJCNC)
%K Network Protocols
%N 1
%P 1-25
%R 10.5121/ijcnc.2019.11101
%T Enhancing Availability for Distributed Replicated Services Considering Network Edge Availability
%U http://airccse.org/journal/ijc2019.html
%V 11
%X Mechanism to improve data or service availability is critical for an enterprise to ensure the quality of
service in terms of availability. Replication has been used to improve system availability. The number and
location of the replicas are two impact factors on availability. In this paper, we will consider the impact of
the node and network edge failures on the availability of replicated data or services. The Effective
availability modeling approach is designed and efficient availability computing algorithms are developed
to model and compute availability of replicated services for systems with the tree topology. The availability
enhancement problem (maximizing the objective function) is transformed to a p-median problem
(minimizing the objective function) through re-define the availability enhancement problem. An efficient
replica allocation algorithm is developed to improve data availability in tree networks, with a runtime
complexity of O(K|V|2), where K is the number of replicas and |V| is the number of nodes in the tree
network. Finally, experimental studies have been conducted to evaluate how efficient and effective the
proposed availability computing algorithm and the availability enhancement algorithm on improving the
availability of replicated data or services. The results show that the proposed solutions are efficient and
effective on availability computing and availability enhancement.
@article{tuenhancing,
abstract = {Mechanism to improve data or service availability is critical for an enterprise to ensure the quality of
service in terms of availability. Replication has been used to improve system availability. The number and
location of the replicas are two impact factors on availability. In this paper, we will consider the impact of
the node and network edge failures on the availability of replicated data or services. The Effective
availability modeling approach is designed and efficient availability computing algorithms are developed
to model and compute availability of replicated services for systems with the tree topology. The availability
enhancement problem (maximizing the objective function) is transformed to a p-median problem
(minimizing the objective function) through re-define the availability enhancement problem. An efficient
replica allocation algorithm is developed to improve data availability in tree networks, with a runtime
complexity of O(K|V|2), where K is the number of replicas and |V| is the number of nodes in the tree
network. Finally, experimental studies have been conducted to evaluate how efficient and effective the
proposed availability computing algorithm and the availability enhancement algorithm on improving the
availability of replicated data or services. The results show that the proposed solutions are efficient and
effective on availability computing and availability enhancement.
},
added-at = {2019-02-11T13:54:17.000+0100},
author = {Tu, Manghui},
biburl = {https://www.bibsonomy.org/bibtex/20c48974ddb3fa01b3830ca5145b54ada/laimbee},
doi = {10.5121/ijcnc.2019.11101},
editor = {Natarajan, Meghanathan},
interhash = {b0a1c077dba3415c5faa57e46966d2ca},
intrahash = {0c48974ddb3fa01b3830ca5145b54ada},
issn = {09749322},
journal = {International Journal of Computer Networks & Communications (IJCNC) },
keywords = {Network Protocols},
language = {English},
month = jan,
number = 1,
pages = {1-25},
timestamp = {2019-02-11T13:54:17.000+0100},
title = {Enhancing Availability for Distributed Replicated Services Considering Network Edge Availability},
url = {http://airccse.org/journal/ijc2019.html},
volume = 11,
year = 2019
}