Load Balancing in Peer-to-Peer Data Networks
| Authors | |
|---|---|
| Year of publication | 2006 |
| Type | Article in Proceedings |
| Conference | MEMICS 2006, 2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science |
| MU Faculty or unit | |
| Citation | |
| web | |
| Field | Informatics |
| Keywords | peer-to-peer; load-balancing; similarity search |
| Description | One of the issues considered in all Peer-to-Peer Data Networks, or Structured Overlays, is keeping a fair load distribution among the nodes participating in the network. Whilst this issue is well defined and basically solved for systems with relatively simple search paradigms, none of the existing solutions is appropriate nor applicable for similarity search networks. We suggest a new general solution of the load-balancing problem in P2P Data Networks, which is especially suitable for systems with time-consuming search operations. The framework proposed analyzes the source of the load precisely to choose right balancing action. |
| Related projects: |