Main Article Content
Kuhlenkamp, J., Klems, M. and Röss, O. (2014), “Benchmarking scalability and elasticity of distributed database systems”, Proceedings of the VLDB Endowment, Vol. 7(12), pp. 1219-1230, DOI: https://doi.org/10.14778/2732977.2732995
Gupta, S., Saroha K. (2011), “Fundamental Research of Distributed Database”, IJSMS, 11.
Brewer, E. (2000), “Towards robust distributed systems (abstract)”, Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing - PODC '00, DOI: https://doi.org/10.1145/343477.343502
Gilbert, S. and Lynch, N. (2002), “Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services”, ACM SIGACT News, Vol. 33(2), p. 51, DOI: https://doi.org/10.1145/564585.564601
Brewer, E. (2012), “CAP twelve years later: How the "rules" have changed”, Computer, Vol. 45(2), pp. 23-29, DOI: https://doi.org/10.1109/MC.2012.37
Gilbert, S. and Lynch, N. (2012), “Perspectives on the CAP Theorem”, Computer, Vol. 45(2), pp. 30-36, DOI: https://doi.org/10.1109/MC.2011.389
Kleppmann, M. (2015), “A Critique of the CAP Theorem”, ArXiv, 1509.05393v2, DOI: https://doi.org/10.17863/CAM.13083
Banothu, N., Bhukya, S. and Sharma, K. (2016), “Big-data: Acid versus base for database transactions”, 2016 International Conference ICEEOT, DOI: https://doi.org/10.1109/ICEEOT.2016.7755401
Bailis, P. and Ghodsi, A. (2013), “Eventual consistency today: limitations, extensions, and beyond”, Communications of the ACM, Vol. 56(5), p. 55, DOI: https://doi.org/10.1145/2460276.2462076
Calder, B. (2011), “Windows Azure Storage: a highly available cloud storage service with strong consistency”, Proc.of the Twenty-Third ACM SOSP '11, DOI: https://doi.org/10.1145/2043556.2043571
Kumalakov, B. and Bakibayev, T. (2017), “Distributed Data Store Architecture Towards Colonial Data Replication”, 2017 IEEE 11th Int. Conf. on Application of Inf. and Comm. Techn. (AICT), DOI: https://doi.org/10.1109/ICAICT.2017.8686925
Diestel, R. (2016), Graph theory, Heidelberg: Springer-Verlag, pp. 5-6, DOI: https://doi.org/10.1109/ICAICT.2017.8686925
Burmester, M., Le, T. and Yasinsac, A. (2007), Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks, Ad Hoc Networks, Vol. 5(3), pp. 313-323, DOI: https://doi.org/10.1016/j.adhoc.2005.11.007
Haas, Z., Halpern, J. and Li Li (2002), “Gossip-based ad hoc routing”, Proceedings. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societiesm, 3, pp.1707-1716.
Gut, A. (2012), Probability, Springer, New York, NY: p.17.
Ross, S. (2007), Introduction to probability models, 9th ed. Amsterdam: Elsevier/Academic Press.
Olifer, N. and Olifer, V. (2010), Computer networks, Willy India, New Delhi.
Rukkas, K. and Zholtkevych, G. (2015), “Distributed Datastores: Towards Probabilistic Approach for Estimation of Dependability”, 11th Int. Conference on ICT in Education, Research, and Industrial Applications, 1356, pp.523-534.