The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—The focus of our work is to design and build a dynamic data distribution system that is <it>coherence-preserving</it>, i.e., the delivered data must preserve associated coherence requirements (the user-specified bound on tolerable imprecision) and <it>resilient</it> to failures. To this end, we consider a system in which a set of repositories cooperate with each other and the sources, forming a peer-to-peer network. In this system, necessary changes are <it>pushed</it> to the users so that they are automatically informed about changes of interest. We present techniques 1) to determine when to push an update from one repository to another for coherence maintenance, 2) to construct an efficient dissemination tree for propagating changes from sources to cooperating repositories, and 3) to make the system resilient to failures. An experimental evaluation using real world traces of dynamically changing data demonstrates that 1) careful dissemination of updates through a network of cooperating repositories can substantially lower the cost of coherence maintenance, 2) unless designed carefully, even push-based systems experience considerable loss in fidelity due to message delays and processing costs, 3) the computational and communication cost of achieving resiliency can be made to be low, and 4) <it>surprisingly</it>, adding resiliency can actually improve fidelity even in the absence of failures.</p>
Resiliency, dynamic data dissemination, data coherence, cooperation.
Shetal Shah, Krithi Ramamritham, Prashant Shenoy, "Resilient and Coherence Preserving Dissemination of Dynamic Data Using Cooperating Peers", IEEE Transactions on Knowledge & Data Engineering, vol. 16, no. , pp. 799-812, July 2004, doi:10.1109/TKDE.2004.1318563
79 ms
(Ver 3.3 (11022016))