English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In ad hoc networks, since network division occurs frequently, it is effective to replicate data items. This paper proposes effective replica allocation methods in ad hoc networks where each data item is updated at irregular intervals. The proposed methods allocate replicas based on probability density functions of the update intervals of data items. Also, they invalidate replicas that have been updated with high probability because accesses to old replicas impose extra computational overhead and roll backs. As a result, the proposed methods not only improve data accessibility but also reduce the number of accessing old replicas.

Replica Allocation Considering Data Update Intervals in Ad Hoc Networks