Distributed iterative aggregation algorithms for box-constrained minimization problems and optimal routing in data networks

Author

Tsai, Wei ; Huang, Garing ; Antonio, John K. ; Tsai, Wei T.

Author_Institution

Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA

Volume

34

Issue

1

fYear

1989

fDate

1/1/1989 12:00:00 AM

Firstpage

34

Lastpage

46

Abstract

A gradient-projection algorithm using iterative aggregation and disaggregation is proposed and analyzed for box-constrained minimization problems. In a distributed computation model, the algorithm is shown to converge. The algorithm is applied to optimal routing in a large interconnected data communication network, resulting in a multilevel hierarchical clustering that naturally fits the hierarchical topological structure of such networks. An implementation of the algorithm for a 52-node network shows that the serial version of the algorithm has a saving of 35% of the computational time as compared to a path-formulated gradient-projection code that is among the fastest existing programs for path-formulated optimal routing

Keywords

data communication systems; iterative methods; optimisation; switching theory; 52-node network; box-constrained minimization; data communication systems; data networks; disaggregation; gradient-projection algorithm; iterative aggregation; multilevel hierarchical clustering; optimal routing; optimisation; switching theory; Acceleration; Clustering algorithms; Computational modeling; Computer networks; Distributed computing; Iterative algorithms; Iterative methods; Large-scale systems; Minimization methods; Routing;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.8647

Filename

8647