Novel architectures for P2P applications: the continuous-discrete approach
From MaRDI portal
(Redirected from Publication:3580946)
Recommendations
- Routing networks for distributed hash tables
- Fault-tolerant routing in peer-to-peer systems
- Locality in structured peer-to-peer networks
- Structured peer-to-peer systems. Fundamentals of hierarchical organization, routing, scaling, and security. Foreword by Ion Stoica.
- LAND: stretch \((1 + {\epsilon})\) locality-aware networks for DHTs
Cited in
(24)- Robust overlays meet blockchains: on handling high churn and catastrophic failures
- Multiple choice tries and distributed hash tables
- Degree-optimal routing for P2P systems
- D2B: A de Bruijn based content-addressable network
- \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
- Uniformity of direct unions of Chord
- A deterministic worst-case message complexity optimal solution for resource discovery
- Robust random number generation for peer-to-peer systems
- Euro-Par 2004 Parallel Processing
- Resource Burning for Permissionless Systems (Invited Paper)
- Towards a scalable and robust DHT
- Towards worst-case churn resistant peer-to-peer systems
- Scalable and dynamic quorum systems
- DEX: self-healing expanders
- Estimating network size from local information
- Routing networks for distributed hash tables
- LAND: stretch \((1 + {\epsilon})\) locality-aware networks for DHTs
- Probabilistic quorums for dynamic systems
- The expansion and mixing time of skip graphs with applications
- Re-Chord: a self-stabilizing chord overlay network
- Psu: a novel low-latency constant-degree overlay network
- Profiles of PATRICIA tries
- rDAN: toward robust demand-aware network designs
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
This page was built for publication: Novel architectures for P2P applications: the continuous-discrete approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580946)
