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 a P2P-based Massively Multiuser Virtual Environment (MMVE) where nodes cannot be trusted, replicating data on multiple nodes is a possibility to increase the reliability to obtain correct data. Current structured P2P networks mostly place replicas in such a way that queries for the replicas travel along similar paths. A malicious node in the common part of all paths can nullify the security gain of replicated data. We therefore propose to combine radix-based prefix routing with a symmetric replication scheme to gain disjoint paths to each of the replicas.

Fighting Cheating in P2P-based MMVEs with Disjoint Path Routing