Cited in
(only showing first 100 items - show all)- MAAN: A multi-attribute addressable network for grid information services
- Building self-stabilizing overlay networks with the transitive closure framework
- Simulation-based study of botnets and defense mechanisms against them
- A randomized algorithm for the joining protocol in dynamic distributed networks
- Tiara: a self-stabilizing deterministic skip list and skip graph
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Stabilizing mobile philosophers
- ABS-NET: fully decentralized runtime adaptation for distributed objects
- HalftimeHash: modern hashing without 64-bit multipliers or finite fields
- Implementing set objects in dynamic distributed systems
- D2B: A de Bruijn based content-addressable network
- A decentralized algorithm for spectral analysis
- A Computing Resource Discovery Mechanism over a P2P Tree Topology
- Deterministic SkipNet
- \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
- Distributed computation and reconfiguration in actively dynamic networks
- A fair, secure and trustworthy peer-to-Peer based cycle-sharing system
- A decentralized computational infrastructure for Grid-based parallel asynchronous iterative applications
- Kosha: A peer-to-peer enhancement for the network file system
- Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
- Uniformity of direct unions of Chord
- A deterministic worst-case message complexity optimal solution for resource discovery
- Navigation in spatial networks: a survey
- Flood search under the California split rule.
- Choosing a random peer in Chord
- Araneola: a scalable reliable multicast system for dynamic environments
- Squid: enabling search in DHT-based systems
- A note on the parallel runtime of self-stabilizing graph linearization
- Robust random number generation for peer-to-peer systems
- On character-based index schemes for complex wildcard search in peer-to-peer networks
- Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
- Resource Burning for Permissionless Systems (Invited Paper)
- Sharing resources in a P2P network with artificial ants
- HyperTree for self-stabilizing peer-to-peer systems
- Proving properties of the Chord protocol using the ASM formalism
- Towards a scalable and robust DHT
- Scalable and dynamic quorum systems
- Load balanced distributed directories
- SOMA-E: self-organized mesh authentication -- extended
- Estimating network size from local information
- The design of a reliable reputation system
- On the OBDD representation of some graph classes
- Scalable percolation search on complex networks
- Multidimensional data querying on tree-structured overlay
- Decentralized grid resource discovery based on resource information community
- Load balancing in peer-to-peer systems using a diffusive approach
- Merging ring-structured overlay indices: toward network-data transparency
- Distributed discovery of frequent subgraphs of a network using MapReduce
- SFCGen
- DISCOVER
- NINJA
- PUNCH
- SCRIBE
- BRITE
- OMNet++
- GMAC
- HOCL
- Agapia
- XMPP
- 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
- Compact roundtrip routing with topology-independent node names
- PlanetLab
- Rappel
- TAG
- BotDigger
- Bigtable
- Dynamo
- SEQUEL
- TelegraphCQ
- Anthill
- FRAUDAR
- AmoebotSim
- ABS-NET
- KryoNet
- Narses
- PeerSim
- Vivaldi
- The price of validity in dynamic networks
- Concurrent maintenance of rings
This page was built for software: Chord
