Data management issues in mobile and peer-to-peer environments

Budiarto,; Nishio, Shojiro; Tsukamoto, Masahiko

doi:10.1016/s0169-023x(02)00040-x

Cited by 47 publications

(18 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(Budiarto et al, 2002) discusses replication dynamics, replication level, and replica placement. Replication can be static or dynamic, depending on whether the location and the number of replicas are decided before deployment or can change following the access patterns.…”

Section: Cooperative Cachingmentioning

confidence: 99%

Data Dissemination and Query Routing in Mobile Peer-to-Peer Networks

Repantis

Kalogeraki

2010

Networking and Telecommunications

View full text Add to dashboard Cite

show abstract

Section: Cooperative Cachingmentioning

confidence: 99%

Data Dissemination and Query Routing in Mobile Peer-to-Peer Networks

Repantis

Kalogeraki

2010

Networking and Telecommunications

View full text Add to dashboard Cite

show abstract

“…Synchronous replication can be categorized into several schemes, i.e., all -data-to-all-sites (full replication) and some-dataitems-to-all-sites. However, full replication causes high update propagation, high storage capacity and difficult to maintain the data consistency [1,9,10] . A few studies have been done on partial replication techniques based on some data items to all sites using tree structure technique [11,12] .…”

Section: Introductionmentioning

confidence: 99%

Preserving Data Consistency through Neighbor Replication on Grid Daemon

Ahmad¹,

Deris²,

Ahmed³

et al. 2007

American J. of Applied Sciences

View full text Add to dashboard Cite

Abstract:In modern distributed systems, replication receives particular attention for providing high data availability, fault tolerance and enhance the performance of the system. It is an important mechanism because it enables organizations to provide users with access to current data where and when they need it. However, this way of data organization introduces low data consistency and data coherency as more than one replicated copies need to be updated. Expensive synchronization mechanisms are needed to maintain the consistency and integrity of data among replicas when changes are made by the transactions. In this paper, we present Neighbor Replication on Grid (NRG) daemon in order to manage replication and transactions in distributed system. NRG Transaction Model has been implemented in order to preserve the data consistency and availability. Based on experiment and result, it shows that NRG daemon guarantees consistency and obey serializability through the synchronization approach.

show abstract

“…It is based on quorum to execute the operations with high degree of consistency [4] and also to ensure serializability. Synchronous replication can be categorized into several schemes, i.e., all data to all sites (full replication), all data to some sites and some data to all sites.…”

Section: Introductionmentioning

confidence: 99%

“…However, full replication causes high update propagation and also needs high storage capacity [4,5,6]. Several studies model partial replication in a way that each data object is replicated to some of the sites.…”

Section: Introductionmentioning

confidence: 99%

Managing Data Using Neighbor Replication on Triangular-Grid Structure

Mamat

Deris

Abawajy

et al. 2006

Computational Science – ICCS 2006

View full text Add to dashboard Cite

Abstract. Data is one of the domains in grid research that deals with the storage, replication, and management of large data sets in a distributed environment. The all-data-to-all sites replication scheme such as read-one write-all and tree grid structure (TGS) are the popular techniques being used for replication and management of data in this domain. However, these techniques have its weaknesses in terms of data storage capacity and also data access times due to some number of sites must 'agree' in common to execute certain transactions. In this paper, we propose the all-data-to-some-sites scheme called the neighbor replication on triangular grid (NRTG) technique by considering only neighbors have the replicated data, and thus, minimizes the storage capacity as well as high update availability. Also, the technique tolerates failures such as server failures, site failure or even network partitioning using remote procedure call (RPC).

show abstract

Data management issues in mobile and peer-to-peer environments

Cited by 47 publications

References 9 publications

Data Dissemination and Query Routing in Mobile Peer-to-Peer Networks

Data Dissemination and Query Routing in Mobile Peer-to-Peer Networks

Preserving Data Consistency through Neighbor Replication on Grid Daemon

Managing Data Using Neighbor Replication on Triangular-Grid Structure

Contact Info

Product

Resources

About