Load balancing in peer-to-peer systems using a diffusive approach (Q455930): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
A load balancing algorithm for peer-to-peer system is introduced. The objective is to equalize the available capacities of the system nodes such that they will have similar mean response times. The basic technique is the diffusive load balancing used in parallel computing system that is adapted for peer-to-peer systems. Each node collects the loads of its neighbors in the overlay network and decides the load transfers, without the need of extra connections between nodes or messages on random walkers in the system. A particular attention is given to the effect of the size of the services. The proposed algorithm converges faster for small-sized services than in the case of large-size services. Moreover it is proved that the impact of the churn rate on the bound of the standard deviation of the available capacities is larger than the impact of the sizes of services. | |||
Property / review text: A load balancing algorithm for peer-to-peer system is introduced. The objective is to equalize the available capacities of the system nodes such that they will have similar mean response times. The basic technique is the diffusive load balancing used in parallel computing system that is adapted for peer-to-peer systems. Each node collects the loads of its neighbors in the overlay network and decides the load transfers, without the need of extra connections between nodes or messages on random walkers in the system. A particular attention is given to the effect of the size of the services. The proposed algorithm converges faster for small-sized services than in the case of large-size services. Moreover it is proved that the impact of the churn rate on the bound of the standard deviation of the available capacities is larger than the impact of the sizes of services. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Dana Petcu / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M14 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6097709 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
load balancing | |||
Property / zbMATH Keywords: load balancing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
peer-to-peer system | |||
Property / zbMATH Keywords: peer-to-peer system / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
diffusion | |||
Property / zbMATH Keywords: diffusion / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
overlay network | |||
Property / zbMATH Keywords: overlay network / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: BATON / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Chord / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: SSim / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00607-012-0196-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1999144075 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The convergence of realistic distributed load-balancing algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simple efficient load-balancing algorithms for peer-to-peer systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4843091 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An asynchronous and iterative load balancing algorithm for discrete load model. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Load balancing in peer-to-peer systems using a diffusive approach / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:58, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Load balancing in peer-to-peer systems using a diffusive approach |
scientific article |
Statements
Load balancing in peer-to-peer systems using a diffusive approach (English)
0 references
23 October 2012
0 references
A load balancing algorithm for peer-to-peer system is introduced. The objective is to equalize the available capacities of the system nodes such that they will have similar mean response times. The basic technique is the diffusive load balancing used in parallel computing system that is adapted for peer-to-peer systems. Each node collects the loads of its neighbors in the overlay network and decides the load transfers, without the need of extra connections between nodes or messages on random walkers in the system. A particular attention is given to the effect of the size of the services. The proposed algorithm converges faster for small-sized services than in the case of large-size services. Moreover it is proved that the impact of the churn rate on the bound of the standard deviation of the available capacities is larger than the impact of the sizes of services.
0 references
load balancing
0 references
peer-to-peer system
0 references
diffusion
0 references
overlay network
0 references