Chord

swMATH9434MaRDI QIDQ21417

No author found.

Related Items (88)

Distributed computation and reconfiguration in actively dynamic networks ⋮ Implementing set objects in dynamic distributed systems ⋮ HalftimeHash: modern hashing without 64-bit multipliers or finite fields ⋮ Scalable percolation search on complex networks ⋮ D2B: A de Bruijn based content-addressable network ⋮ Multidimensional data querying on tree-structured overlay ⋮ Load balanced distributed directories ⋮ Practical load balancing for content requests in peer-to-peer networks ⋮ D 3-Tree: A Dynamic Deterministic Decentralized Structure ⋮ Optimal inter-object correlation when replicating for availability ⋮ The expansion and mixing time of skip graphs with applications ⋮ On the OBDD representation of some graph classes ⋮ Kosha: A peer-to-peer enhancement for the network file system ⋮ A fair, secure and trustworthy peer-to-Peer based cycle-sharing system ⋮ A decentralized computational infrastructure for Grid-based parallel asynchronous iterative applications ⋮ Generating effective symmetry-breaking predicates for search problems ⋮ Deterministic SkipNet ⋮ 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 ⋮ The price of validity in dynamic networks ⋮ The design of a reliable reputation system ⋮ Building self-stabilizing overlay networks with the transitive closure framework ⋮ Simulation-based study of botnets and defense mechanisms against them ⋮ Distributed discovery of frequent subgraphs of a network using MapReduce ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Unnamed Item ⋮ Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ Top-\(k\) vectorial aggregation queries in a distributed environment ⋮ Squid: enabling search in DHT-based systems ⋮ GMAC: an overlay multicast network for mobile agent platforms ⋮ Araneola: a scalable reliable multicast system for dynamic environments ⋮ Bankrupting Sybil despite churn ⋮ Probabilistic quorums for dynamic systems ⋮ Concurrent maintenance of rings ⋮ HyperTree for self-stabilizing peer-to-peer systems ⋮ Load balancing in peer-to-peer systems using a diffusive approach ⋮ Merging ring-structured overlay indices: toward network-data transparency ⋮ Flood search under the California split rule. ⋮ Adaptive Virtual Organisms: A Compositional Model for Complex Hardware-software Binding*,† ⋮ Re-Chord: a self-stabilizing chord overlay network ⋮ PercolationNET: A multi-tree P2P overlay network supporting high coverage search ⋮ SCDN: stable content distribution network based on demands ⋮ Maintaining the Ranch topology ⋮ Designing an effective P2P system for a VoD system to exploit the multicast communication ⋮ Enabling dynamic querying over distributed hash tables ⋮ Analysis of randomized protocols for conflict-free distributed access ⋮ Choosing a random peer in Chord ⋮ \(D^2\)-tree: a new overlay with deterministic bounds ⋮ Sharing resources in a P2P network with artificial ants ⋮ A randomized algorithm for the joining protocol in dynamic distributed networks ⋮ Compact roundtrip routing with topology-independent node names ⋮ Proving properties of the Chord protocol using the ASM formalism ⋮ Reducing communication costs in robust peer-to-peer networks ⋮ A note on the parallel runtime of self-stabilizing graph linearization ⋮ SOMA-E: self-organized mesh authentication -- extended ⋮ Routing complexity of faulty networks ⋮ MAAN: A multi-attribute addressable network for grid information services ⋮ Resilience and reliability analysis of P2P network systems ⋮ Decentralized grid resource discovery based on resource information community ⋮ Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs ⋮ Some new large (Δ, 3)‐graphs ⋮ Navigation in spatial networks: a survey ⋮ On character-based index schemes for complex wildcard search in peer-to-peer networks ⋮ Security and trust for wireless autonomic networks. Systems and control methods ⋮ Scalable and dynamic quorum systems ⋮ Towards a scalable and robust DHT ⋮ Robust random number generation for peer-to-peer systems ⋮ The IoT gateway with active queue management ⋮ Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems ⋮ A Computing Resource Discovery Mechanism over a P2P Tree Topology ⋮ A decentralized algorithm for spectral analysis ⋮ Optimization of a peer-to-peer system for efficient content replication ⋮ Free-riders impact on throughputs of peer-to-peer file-sharing systems ⋮ Estimating network size from local information ⋮ The Analysis of Kademlia for Random IDs ⋮ Virtual and Dynamic Hierarchical Architecture: an overlay network topology for discovering grid services with high performance ⋮ A Distributed Collaborative Filtering Recommendation Model for P2P Networks ⋮ Using Epidemic Hoarding to Minimize Load Delays in P2P Distributed Virtual Environments ⋮ Stabilizing mobile philosophers ⋮ SKIP ⁺ ⋮ Close to optimal decentralized routing in long-range contact networks ⋮ Uniformity of direct unions of Chord ⋮ A deterministic worst-case message complexity optimal solution for resource discovery ⋮ A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery ⋮ Analysis of the Blockchain Protocol in Asynchronous Networks

This page was built for software: Chord