Pages that link to "Item:Q863188"
From MaRDI portal
The following pages link to Simple efficient load-balancing algorithms for peer-to-peer systems (Q863188):
Displaying 19 items.
- Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks (Q436777) (← links)
- Load balancing in peer-to-peer systems using a diffusive approach (Q455930) (← links)
- A novel robust on-line protocol for load-balancing in structured peer-to-peer systems (Q455942) (← links)
- \(D^2\)-tree: a new overlay with deterministic bounds (Q494810) (← links)
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents (Q633812) (← links)
- Efficient distributed computation of distance sketches in networks (Q748116) (← links)
- Ciss: an efficient object clustering framework for dht-based peer-to-peer applications (Q865680) (← links)
- A simple yet effective load balancing extension to the PVM software system (Q1391923) (← links)
- Self-stabilizing local \(k\)-placement of replicas with local minimum variance (Q2354401) (← links)
- Practical load balancing for content requests in peer-to-peer networks (Q2375306) (← links)
- Approaching neighbor proximity and load balance for range query in P2P networks (Q2426915) (← links)
- Choosing a random peer in Chord (Q2461543) (← links)
- Decentralized proportional load balancing (Q2790412) (← links)
- Multiple choice tries and distributed hash tables (Q3633017) (← links)
- Analysis of Simple Algorithms for Dynamic Load Balancing (Q4385164) (← links)
- Algorithms – ESA 2004 (Q5464608) (← links)
- Engineering Self-Organising Systems (Q5714006) (← links)
- Efficient schemes for nearest neighbor load balancing (Q5917954) (← links)
- Multiple random walks on graphs: mixing few to cover many (Q6085870) (← links)
