On the public citation graph

A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn

0 signed · 96 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-44751-2_15openalex-snapshot
P-Grid: A Self-Organizing Access Structure for P2P Information Systems
inferredcites →https://doi.org/10.1007/3-540-45748-8_26openalex-snapshot
Dynamically Fault-Tolerant Content Addressable Networks
inferredcites →https://doi.org/10.1007/978-3-540-30183-7_17openalex-snapshot
Willow: DHT, Aggregation, and Publish/Subscribe in One Protocol
inferredcites →https://doi.org/10.1007/978-3-540-30186-8_23openalex-snapshot
Active and Concurrent Topology Maintenance
inferredcites →https://doi.org/10.1016/0743-7315(89)90021-xopenalex-snapshot
Dynamic load balancing for distributed memory multiprocessors
inferredcites →https://doi.org/10.1109/empdp.2003.1183575openalex-snapshot
Scheduling and load balancing
inferredcites →https://doi.org/10.1109/ipdps.2003.1213125openalex-snapshot
A generic scheme for building overlay networks in adversarial scenarios
inferredcites →https://doi.org/10.1109/iwqos.2006.250446openalex-snapshot
A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves
inferredcites →https://doi.org/10.1109/jsac.2003.818784openalex-snapshot
Tapestry: A Resilient Global-Scale Overlay for Service Deployment
inferredcites →https://doi.org/10.1109/p2p.2004.7openalex-snapshot
Aggregating information in peer-to-peer systems for improved join and leave
inferredcites →https://doi.org/10.1109/ptp.2004.1334951openalex-snapshot
Aggregating information in peer-to-peer systems for improved join and leave
inferredcites →https://doi.org/10.1137/0218015openalex-snapshot
The Token Distribution Problem
inferredcites →https://doi.org/10.1145/258492.258523openalex-snapshot
Accessing nearby copies of replicated objects in a distributed environment
inferredcites →https://doi.org/10.1145/356989.357007openalex-snapshot
OceanStore
inferredcites →https://doi.org/10.1145/383059.383071openalex-snapshot
Chord
inferredcites →https://doi.org/10.1145/383059.383072openalex-snapshot
A scalable content-addressable network
inferredcites →https://doi.org/10.1145/571825.571857openalex-snapshot
Viceroy
inferredcites →https://doi.org/10.1145/72935.72943openalex-snapshot
Load balancing, selection sorting on the hypercube
inferredcites →https://doi.org/10.1145/762483.762485openalex-snapshot
Astrolabe
inferredcites →https://doi.org/10.5555/644108.644170openalex-snapshot
Skip graphs
inferredcites →https://doi.org/10.5555/982792.982836openalex-snapshot
The hyperring: a low-congestion deterministic data structure for distributed environments
inferredcites →https://doi.org/10.5555/982792.982873openalex-snapshot
LAND: stretch (1 + ε) locality-aware networks for DHTs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.1152openalex-snapshot
An analytical study on optimizing the lookup performance of distributed hash table systems under churn
inferred← citeshttps://doi.org/10.1002/rsa.20752openalex-snapshot
Cover time and mixing time of random walks on dynamic graphs
inferred← citeshttps://doi.org/10.1007/11945529_20openalex-snapshot
Robust Random Number Generation for Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-11197-1_26openalex-snapshot
Hierarchical Eventual Leader Election for Dynamic Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-26447-9_1openalex-snapshot
Introduction: Self-Action Models
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_2openalex-snapshot
Dynamic Networks of Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_23openalex-snapshot
Distributed Disaster Disclosure
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_16openalex-snapshot
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-04117-4_18openalex-snapshot
Peer-to-Peer Botnets
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_3openalex-snapshot
Regular Register: An Implementation in a Churn Prone Environment
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_27openalex-snapshot
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
inferred← citeshttps://doi.org/10.1007/978-3-642-17653-1_18openalex-snapshot
SkewCCC+: A Heterogeneous Distributed Hash Table
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_11openalex-snapshot
Dense Subgraphs on Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_37openalex-snapshot
CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System
inferred← citeshttps://doi.org/10.1007/s00224-008-9099-9openalex-snapshot
Towards a Scalable and Robust DHT
inferred← citeshttps://doi.org/10.1007/s00224-012-9431-2openalex-snapshot
Re-Chord: A Self-stabilizing Chord Overlay Network
inferred← citeshttps://doi.org/10.1007/s00446-010-0099-zopenalex-snapshot
Towards worst-case churn resistant peer-to-peer systems
inferred← citeshttps://doi.org/10.1007/s00446-015-0258-3openalex-snapshot
DEX: self-healing expanders
inferred← citeshttps://doi.org/10.1007/s12083-015-0340-4openalex-snapshot
A novel replication technique to attenuate churn effects
inferred← citeshttps://doi.org/10.1007/s12083-019-00773-9openalex-snapshot
A balanced strategy to improve data invulnerability in structured P2P system
inferred← citeshttps://doi.org/10.1016/j.ins.2013.04.029openalex-snapshot
Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance
inferred← citeshttps://doi.org/10.1016/j.ins.2017.06.012openalex-snapshot
Combinatorial analysis of the subsystem reliability of the split-star network
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.11.002openalex-snapshot
Implementing set objects in dynamic distributed systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.06.004openalex-snapshot
Maintaining the Ranch topology
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.09.012openalex-snapshot
IoT architecture for adaptation to transient devices
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.003openalex-snapshot
Robust random number generation for peer-to-peer systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.08.029openalex-snapshot
Corona: A stabilizing deterministic message-passing skip list
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.027openalex-snapshot
A deterministic worst-case message complexity optimal solution for resource discovery
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.022openalex-snapshot
Compact routing messages in self-healing trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.025openalex-snapshot
Dynamic networks of finite state machines
inferred← citeshttps://doi.org/10.1109/icccn.2009.5235360openalex-snapshot
A Systematic Study on Peer-to-Peer Botnets
inferred← citeshttps://doi.org/10.1109/icdcs57875.2023.00032openalex-snapshot
Churn-Tolerant Leader Election Protocols
inferred← citeshttps://doi.org/10.1109/icpads.2009.119openalex-snapshot
A Diffusive Load Balancing Scheme for Clustered Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.1109/indicon.2014.7030428openalex-snapshot
Characterizing behaviour of Complex networks against perturbations and generation of Pseudo-random networks
inferred← citeshttps://doi.org/10.1109/infocom.2006.132openalex-snapshot
Proportional Replication in Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470412openalex-snapshot
A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems
inferred← citeshttps://doi.org/10.1109/ispdc.2006.31openalex-snapshot
Improving Churn Resistance of P2P Data Stores Based on the Hypercube
inferred← citeshttps://doi.org/10.1109/iwqos.2006.250446openalex-snapshot
A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves
inferred← citeshttps://doi.org/10.1109/p2p.2005.34openalex-snapshot
Self-Stabilizing Structured Ring Topology P2P Systems
inferred← citeshttps://doi.org/10.1109/p2p.2006.17openalex-snapshot
eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
inferred← citeshttps://doi.org/10.1109/p2p.2007.31openalex-snapshot
A Feasibility Study on Defending Against Ultra-Fast TopologicalWorms
inferred← citeshttps://doi.org/10.1109/saso.2008.44openalex-snapshot
PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn
inferred← citeshttps://doi.org/10.1109/saso.2009.25openalex-snapshot
Dissecting Self-* Properties
inferred← citeshttps://doi.org/10.1109/tcns.2018.2795704openalex-snapshot
Peer-to-Peer Gradient Topologies in Networks With Churn
inferred← citeshttps://doi.org/10.1109/tpds.2010.24openalex-snapshot
Fast and Message-Efficient Global Snapshot Algorithms for Large-Scale Distributed Systems
inferred← citeshttps://doi.org/10.1109/tpds.2011.97openalex-snapshot
Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn
inferred← citeshttps://doi.org/10.1145/1148109.1148163openalex-snapshot
Towards a scalable and robust DHT
inferred← citeshttps://doi.org/10.1145/1400751.1400779openalex-snapshot
The forgiving tree
inferred← citeshttps://doi.org/10.1145/1542245.1542273openalex-snapshot
Robust live media streaming in swarms
inferred← citeshttps://doi.org/10.1145/1582716.1582741openalex-snapshot
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
inferred← citeshttps://doi.org/10.1145/1806689.1806760openalex-snapshot
Distributed computation in dynamic networks
inferred← citeshttps://doi.org/10.1145/1953563.1953569openalex-snapshot
Robust architectures for open distributed systems and topological self-stabilization
inferred← citeshttps://doi.org/10.1145/1959045.1959063openalex-snapshot
Distributed computing column 41 computing over dynamic networks
inferred← citeshttps://doi.org/10.1145/1959045.1959064openalex-snapshot
Dynamic networks
inferred← citeshttps://doi.org/10.1145/1989493.1989527openalex-snapshot
Re-Chord
inferred← citeshttps://doi.org/10.1145/2629695openalex-snapshot
SKIP +
inferred← citeshttps://doi.org/10.1145/2833312.2833328openalex-snapshot
Compact routing messages in self-healing trees
inferred← citeshttps://doi.org/10.1145/2935764.2935783openalex-snapshot
Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
inferred← citeshttps://doi.org/10.1145/3369740.3369786openalex-snapshot
Fully Compact Routing in Low Memory Self-Healing Trees
inferred← citeshttps://doi.org/10.1145/3382734.3405716openalex-snapshot
DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead
inferred← citeshttps://doi.org/10.1145/3397190openalex-snapshot
Survey on Algorithms for Self-stabilizing Overlay Networks
inferred← citeshttps://doi.org/10.1155/2016/5191405openalex-snapshot
A Persistent Structured Hierarchical Overlay Network to Counter Intentional Churn Attack
inferred← citeshttps://doi.org/10.17077/etd.38hgt493openalex-snapshot
Self-stabilizing overlay networks
inferred← citeshttps://doi.org/10.3929/ethz-a-005021347openalex-snapshot
Scalable localized histogram aggregation for P2P MMOGs
inferred← citeshttps://doi.org/10.3929/ethz-a-005092069openalex-snapshot
The Price of Locality: Exploring the Complexity of Distributed Coordination Primitives
inferred← citeshttps://doi.org/10.3929/ethz-a-005350728openalex-snapshot
Understanding Ad Hoc Networks From Geometry to Mobility
inferred← citeshttps://doi.org/10.3929/ethz-a-010513480openalex-snapshot
Collaboration in Multi-Agent Systems: Adaptivity and Active Learning
inferred← citeshttps://doi.org/10.3929/ethz-b-000379990openalex-snapshot
Robust Global Localization Using GPS and Aircraft Signals
inferred← citeshttps://doi.org/10.4018/978-1-4666-9964-9.ch004openalex-snapshot
Design of Structural Controllability for Complex Network Architecture
inferred← citeshttps://doi.org/10.4230/dagsemproc.06131.5openalex-snapshot
Taming Dynamic and Selfish Peers
inferred← citeshttps://doi.org/10.48550/arxiv.1202.2466openalex-snapshot
Self-healing systems and virtual structures
inferred← citeshttps://doi.org/10.48550/arxiv.1206.1522openalex-snapshot
DEX: Self-healing Expanders
inferred← citeshttps://doi.org/10.48550/arxiv.1306.1692openalex-snapshot
A DeterministicWorst-Case Message Complexity Optimal Solution for Resource Discovery
inferred← citeshttps://doi.org/10.48550/arxiv.1803.03042openalex-snapshot
Self-healing Routing and Other Problems in Compact Memory.
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.