Data Replication Using Read-One-Write-All Monitoring Synchronization Transaction System in Distributed Environment

Ahmad, Zainal Arifin

doi:10.3844/jcssp.2010.1095.1098

Cited by 5 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The examples of all-data-to-allsites protocols are Read-One-Write-All (ROWA) (Ahmad et al, 2010a;Deris et al, 2009) and Hierarchical Replication Scheme (HRS) (Perez et al, 2010). ROWA has been proposed preserving replicated data file in network environment (Ahmed et al, 2010a;. Meanwhile, replication in HRS starts when a transaction initiates at site 1.…”

Section: Introductionmentioning

confidence: 99%

Handling Fragmented Database Replication through Binary Vote Assignment Grid Quorum

Fauzi¹,

Adzhar²,

Zain³

et al. 2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement:Organizations critically needed to supply recent data to users who may be geographically remote, while at the same time handle a volume request of distributed data around multiple sites. The storage, availability and consistency are important issues to be addressed in order to allow distributed users efficiently and safely access data from many different sites. Approach: Data replication is a way to deal with this problem since it provides user with fast, local access to shared data and protects availability of applications because alternate data access options exist. Handling fragmented database replication becomes challenging issue to administrator since the distributed database was scattered into split replica partitions or fragments. Results: This study presented a new mechanism on how to handle the fragmented database replication through the Binary Vote Assignment on Grid Quorum (BVAGQ). We address how to build reliable system by using the proposed BVAGQ for distributed database fragmentation. Conclusion: The result shows that managing fragmented database replication and transaction through proposed BVAGQ is able to preserve the data consistency.

show abstract

Section: Introductionmentioning

confidence: 99%

Handling Fragmented Database Replication through Binary Vote Assignment Grid Quorum

Fauzi¹,

Adzhar²,

Zain³

et al. 2011

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…In the best case only the root can be accessed for fresh data. This is the property of ROWA protocol [25] which is the best identified protocol having minimum cost for read quorum. Write quorums are decided same as the read quorums.…”

Section: Creation Of Read/write Quorum From Sohlsmentioning

confidence: 99%

“…The most simple replication protocol is the Read One Write All (ROWA) [25]. This protocol is suitable for static networks having fixed and dedicated servers for the replication.…”

Section: Related Workmentioning

confidence: 99%

Self Organized Replica Overlay Scheme for P2P Networks

Bhushan¹,

Dave²,

Patel³

2012

IJCNIS

View full text Add to dashboard Cite

-Peer-to-Peer (P2P) systems are widely used for data sharing applications in an autonomous and decentralized mode. P2P systems are suitable for largescale distributed environments in which nodes can share resources other than data such as computing power, memory and network bandwidth. Some of important parameters that affect the performance of P2P systems are peer availability, data availability, network overhead, overlay structure, churn rate, and data access time. In this paper a self organized replica overlay scheme "Improved Hierarchical Quorum Consensus" (IHQC) for P2P systems is proposed. This scheme organizes replicas in a Self Organized Hierarchical Logical Structure (SOHLS) that has special properties. The scheme improves performance of the system by reducing search time to form read/write quorums, reducing probability of accessing stale data, improving degree of intersection among consecutive quorums and reducing network overhead. This scheme is highly fault tolerant (tolerate up to 1 n  faults) due to replication of data and inherits the best property of Read-One-Write-All (ROWA) protocol in a dynamic environment of P2P network. The architecture for IHQC is also proposed for implementing the scheme that supports improved performance of P2P systems. This scheme also maximizes the degree of intersection set of read and write quorums; hence, having higher probability to get updated data as compared to all other schemes. The mathematical correctness of the scheme is also presented in the paper. The results of simulation study of the proposed scheme also support and verify its better performance than Random and Hierarchical Quorum Scheme.

show abstract

“…In BRS technique (Perez et al, 2010), the clients that who request for the data file, the replicas are created as close as possible to them. The root replica grows toward the clients in a branching way, slip replicas into several sub replicas (Ahmad et al, 2010c;2010d). In this technique, the replica tree will be growing based on the client needs.…”

Section: Introductionmentioning

confidence: 99%

“…Using this technique, the data will be replicated or copy at all sites and has the highest storage of use. Neighbor Replication on Grid (NRG) considers only neighbors obtain a data copy where the neighbors are assigned with binary vote one and zero otherwise (Ahmad et al, 2010c;2010d). NRG requires significantly lower communication cost for an operation, while providing high system availability, due to the minimum number of quorum size required executing the transaction (Noraziah et al, 2009).…”

Section: Introductionmentioning

confidence: 99%

Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model

Zin¹,

Adzhar²,

Abdalla³

et al. 2012

Journal of Computer Science

View full text Add to dashboard Cite

Abstract:A data grid is compose of hundreds of geographically distributed computers and storage resources usually locate under different places and enables users to share data and other resources. Problem statement: Data replication is one of the mechanisms in managing data grid architecture that receive particular attention since it can provide efficient access to data, fault tolerance, reduce access latency and also can enhance the performance of the system. However, during transaction deadlock may occur that can reduce the throughput by minimizing the available resources, so it becomes an important resource management problem in distributed systems. Approach: The Neighbor Replication on Grid Deadlock Detection (NRGDD) transaction model has been developed to handle two deadlock cycle problems on grid. By deploying this method, the transactions communicate with each other by passing the probe messages. The victim message has been used to detect the deadlock when the number of waiting resource by other transaction is highest and become as the cause of deadlock occurs. In addition, this transaction must be aborted to solve the problem. Results: NRGDD transaction model are able to detect and solve more than one cycle of deadlocks. Conclusion: NRGDD has resolve the deadlock problem by sending the minimum number of probes message to detect the deadlock and it can resolve the deadlock to ensure the transaction can be done smoothly.

show abstract

Data Replication Using Read-One-Write-All Monitoring Synchronization Transaction System in Distributed Environment

Cited by 5 publications

References 8 publications

Handling Fragmented Database Replication through Binary Vote Assignment Grid Quorum

Handling Fragmented Database Replication through Binary Vote Assignment Grid Quorum

Self Organized Replica Overlay Scheme for P2P Networks

Solving Two Deadlock Cycles through Neighbor Replication on Grid Deadlock Detection Model

Contact Info

Product

Resources

About