Adaptive Distributed Database Replication Through Colonies of Pogo Ants

Abdul-Wahid, S.; Andonie, Răzvan; Lemley, Joseph; Schwing, J.L.; Widger, Jonathan

doi:10.1109/ipdps.2007.370575

Cited by 9 publications

(7 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…DCs, within a DC in different nodes or at the client-side [4,4,15], whereas the focus of adaptive geo-replication is to decide what data, where the data is located within the overall system of DCs and how many replicas exist simultaneously, [1,2,10,12,18]. Both of these types maybe be combined to obtain further performance improvements.…”

Section: Classification Of Strategiesmentioning

confidence: 99%

Adaptive strength geo-replication strategy

Signes¹,

Bieniusa

2015

Proceedings of the First Workshop on Principles and Practice of Consistency for Distributed Data

View full text Add to dashboard Cite

The amount of data being processed in Data Centres (DCs) keeps growing at an enormous rate so that full replication may start being impractical. The application of replication between DCs is used to increase data availability in the presence of site failures and to reduce latency by accessing the data closely located, if possible. This means that replicating the data only in some of the DCs is becoming more critical in order to reduce the costs of keeping the data (weakly) consistent while maintaining high availability (scalability) and low access costs. When data read and write request patterns change, then deciding which data should be replicated and where needs to be made dynamically. Given that the problem of finding an optimal replication schema in a general network has been shown to be NP-complete for the static case, so it is unlikely that there exists a general algorithm for an optimal solution to the dynamic problem.We present here a new adaptive bio-inspired replication strategy, which is completely decentralised, adaptive, and event-driven, inspired on the Ant Colony algorithm.

show abstract

Section: Classification Of Strategiesmentioning

confidence: 99%

Adaptive strength geo-replication strategy

Signes¹,

Bieniusa

2015

Proceedings of the First Workshop on Principles and Practice of Consistency for Distributed Data

View full text Add to dashboard Cite

show abstract

“…Wahid et al, [2] discuss distribution problem of replicated databases and its optimization in a computer network. As replication enables data availability in case of any site failure and also provides local access of data.…”

Section: Literature Reviewmentioning

confidence: 99%

“…[2] It optimizes distribution of partially replicated databases in network systems which minimizes inter node communication and gives better response time and enables dynamic addition of replicas.…”

Section: Critical Analysismentioning

confidence: 99%

See 1 more Smart Citation

Discovering Database Replication Techniques in RDBMS

Hussain¹,

Khan²

2014

IJDTA

View full text Add to dashboard Cite

show abstract

“…This advantage enables P2P systems to perform complex tasks with relatively low cost and without any need of powerful servers. P2P systems are used for sharing data and resources such as computing power, storage space, network bandwidth and all other attached resources in an autonomously decentralized manner [5]. The number of resources is increased for utilization by increasing in the number of connected peers to the P2P network.…”

Section: Introductionmentioning

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

Adaptive Distributed Database Replication Through Colonies of Pogo Ants

Abstract: We

Cited by 9 publications

References 26 publications

Adaptive strength geo-replication strategy

Adaptive strength geo-replication strategy

Discovering Database Replication Techniques in RDBMS

Self Organized Replica Overlay Scheme for P2P Networks

Contact Info

Product

Resources

About