scientific article; zbMATH DE number 2079362
From MaRDI portal
Publication:4471321
zbMath1094.68545MaRDI QIDQ4471321
Publication date: 28 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Distributed systems (68M14)
Related Items
Degree-optimal routing for P2P systems ⋮ The expansion and mixing time of skip graphs with applications ⋮ Fair priority scheduling (FPS): a process scheduling algorithm based on skip ring data structure ⋮ Deterministic SkipNet ⋮ Building self-stabilizing overlay networks with the transitive closure framework ⋮ Corona: a stabilizing deterministic message-passing skip list ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Time-optimal construction of overlay networks ⋮ Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ HD tree: A novel data structure to support multi-dimensional range query for P2P networks ⋮ Concurrent maintenance of rings ⋮ Re-Chord: a self-stabilizing chord overlay network ⋮ \(D^2\)-tree: a new overlay with deterministic bounds ⋮ Reliable Resource Searching in P2P Networks ⋮ A note on the parallel runtime of self-stabilizing graph linearization ⋮ Routing complexity of faulty networks ⋮ Towards a universal approach for the finite departure problem in overlay networks ⋮ Towards a scalable and robust DHT ⋮ Robust random number generation for peer-to-peer systems ⋮ Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems ⋮ Investigating the existence and the regularity of logarithmic Harary graphs ⋮ Strategies for peer-to-peer downloading ⋮ SKIP + ⋮ A deterministic worst-case message complexity optimal solution for resource discovery ⋮ A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery ⋮ Distributed agreement in dynamic peer-to-peer networks
