TY - GEN
T1 - Optimal placements in ring network for data replicas in distributed database with majority voting protocol
AU - Zhang, Zhao
AU - Wu, Weili
AU - Shekhar, Shashi
PY - 2008
Y1 - 2008
N2 - In a distributed database system, data replicas are placed at different locations to achieve high data availability in the presence of link failures. With majority voting protocol, a location is survived for read/write operations if and only if it is accessible to more than half of the replicas. The problem is to find out the optimal placements for a given number of data replicas in a ring network. When the number of replicas is odd, it was conjectured by Hu et al. that every uniform placement is optimal, which is proved by Shekhar and Wu later. However, when the number of replicas is even, it was pointed out by Hu et al. thai uniform placements are not optimal and the optimal placement problem may be very complicated. In this paper, we study the optimal placement problem in a ring network with majority voting protocol and even number of replicas, and give a complete characterization of optimal placements when the number of replicas is not too large compared with the number of locations.
AB - In a distributed database system, data replicas are placed at different locations to achieve high data availability in the presence of link failures. With majority voting protocol, a location is survived for read/write operations if and only if it is accessible to more than half of the replicas. The problem is to find out the optimal placements for a given number of data replicas in a ring network. When the number of replicas is odd, it was conjectured by Hu et al. that every uniform placement is optimal, which is proved by Shekhar and Wu later. However, when the number of replicas is even, it was pointed out by Hu et al. thai uniform placements are not optimal and the optimal placement problem may be very complicated. In this paper, we study the optimal placement problem in a ring network with majority voting protocol and even number of replicas, and give a complete characterization of optimal placements when the number of replicas is not too large compared with the number of locations.
KW - Data replica
KW - Distributed database
KW - Majority voting protocol
KW - Ring network
UR - http://www.scopus.com/inward/record.url?scp=51849129862&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51849129862&partnerID=8YFLogxK
U2 - 10.1109/ICDCS.2008.14
DO - 10.1109/ICDCS.2008.14
M3 - Conference contribution
AN - SCOPUS:51849129862
SN - 9780769531724
T3 - Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008
SP - 387
EP - 394
BT - Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008
T2 - 28th International Conference on Distributed Computing Systems, ICDCS 2008
Y2 - 17 July 2008 through 20 July 2008
ER -