2LYNCH N A. Distributed algorithms [M]. San Franciso,CA:Morgan Kaufmann,1997.
3DE GROOT M H. Reaching a consensus [J]. American Statisti.cal Association,1974,69(345):118-121.
4COULOURIS George,DOLLIMORE Jean,KINDBERG Tim.Distributed systems concepts and design [M]. 金蓓弘,马应龙,译.北京:机械工业出版社,2013.
5Lü Q,CAO P,COHEN E,et al. Search and replication in un.structured peer . to . peer networks [C]// 16th InternationalConference on Supercomputing. New York: ACM Press,2002:11-15.
6BASSAM A A,CHEN W,ZHOU B B,et al. Effects of replicaplacement algorithms on performance of structured overlay net.works [C]// Parallel and Distributed Processing Symposium.Nice:IPDPS,2007:111-117.
7Gilbert S, Lynch N. Brewer's conjecture and the feasi- bility of consistent, available, partition-tolerant web services[J]. ACM SIGACT News, 2002,33(2) : 51-59.
8Abadi D J. Consistency tradeoffs in modem distributed database system design[J]. Computer IEEE Computer Magazine, 2012,45 (2) : 37.
9Guerraoui R, Hari C. On the consistency problem in mobile distributed computing[C]//Proceedings of the second ACM international workshop on Principles of mobile computing. ACM, 2002 : 51-57.
10Van Steen M. Distributed Systems Principles and Para- digrnsrJT. Network, 2002,2 : 28.
