scientific article; zbMATH DE number 1559581

MaRDI QIDQ4527033zbMATH OpenFDO

Authors Eric Lehman, Tom Leighton, Matthew S. Levine, Rina Panigrahy, David R. Karger, D. Lewin

Publication date 1 March 2001

zbMATH Keywords

caching protocolsdistributed networks

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 1887342
• Consistent load balancing via spread minimization
• Balanced-Replication Algorithms for Distribution Trees
• scientific article; zbMATH DE number 1947401
• scientific article; zbMATH DE number 1305451

Cited in

(27)

• Robust random number generation for peer-to-peer systems
• Min-wise independent permutations
• Proving properties of the Chord protocol using the ASM formalism
• Performance aspects of distributed caches using TTL-based consistency
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
• Cache me if you can: capacitated selfish replication games in networks
• Optimal inter-object correlation when replicating for availability
• Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks
• Load balancing in distributed web caching
• Performance Modeling of a Distributed Web Crawler Using Stochastic Activity Networks
• Balls into bins with related random choices
• Randomized load balancing by joining and splitting bins
• Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks
• scientific article; zbMATH DE number 1947401 (Why is no real title available?)
• A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
• Balanced-Replication Algorithms for Distribution Trees
• scientific article; zbMATH DE number 1563190 (Why is no real title available?)
• scientific article; zbMATH DE number 1887342 (Why is no real title available?)
• Re-Chord: a self-stabilizing chord overlay network
• Round-hashing for data storage: distributed servers and external-memory tables
• Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
• HD tree: A novel data structure to support multi-dimensional range query for P2P networks
• Echo: a peer-to-peer clustering framework for improving communication in DHTs
• Towards a scalable and robust DHT
• Degree-optimal routing for P2P systems
• Exploiting user metadata for energy-aware node allocation in a cloud storage system
• Balls into non-uniform bins

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527033)