Cited in
(only showing first 100 items - show all)- Implementing set objects in dynamic distributed systems
- \(D^2\)-tree: a new overlay with deterministic bounds
- A decentralized algorithm for spectral analysis
- Building self-stabilizing overlay networks with the transitive closure framework
- Simulation-based study of botnets and defense mechanisms against them
- The expansion and mixing time of skip graphs with applications
- Araneola: a scalable reliable multicast system for dynamic environments
- Squid: enabling search in DHT-based systems
- Estimating network size from local information
- Probabilistic quorums for dynamic systems
- Robust random number generation for peer-to-peer systems
- Scalable and dynamic quorum systems
- Tiara: a self-stabilizing deterministic skip list and skip graph
- Optimal inter-object correlation when replicating for availability
- Finding and evaluating the community structure in semantic peer-to-peer overlay networks
- Survey of DHT topology construction techniques in virtual computing environments
- PopCap: popularity oriented proxy caching for peer-assisted Internet video-on-demand streaming services
- Psu: a novel low-latency constant-degree overlay network
- Markov chains competing for transitions: application to large-scale distributed systems
- Deterministic SkipNet
- Practical load balancing for content requests in peer-to-peer networks
- Virtual and Dynamic Hierarchical Architecture: an overlay network topology for discovering grid services with high performance
- Concurrent maintenance of rings
- GMAC: an overlay multicast network for mobile agent platforms
- SFCGen
- DISCOVER
- NINJA
- PUNCH
- SCRIBE
- BRITE
- OMNet++
- GMAC
- HOCL
- Agapia
- XMPP
- HyperTree for self-stabilizing peer-to-peer systems
- SimJava
- VON
- CometG
- JXTA
- Satin
- BATON
- Squid
- LIME
- Linda
- Globus Toolkit
- SipHash
- SSim
- Lemur
- Cassandra
- EpiChord
- ns-2
- Pastry
- ANF
- Java Grande
- Network Simulator 2
- BOINC
- PATRICIA
- PlanetLab
- Rappel
- TAG
- BotDigger
- Bigtable
- Dynamo
- SEQUEL
- TelegraphCQ
- Anthill
- FRAUDAR
- AmoebotSim
- ABS-NET
- KryoNet
- Narses
- PeerSim
- Vivaldi
- D2B: A de Bruijn based content-addressable network
- ABS-NET: fully decentralized runtime adaptation for distributed objects
- On the OBDD representation of some graph classes
- The price of validity in dynamic networks
- MAAN: A multi-attribute addressable network for grid information services
- Re-Chord: a self-stabilizing chord overlay network
- Load balancing in peer-to-peer systems using a diffusive approach
- Merging ring-structured overlay indices: toward network-data transparency
- Stabilizing mobile philosophers
- The analysis of Kademlia for random IDs
- A note on the parallel runtime of self-stabilizing graph linearization
- Casper*
- Distributed computation and reconfiguration in actively dynamic networks
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
- Some new large (Δ, 3)‐graphs
- Load balanced distributed directories
- A randomized algorithm for the joining protocol in dynamic distributed networks
- Analysis of randomized protocols for conflict-free distributed access
- Decentralized grid resource discovery based on resource information community
- The IoT gateway with active queue management
- Distributed discovery of frequent subgraphs of a network using MapReduce
- HalftimeHash: modern hashing without 64-bit multipliers or finite fields
- Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
- Generating effective symmetry-breaking predicates for search problems
- Sharing resources in a P2P network with artificial ants
- Adaptive virtual organisms: a compositional model for complex hardware-software binding
This page was built for software: Chord
