Welcome to the InfoSci Platform
Reference Hub1
A New Eager Replication Approach Using a Non-Blocking Protocol Over a Decentralized P2P Architecture

A New Eager Replication Approach Using a Non-Blocking Protocol Over a Decentralized P2P Architecture

Katembo Kituta Ezéchiel, Shri Kant Ojha, Ruchi Agarwal
Copyright: © 2020 |Volume: 11 |Issue: 2 |Pages: 32
ISSN: 1947-3532|EISSN: 1947-3540|EISBN13: 9781799807087|DOI: 10.4018/IJDST.2020040106
Cite Article Cite Article

MLA

Ezéchiel, Katembo Kituta, et al. "A New Eager Replication Approach Using a Non-Blocking Protocol Over a Decentralized P2P Architecture." IJDST vol.11, no.2 2020: pp.69-100. http://doi.org/10.4018/IJDST.2020040106

APA

Ezéchiel, K. K., Ojha, S. K., & Agarwal, R. (2020). A New Eager Replication Approach Using a Non-Blocking Protocol Over a Decentralized P2P Architecture. International Journal of Distributed Systems and Technologies (IJDST), 11(2), 69-100. http://doi.org/10.4018/IJDST.2020040106

Chicago

Ezéchiel, Katembo Kituta, Shri Kant Ojha, and Ruchi Agarwal. "A New Eager Replication Approach Using a Non-Blocking Protocol Over a Decentralized P2P Architecture," International Journal of Distributed Systems and Technologies (IJDST) 11, no.2: 69-100. http://doi.org/10.4018/IJDST.2020040106

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Eager replication of distributed databases over a decentralized Peer-to-Peer (P2P) network is often likely to generate unreliability because participants can be or cannot be available. Moreover, the conflict between transactions initiated by different peers to modify the same data is probable. These problems are responsible of perpetual transaction abortion. Thus, a new Four-Phase-Commit (4PC) protocol that allows transaction commitment with available peers and recovering unavailable peers when they become available again has been designed using the nested transactions and the distributed voting technique. After implementing the new algorithm with C#, experiments made it possible to analyse the performance which revealed that the new algorithm is efficient because in one second it can replicate a considerable number of records, such as when an important volume of data can be queued for subsequent recovery of the concerned slave peers when they become available again.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.