Abstract
Replicating data across servers or storages in different data centers allows using data closer to the client and reducing latency for applications, In addition, it also increases the availability in the event of one or some datacenters failure. Hence, replica consistency among all nodes is a major consideration when designing high-availability across-domain datacenters. Even lots of mechanisms are proposed to reach this consistency target, we believe knowing the degree of consistency is helpful to an application developer as the dimension of uncertainty is reduced: The quality of service (QoS) becomes, to some degree, predictable. For this purpose, this paper proposes a novel algorithm called RPECA which can be applied to monitor consistency behaviors in a cost-efficient way. RPECA is based on theory of rumor propagation in complex networks. In this paper, we focus on the probability of each node’s specific status in the network (Ignorant, Spreader or Stifler). Based on the discrete-time markov chain model technique, we apply a set of topology-independent equations to describe the microscope dynamic property of each node at any given time. Besides, we construct the whole phase diagram of the rumor spreading process in SF and small-world networks to simulate consistency behavior. In the experimental part, on one hand, the numerical results of our RPECA method could almost coincide with the empirical results of Monte Carlo (MC) simulations, which proves that our algorithm could simulated the whole phase diagram correctly. On the other hand, since the numerical results could be solved with less iterations, our RPECA algorithm could significantly outperform MC method with respect to time complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Gilbert, S., Lynch, N.: Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. In: ACM SIGACT News, vol. 33, pp. 51–59 (2002)
Abadi, D.J.: Consistency tradeoffs in modern distributed database system design: CAP is only part of the story. Computer 2, 37–42 (2012)
Wen, D., Wang, H.-M., Yan, J., Peng, Z.: A rumor-spreading analog on unstructured P2P broadcast mechanism. J. Comput. Res. Dev. 41, 1460–1465 (2004)
Birman, K.: Reliable Distributed Systems Technologies, Web Services and Applications. Springer Science and Business Media, New York (2005)
Bailis, P., Venkataraman, S., Franklin, M., Hellerstein, J., Stoica, I.: Probabilistically bounded staleness for practical partial quorums. In: Proceedings of the VLDB Endowment, pp. 776–787 (2012)
Zellag, K., Kemme, B.: How consistent is your cloud application? In: Proceedings of the Third ACM Symposium on Cloud Computing (2012)
Bermbach, D., Kuhlenkamp, J.: Consistency in distributed storage systems: an overview of models, metrics and measurement approaches. In: Proceedings of the International Conference on Networked Systems (NETYS), vol. 7853, pp.175–189. Springer, Heidelberg (2013)
Rahman, M., Golab, W., AuYoung, A., Keeton, K., Wylie, J.: Toward a principled framework for benchmarking consistency. In: Proceedings of the Eighth USENIX Conference on Hot Topics in System Dependability, p. 8. USENIX Association (2012)
Golab, W., Li, X., Shah, M.A.: Analyzing consistency properties for fun and profit. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 197–206. ACM press (2011)
Erdos, P., Renyi, A.G.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. A247, 529–551 (1955)
Watts, D.J., Strongatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)
Newman, M.E.J., Watts, D.J.: Renormalization group analysis of the small-world network model. Phys. Lett. A 263, 341–346 (1999)
Barabasi, A.L., Albert, R.: Emergence of scalling in random networks. Science 286, 509–512 (1999)
Satorrasr, R.P., Vespignani, A.: Evolution and Structure of the Internet: a Statistical Physics Approach. Cambridge University Press, Cambridge (2004)
Caldarelli, G.: ScaSle-Free Networks. Oxford University Press, Oxford (2007)
Zanette, D.H.: Dynamics of rumor propagation on small-world networks. Phys. Rev. E. 64, 041908 (2002)
Moreno, Y., Nekovee, M., Pacheco, A.F.: Dynamics of rumor spreading in complex networks. Phys. Rev. E. 69, 066130 (2004)
Dodds, P.S., Watts, D.J.: Universal behavior in a generalized model of contagion. Phys. Rev. Lett. 92, 218701 (2004)
Moreno, Y., Gomez, J.B., Pacheco, A.F.: Epidemic incidence in correlated complex networks. Phys. Rev. E 68, 035103 (2003)
Zanette, D.H.: Critical behavior of propagation on small-world networks. Phys. Rev. E 64, 050901 (2001)
Anderson, R.M., May, R.M.: Infections Disease of Humans. Oxford University Press, Oxford (1991)
Gomez, S., Arenas, A.: Discrete-time Markov chain approach to contact-based disease spreading in complex networks. Europhys. Lett. 89, 38009 (2010)
Gomez, S., Arenas, A.: Probabilistic framework for epidemic spreading in complex networks. Int. J. Complex Syst. Sci. 1, 47–54 (2011)
Nekovee, M., Moreno, Y., Bianconi, G., Marsili, M.: Theory of rumor spreading in complex social networks. Physica A 374, 457–470 (2007)
Maki, D.P.: Mathematical Models and Applications, with Emphasis on Social, Life, and Management Sciences. Prentice-Hall, Englewood Cliffs (1973)
Daley, D.J., Gani, J.: Epidemic Modelling. Cambridge University Press, Cambridge (2000)
Newman, M.E.J., Watts, D.J.: Renormalization group analysis of the small-world network model. Phys. Lett. A 263, 341–346 (1999)
Acknowledgments
This work is supported by The National High Technology Research and Development Program of China (863 Program) No. 2015AA050203; No. 2013AA014800; the Core Electronic Devices, High-end Generic Chips and Basic Software of National Science and Technology Major Projects of China, No. 2013ZX01039002.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhang, D., Su, Z., Qi, K., Xin, G., Wei, P. (2015). RPECA-Rumor Propagation Based Eventual Consistency Assessment Algorithm. In: Chen, Y., Ienne, P., Ji, Q. (eds) Advanced Parallel Processing Technologies. APPT 2015. Lecture Notes in Computer Science(), vol 9231. Springer, Cham. https://doi.org/10.1007/978-3-319-23216-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-23216-4_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23215-7
Online ISBN: 978-3-319-23216-4
eBook Packages: Computer ScienceComputer Science (R0)