Chord

swMATH9434MaRDI QIDQ21417FDOQ21417

Author name not available (Why is that?)

Cited In (88)

• A randomized algorithm for the joining protocol in dynamic distributed networks
• 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
• Stabilizing mobile philosophers
• HalftimeHash: modern hashing without 64-bit multipliers or finite fields
• Implementing set objects in dynamic distributed systems
• A decentralized algorithm for spectral analysis
• D2B: A de Bruijn based content-addressable network
• Deterministic SkipNet
• 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
• Routing complexity of faulty networks
• Navigation in spatial networks: a survey
• Flood search under the California split rule.
• 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
• On character-based index schemes for complex wildcard search in peer-to-peer networks
• HyperTree for self-stabilizing peer-to-peer systems
• Scalable and dynamic quorum systems
• Towards a scalable and robust DHT
• 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
• Distributed discovery of frequent subgraphs of a network using MapReduce
• Optimal inter-object correlation when replicating for availability
• Concurrent maintenance of rings
• The price of validity in dynamic networks
• Generating effective symmetry-breaking predicates for search problems
• Optimization of a peer-to-peer system for efficient content replication
• Free-riders impact on throughputs of peer-to-peer file-sharing systems
• GMAC: an overlay multicast network for mobile agent platforms
• The expansion and mixing time of skip graphs with applications
• Probabilistic quorums for dynamic systems
• Title not available (Why is that?)
• Re-Chord: a self-stabilizing chord overlay network
• Top-\(k\) vectorial aggregation queries in a distributed environment
• Analysis of randomized protocols for conflict-free distributed access
• 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
• Designing an effective P2P system for a VoD system to exploit the multicast communication
• Enabling dynamic querying over distributed hash tables
• Maintaining the Ranch topology
• SCDN: stable content distribution network based on demands
• Close to optimal decentralized routing in long-range contact networks
• Analysis of the Blockchain Protocol in Asynchronous Networks
• MAAN: A multi-attribute addressable network for grid information services
• D 3-Tree: A Dynamic Deterministic Decentralized Structure
• A Computing Resource Discovery Mechanism over a P2P Tree Topology
• The Analysis of Kademlia for Random IDs
• 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
• Choosing a random peer in Chord
• A note on the parallel runtime of self-stabilizing graph linearization
• Resource Burning for Permissionless Systems (Invited Paper)
• Sharing resources in a P2P network with artificial ants
• Adaptive Virtual Organisms: A Compositional Model for Complex Hardware-software Binding*,†
• Proving properties of the Chord protocol using the ASM formalism
• Load balanced distributed directories
• SOMA-E: self-organized mesh authentication -- extended
• Scalable percolation search on complex networks
• Multidimensional data querying on tree-structured overlay
• Decentralized grid resource discovery based on resource information community
• Compact roundtrip routing with topology-independent node names
• The IoT gateway with active queue management
• Resilience and reliability analysis of P2P network systems
• Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
• PercolationNET: A multi-tree P2P overlay network supporting high coverage search
• Security and trust for wireless autonomic networks. Systems and control methods
• Some new large (Δ, 3)‐graphs
• A Distributed Collaborative Filtering Recommendation Model for P2P Networks
• Using Epidemic Hoarding to Minimize Load Delays in P2P Distributed Virtual Environments
• Bankrupting Sybil despite churn
• SKIP ⁺
• A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery

This page was built for software: Chord