Chord

swMATH9434MaRDI QIDQ21417FDOQ21417

Author name not available (Why is that?)

Official website: http://dl.acm.org/citation.cfm?id=383071

Cited In (only showing first 100 items - show all)

• Building self-stabilizing overlay networks with the transitive closure framework
• Simulation-based study of botnets and defense mechanisms against them
• Tiara: a self-stabilizing deterministic skip list and skip graph
• ABS-NET: fully decentralized runtime adaptation for distributed objects
• Stabilizing mobile philosophers
• Implementing set objects in dynamic distributed systems
• A decentralized algorithm for spectral analysis
• D2B: A de Bruijn based content-addressable network
• Deterministic SkipNet
• Araneola: a scalable reliable multicast system for dynamic environments
• Squid: enabling search in DHT-based systems
• Robust random number generation for peer-to-peer systems
• HyperTree for self-stabilizing peer-to-peer systems
• Scalable and dynamic quorum systems
• Estimating network size from local information
• The design of a reliable reputation system
• On the OBDD representation of some graph classes
• Load balancing in peer-to-peer systems using a diffusive approach
• Merging ring-structured overlay indices: toward network-data transparency
• Optimal inter-object correlation when replicating for availability
• Concurrent maintenance of rings
• The price of validity in dynamic networks
• SFCGen
• BRITE
• 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
• PlanetLab
• Rappel
• TAG
• BotDigger
• Bigtable
• Dynamo
• SEQUEL
• TelegraphCQ
• Anthill
• FRAUDAR
• GMAC: an overlay multicast network for mobile agent platforms
• The expansion and mixing time of skip graphs with applications
• Probabilistic quorums for dynamic systems
• AmoebotSim
• ABS-NET
• KryoNet
• Narses
• PeerSim
• Vivaldi
• Re-Chord: a self-stabilizing chord overlay network
• Top-\(k\) vectorial aggregation queries in a distributed environment
• 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
• Virtual and Dynamic Hierarchical Architecture: an overlay network topology for discovering grid services with high performance
• \(D^2\)-tree: a new overlay with deterministic bounds
• Reducing communication costs in robust peer-to-peer networks
• Practical load balancing for content requests in peer-to-peer networks
• MAAN: A multi-attribute addressable network for grid information services
• A randomized algorithm for the joining protocol in dynamic distributed networks
• Casper*
• HalftimeHash: modern hashing without 64-bit multipliers or finite fields
• A Computing Resource Discovery Mechanism over a P2P Tree Topology
• \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
• Distributed computation and reconfiguration in actively dynamic networks
• Uniformity of direct unions of Chord
• A deterministic worst-case message complexity optimal solution for resource discovery
• 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
• Navigation in spatial networks: a survey
• Choosing a random peer in Chord
• Flood search under the California split rule.
• A note on the parallel runtime of self-stabilizing graph linearization
• Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
• Resource Burning for Permissionless Systems (Invited Paper)
• On character-based index schemes for complex wildcard search in peer-to-peer networks

This page was built for software: Chord