Symmetric Peer-to-Peer Applications

In real-time networked applications, such as shared documents, users can interact remotely and yet share the exact same experience as if they were in a single machine. In this work, we propose a middleware for symmetric peer-to-peer applications in which decentralized instances can trigger asynchronous events and yet conform to identical behavior. Peers are allowed to join and leave the network at any time. Application developers must adhere to a restricted API, which is deterministic, stateless, and only supports pre-allocated memory. The middleware is responsible for synchronizing the events in a global shared timeline across the network. Also, based on memory snapshots and deterministic simulation, a "time machine" can rollback conflicting peers to resynchronize their state. We show that the middleware can handle applications with over 20 peers in a heterogeneous topology under high churn. For instance, in a simulation scenario of 25 events per minute with a network latency of 50ms, the peers need to roll back and resynchronize only 3% of the time.

Authors

Institutions

Publication Details

Journal
Revista de Informática Teórica e Aplicada
Published
2025-03-19
DOI
https://doi.org/10.22456/2175-2745.141618
Primary Topic
Peer-to-Peer Network Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Symmetric Peer-to-Peer Applications

Francisco Sant’Anna
Revista de Informática Teórica e Aplicada
Peer-to-Peer Network Technologies
article

Symmetric Peer-to-Peer Applications

Francisco Sant’Anna
article en

Abstract

In real-time networked applications, such as shared documents, users can interact remotely and yet share the exact same experience as if they were in a single machine. In this work, we propose a middleware for symmetric peer-to-peer applications in which decentralized instances can trigger asynchronous events and yet conform to identical behavior. Peers are allowed to join and leave the network at any time. Application developers must adhere to a restricted API, which is deterministic, stateless, and only supports pre-allocated memory. The middleware is responsible for synchronizing the events in a global shared timeline across the network. Also, based on memory snapshots and deterministic simulation, a "time machine" can rollback conflicting peers to resynchronize their state. We show that the middleware can handle applications with over 20 peers in a heterogeneous topology under high churn. For instance, in a simulation scenario of 25 events per minute with a network latency of 50ms, the peers need to roll back and resynchronize only 3% of the time.

Revista de Informática Teórica e AplicadaVol. 32(2)
Universidade do Estado do Rio de Janeiro (BR)
Partnerships for the goals
Openalex Percentile: Top 85%
Peer-to-Peer Network Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Symmetric Peer-to-Peer Applications — Francisco Sant’Anna · Revista de Informática Teórica e Aplicada (2025) | TGRS Research Map | TGRS