Dynamic load balancing in Peer-to-Peer networks / by Miroslaw Korzeniowski. 2005
Inhalt
- Introduction
- Load Balancing in Distributed Hash Tables
- Introduction to Load Balancing
- Our results and organization of the first part
- Other work on load balancing
- Uniform distribution of nodes on the ring
- Approximating the Current Number of Nodes
- Self Stabilizing Load Balancing
- Bounding The Communication Cost
- Transparent Data Structures
- Introduction to Transparent Data Structures
- Our contribution and organization of the second part
- Linear addressable memory model in a distributed environment
- Pointer model in a distributed environment
- Transparent memory models
- Other work on search structures
- Hypertree Memory Model
- A family of graphs for the hypertree model
- Dynamic graphs for the hypertree model
- Joining and leaving the dynamic de Bruijn cube
- Robustness
- Search Tree
- Summary and Outlook
- Bibliography