Name
Abstract | ||
|---|---|---|
Circuit-based computation has contributed to designing efficient, highly-scalable, and reliable distributed control systems. As in load-balancing problems, uniform assignment of node weights is an important function in this domain. Intuitively, iterative computation for balancing workloads based on graph circuit structure seems to always converge to an optimal solution. However, no previous literature provides a proof that circuit-based computation for load balancing guarantees to average all the weights in a given mesh network topology. We therefore analyze the property of circuit-based computations for a node-weight equalization problem (NWEP) whose objective is making the average deviation of graph weights converge on zero. This paper provides a graph theory-based verification of circuit-based computations for NWEP, and a way to shorten the computation time required to solve the NWEP. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ISCAS.2013.6572392 | Circuits and Systems |
Keywords | Field | DocType |
graph theory,iterative methods,network analysis,network topology,NWEP,average deviation,circuit based computation,graph circuit structure,graph theory based verification,iterative computation,load balancing problem,mesh network topology,node weight equalization problem,reliable distributed control system | Graph theory,Mathematical optimization,Load balancing (computing),Computer science,Control theory,Iterative method,Route inspection problem,Algorithm,Graph bandwidth,Network analysis,Computation,Topology (electrical circuits) | Conference |
ISSN | ISBN | Citations |
0271-4302 | 978-1-4673-5760-9 | 2 |
PageRank | References | Authors |
0.49 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoichi Sakai | 1 | 2 | 0.49 |
| Kiyoshi Nakayama | 2 | 27 | 7.51 |
| Norihiko Shinomiya | 3 | 50 | 19.15 |