Performance of global load balancing by local adjustment
From MaRDI portal
Publication:3204318
DOI10.1109/18.59935zbMath0716.90065OpenAlexW2166136432MaRDI QIDQ3204318
Publication date: 1990
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b6110ebb9105ef529d0cea8fc7fd8c0b37a60eee
Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (9)
Load balancing in hypergraphs ⋮ Sandwiching a densest subgraph by consecutive cores ⋮ Balanced loads in infinite networks ⋮ Matching recovery threshold for correlated random graphs ⋮ Belief propagation for optimal edge cover in the random complete graph ⋮ The Effect of Increasing Routing Choice on Resource Pooling ⋮ Topological price of anarchy bounds for clustering games on networks ⋮ On large deviations in load sharing networks ⋮ The densest subgraph problem in sparse random graphs
This page was built for publication: Performance of global load balancing by local adjustment