A Decomposition Algorithm for Optimal Load Balancing in Tree Hierarchy Networks

概要

論文の詳細を見る
We study the static load balancing problem in a computer network with the tree hierarchy configuration. It is formulated as a nonlinear optimization problem. After studying the optimal solution to the tree hierarchy network optimization problem, we demonstrate that the special structure of the optimization problem leads to an interesting decomposition technique. A new decomposition algorithm to solve the optimization problem is presented. The proposed algorithm is compared to two other well known algorithms, the FD algorithm and the D-S (Dafermos-Sparrow) algorithm .It is shown that the proposed algorithm has good performance both on the storage requirements and the computational time requirements.
一般社団法人情報処理学会の論文
1991-02-25