Title :
Maximizing the Availability of Replicated Services in Widely Distributed Systems Considering Network Availability
Author :
Manghui Tu ; Liangliang Xiao ; Dianxiang Xu
Author_Institution :
Dept. of CITG, Purdue Univ. Calumet, Hammond, IN, USA
Abstract :
Availability is an important issue in distributed environments that promise to provide quality of services and thus the mechanisms to improve data or service availability is critical to ensure such quality of service. Replication schemes have been widely used to improve data or service availability. In addition to the number of replicas, the location of the replicas also impacts the data availability. In this paper, we consider the impact of node and network link failures on the availability of replicated data and services. Efficient replica allocation algorithms with runtime of O(K|V|2) are developed to improve data availability, where K is the predetermined number of replica and |V| is the number of nodes in the system. Experimental studies have been conducted to evaluate how effective the proposed replica allocation algorithms on improving the availability of replicated data or services. The results show that the two proposed solutions are effective on enhancing system availability, especially when the number of replicas is small.
Keywords :
distributed processing; graph theory; quality of service; data availability; distributed environment; distributed system; general graph; network availability; network link failure; node failure; quality of service; replica allocation algorithm; replicated service availability; replication scheme; Algorithm design and analysis; Availability; Data models; Distributed databases; Resource management; TV; Tree graphs; availability; distributed systems; enhancement; network availability; replica allocation;
Conference_Titel :
Software Security and Reliability (SERE), 2013 IEEE 7th International Conference on
Conference_Location :
Gaithersburg, MD
Print_ISBN :
978-1-4799-0406-8
DOI :
10.1109/SERE.2013.9