Abstract
In this paper we evaluate our own weak consistency algorithm, which is called the ”Fast Consistency Algorithm”, and whose main aim is optimizing the propagation of changes introducing a preference for nodes and zones of the network which have greatest demand. Weak consistency algorithms allow us to propagate changes in a large, arbitrary changing storage network in a self-organizing way. These algorithms generate very little traffic overhead; they have low latency and are scalable, in addition to being fault tolerant. The algorithm has been simulated over ns-2, and measured its performance for complex spatial distributions of demand, including Internet like self-similar fractal distributions of demand. The impulse response of the algorithm has been characterized. We conclude that considering application parameters such as demand in the event or change propagation mechanism to: 1) prioritize probabilistic interactions with neighbors with higher demand, and 2) including little changes on the logical topology (leader interconnection in hierarchical topology ), gives a surprising improvement in the speed of change propagation perceived by most users. In other words, it satisfies the greatest demand in the shortest amount of time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adya, A.: Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed Transactions, PhD thesis M.I.T., Department of Electrical Engineering and Computer Science (March 1999)
Fournier, A., Fussell, D., Carpenter, L.: Computer Rendering of Stochastic Models. Comm. of the ACM 6(6), 371–384 (1982)
Lakhina, A., Byers, J., Crovella, M., Matta, I.: On the Geographic Location of Internet Resources. In: Internet Measurement Workshop 2002 Marseille, France, November 6-8 (2002)
Danesh, A., Trajkovic, L., Robin, S.H., Smith, M.H.: Mapping the Internet (2001)
Neuman, C.: Scale in Distributed Systems. In Readings in Dist. Comp. Syst. IEEE Computer Society Press, Los Alamitos (1994)
Dietterich, J.: DEC data distributor: for data replication and data warehousing. In: Int. Conf. On Management of data, May 1994, p. 468. ACM, New York (1994)
Laherrere, J., Sornette, D.: Stretched exponential distributions in Nature and Economy: ’Fat tails’ with characteristic scales. European Physical Jour. B2, 525–539 (1998)
Elias, J.A.: Leandro Navarro Moldes: A Demand Based Algorithm for Rapid Updating of Replicas. In: IEEE Workshop on Resource Sharing in Massively Distributed Systems (RESH 2002) (July 2002)
Elias, J.A.: Leandro Navarro Moldes: Behaviour of the fast consistency algorithm in the set of replicas with multiple zones with high demand. In: Simp. in Informatics and Telecommunications, SIT 2002 (2002)
Elias, J.A.: Leandro Navarro Moldes: Generalization of the fast consistency algorithm to multiple high demand zones. In: Proc. of the Int.Conference on Computational Science 2003 (ICCS 2003), St.Petersburg, Russia, June 2-4 (2003)
Birman, K.P.: The process group approach to reliable distributed computing. Communications of ACM 36(12) (December 1993)
Petersen, K., Spreitzer, M.J., Terry, D.B., Theimer, M.M., Demers: Flexible Update Propagation for Weakly Consistent Replication. In: Proc. of the 16th ACM Symposium on Operating Systems Principles (SOSP-16), Saint Malo, France, October 5-8, pp. 288–301 (1997)
Medina, Lakhina, A., Matta, I., Byers, J.: BRITE: Universal Topology Generation from a User’s Pers
Schroeder, M.D., Birrel, A.D., Needham, R.M.: Experience with Grapevine: The Growth of a Distributed System. ACM Transactions of Computer Systems 2(1), 3–23 (1984)
Golding, R.A.: Weak-Consistency Group Communication and Membership, PhD thesis, University of California, Santa Cruz, Comp. and Inf. Sciences Tech. Report UCSC-CRL-92-52 (December 1992)
Yook, S.-H., Jeong, H., Barabási, A.-L.: Modeling the internet’s large-scale topology. Tech. Report cond-mat/0107417, Cond. Matter Archive, xxx.lanl.gov (July 2001)
The Network Simulator, http://www.isi.edu/nsnam/ns/
Duvvuri, V., Shenoy, P., Tewari, R.: Adaptative Leases: A Strong Consistency Mechanism for the World Wide Web. In: IEEE INFOCOM 2000, pp. 834–843 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Acosta-Elias, J., Reyes, B.P., Leos, E.C., Ochoa-Cardiel, A., Recio, M., Gutierrez-Navarro, O. (2005). Performance Evaluation of a Self-organized Hierarchical Topology for Update of Replicas in a Large Distributed System. In: Pan, Y., Chen, D., Guo, M., Cao, J., Dongarra, J. (eds) Parallel and Distributed Processing and Applications. ISPA 2005. Lecture Notes in Computer Science, vol 3758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576235_13
Download citation
DOI: https://doi.org/10.1007/11576235_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29769-7
Online ISBN: 978-3-540-32100-2
eBook Packages: Computer ScienceComputer Science (R0)