Loading...
Loading...

Go to the content (press return)

Performance evaluation of the fast consistency algorithms in large decentralized systems

Author
Acosta, J.; Navarro, L.
Type of activity
Journal article
Journal
Lecture notes in computer science
Date of publication
2004-06
Volume
3036
First page
615
Last page
618
DOI
https://doi.org/10.1007/978-3-540-24685-5_103 Open in new window
URL
https://link.springer.com/chapter/10.1007/978-3-540-24685-5_103 Open in new window
Abstract
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. 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. We conclude that considering application paramete...
Group of research
CNDS - Computer Networks and Distributed Systems

Participants