On the public citation graph

Survey on Algorithms for Self-stabilizing Overlay Networks

0 signed · 78 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/11558989_2openalex-snapshot
A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn
inferredcites →https://doi.org/10.1007/3-540-45518-3_18openalex-snapshot
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
inferredcites →https://doi.org/10.1007/3-540-45748-8_5openalex-snapshot
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
inferredcites →https://doi.org/10.1007/978-3-030-03232-6_16openalex-snapshot
Relays: A New Approach for the Finite Departure Problem in Overlay Networks
inferredcites →https://doi.org/10.1007/978-3-030-03232-6_2openalex-snapshot
Self-stabilizing Overlays for High-Dimensional Monotonic Searchability
inferredcites →https://doi.org/10.1007/978-3-030-03232-6_4openalex-snapshot
On Underlay-Aware Self-Stabilizing Overlay Networks
inferredcites →https://doi.org/10.1007/978-3-319-03578-9_14openalex-snapshot
A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
inferredcites →https://doi.org/10.1007/978-3-319-11764-5_4openalex-snapshot
On Stabilizing Departures in Overlay Networks
inferredcites →https://doi.org/10.1007/978-3-319-21741-3_14openalex-snapshot
Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
inferredcites →https://doi.org/10.1007/978-3-319-21741-3_16openalex-snapshot
Avatar: A Time- and Space-Efficient Self-stabilizing Overlay Network
inferredcites →https://doi.org/10.1007/978-3-319-69084-1_17openalex-snapshot
A Self-stabilizing General De Bruijn Graph
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_9openalex-snapshot
Koorde: A Simple Degree-Optimal Distributed Hash Table
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_12openalex-snapshot
Networks Become Navigable as Nodes Move and Forget
inferredcites →https://doi.org/10.1007/978-3-540-77096-1_21openalex-snapshot
O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1
inferredcites →https://doi.org/10.1007/978-3-642-05118-0_2openalex-snapshot
Local Algorithms: Self-stabilization on Speed
inferredcites →https://doi.org/10.1007/978-3-642-24550-3_31openalex-snapshot
Self-Stabilizing De Bruijn Networks
inferredcites →https://doi.org/10.1007/978-3-642-24550-3_7openalex-snapshot
Building Self-stabilizing Overlay Networks with the Transitive Closure Framework
inferredcites →https://doi.org/10.1007/978-3-662-53426-7_6openalex-snapshot
Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks
inferredcites →https://doi.org/10.1007/s00224-008-9099-9openalex-snapshot
Towards a Scalable and Robust DHT
inferredcites →https://doi.org/10.1007/s00224-012-9431-2openalex-snapshot
Re-Chord: A Self-stabilizing Chord Overlay Network
inferredcites →https://doi.org/10.1007/s00224-013-9504-xopenalex-snapshot
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
inferredcites →https://doi.org/10.1007/s00224-017-9823-4openalex-snapshot
Self-Stabilizing Metric Graphs
inferredcites →https://doi.org/10.1016/j.tcs.2012.07.029openalex-snapshot
Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs
inferredcites →https://doi.org/10.1016/j.tcs.2012.08.029openalex-snapshot
Corona: A stabilizing deterministic message-passing skip list
inferredcites →https://doi.org/10.1016/j.tcs.2013.02.021openalex-snapshot
Building self-stabilizing overlay networks with the transitive closure framework
inferredcites →https://doi.org/10.1038/35022643openalex-snapshot
Navigation in a small world
inferredcites →https://doi.org/10.1109/comst.2005.1610546openalex-snapshot
A survey and comparison of peer-to-peer overlay network schemes
inferredcites →https://doi.org/10.1109/focs.2006.5openalex-snapshot
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks
inferredcites →https://doi.org/10.1109/icdcs.2018.00032openalex-snapshot
Renaissance: A Self-Stabilizing Distributed SDN Control Plane
inferredcites →https://doi.org/10.1109/icpads.2010.42openalex-snapshot
A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs
inferredcites →https://doi.org/10.1109/ipdps.2012.115openalex-snapshot
A Self-Stabilization Process for Small-World Networks
inferredcites →https://doi.org/10.1109/ipdps.2019.00093openalex-snapshot
MULTISKIPGRAPH: A Self-Stabilizing Overlay Network that Maintains Monotonic Searchability
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/netsys.2013.11openalex-snapshot
Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network
inferredcites →https://doi.org/10.1109/p2p.2014.6934300openalex-snapshot
HSkip+: A self-stabilizing overlay network for nodes with heterogeneous bandwidths
inferredcites →https://doi.org/10.1109/sfcs.1988.21938openalex-snapshot
Dynamic networks are as fast as static networks
inferredcites →https://doi.org/10.1109/sfcs.1991.185377openalex-snapshot
Distributed program checking: a paradigm for building self-stabilizing distributed protocols
inferredcites →https://doi.org/10.1109/tnet.2002.808407openalex-snapshot
Chord: a scalable peer-to-peer lookup protocol for internet applications
inferredcites →https://doi.org/10.1137/1.9781611972870.10openalex-snapshot
Linearization: Locally Self-Stabilizing Sorting in Graphs
inferredcites →https://doi.org/10.1137/110832458openalex-snapshot
The Stretch Factor of the Delaunay Triangulation Is Less than 1.998
inferredcites →https://doi.org/10.1145/1060590.1060694openalex-snapshot
How to spread adversarial nodes?
inferredcites →https://doi.org/10.1145/1073970.1073991openalex-snapshot
Fast construction of overlay networks
inferredcites →https://doi.org/10.1145/1073970.1073992openalex-snapshot
Peer-to-peer networks based on random transformations of connected regular undirected graphs
inferredcites →https://doi.org/10.1145/1148109.1148162openalex-snapshot
Distributed random digraph transformations for peer-to-peer networks
inferredcites →https://doi.org/10.1145/1151659.1159931openalex-snapshot
Minimizing churn in distributed systems
inferredcites →https://doi.org/10.1145/1290672.1290674openalex-snapshot
Skip graphs
inferredcites →https://doi.org/10.1145/1496046.1496064openalex-snapshot
Understanding hybrid CDN-P2P
inferredcites →https://doi.org/10.1145/2629695openalex-snapshot
SKIP +
inferredcites →https://doi.org/10.1145/2999572.2999580openalex-snapshot
Xpander
inferredcites →https://doi.org/10.1145/318951.319004openalex-snapshot
An algorithm for distributed computation of a spanningtree in an extended LAN
inferredcites →https://doi.org/10.1145/319056.319004openalex-snapshot
An algorithm for distributed computation of a spanningtree in an extended LAN
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
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/777412.777421openalex-snapshot
Novel architectures for P2P applications
inferredcites →https://doi.org/10.1145/858336.858339openalex-snapshot
Solved problems, unsolved problems and non-problems in concurrency
inferredcites →https://doi.org/10.4230/lipics.concur.2016.19openalex-snapshot
Topological Self-Stabilization with Name-Passing Process Calculi
inferredcites →https://doi.org/10.4230/lipics.opodis.2015.24openalex-snapshot
Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures
inferredcites →https://doi.org/10.48550/arxiv.1110.1687openalex-snapshot
Jellyfish: Networking Data Centers Randomly

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-44274-2_4openalex-snapshot
Brief Announcement: Understanding Self-stabilizing Node-Capacitated Overlay Networks Through Simulation
inferred← citeshttps://doi.org/10.1007/978-3-658-51511-9_20openalex-snapshot
Formal Verification in Modern Technologies: Safety Assurance for P2P, IoT, Blockchain, and Quantum Computing
inferred← citeshttps://doi.org/10.1007/s00446-023-00442-4openalex-snapshot
Time-optimal construction of overlay networks
inferred← citeshttps://doi.org/10.1007/s10207-025-01071-7openalex-snapshot
Securing IoT edge: a survey on lightweight cryptography, anonymous routing and communication protocol enhancements
inferred← citeshttps://doi.org/10.1007/s10458-020-09486-3openalex-snapshot
A decentralised self-healing approach for network topology maintenance
inferred← citeshttps://doi.org/10.1007/s11042-021-11831-xopenalex-snapshot
Hidden Markov Model for short term churn forecast in the structured overlay networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2024.103438openalex-snapshot
Cost-effective task partial offloading and resource allocation for multi-vehicle and multi-MEC on B5G/6G edge networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.019openalex-snapshot
Threshold-based network structural dynamics
inferred← citeshttps://doi.org/10.1080/02564602.2020.1830001openalex-snapshot
Churn Handling Strategies to Support Dependable and Survivable Structured Overlay Networks
inferred← citeshttps://doi.org/10.1109/compsac69091.2026.00170openalex-snapshot
On the Robustness of Traveling Networks: Quantifying Operability, Observability, and Controllability and Designing Self-Healing Mechanisms
inferred← citeshttps://doi.org/10.1109/elecs55825.2022.00010openalex-snapshot
Safety and Observibility of Distributed Broadcast Algorithms
inferred← citeshttps://doi.org/10.1109/iccae56788.2023.10111474openalex-snapshot
Fault-Tolerant Broadcast Algorithm for Tree Networks
inferred← citeshttps://doi.org/10.1109/pepsc58749.2023.10395370openalex-snapshot
A Lightweight Blockchain-Based Cooperative Demand Response and Energy Trading Model for Smart Grid
inferred← citeshttps://doi.org/10.1145/3465084.3467932openalex-snapshot
Time-Optimal Construction of Overlay Networks
inferred← citeshttps://doi.org/10.1145/3544585.3544592openalex-snapshot
Origin of Self-Stabilization
inferred← citeshttps://doi.org/10.2139/ssrn.5343469openalex-snapshot
Enhancing Central Bank Digital Currencies in Europe: Assessing the Potential Benefits of Overlay Networks Built on Distributed Ledger Technology -An Empirical Study
inferred← citeshttps://doi.org/10.2339/politeknik.823124openalex-snapshot
A Novel Hypercube-based Approach to Overlay Design Algorithms on Topic Distribution Networks
inferred← citeshttps://doi.org/10.3389/fcomp.2026.1717711openalex-snapshot
Algorithmic self-repair: frontiers in fault-tolerant computation
inferred← citeshttps://doi.org/10.4230/lipics.sand.2022.12openalex-snapshot
Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems
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.