Distributed Iterative Aggregation Algorithms for Box-Constrained Minimization Problems and Optimal Routing in Data Networks

Wei K. Tsai, Garng Morton Huang, John K. Antonio

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

A new 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. As an important application, we also show how the algorithm is applied to optimal routing in a large interconnected data communication network. The aggregation/disaggregation method proposed results in a multilevel hierarchical clustering of a large network, which naturally fits the hierarchical topological structure of large networks. An implementation of the algorithm for a 52-node network shows that the serial version of the algorithm has a savings of 35 percent of the computational time as compared to a path-formulated gradient projection code developed by Bertsekas, Gendron, and Tsai, which is among the fastest existing programs for path-formulated optimal routing.

Original languageEnglish
Pages (from-to)34-46
Number of pages13
JournalIEEE Transactions on Automatic Control
Volume34
Issue number1
DOIs
Publication statusPublished - 1 Jan 1989
Externally publishedYes

Fingerprint

Agglomeration
Telecommunication networks

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Distributed Iterative Aggregation Algorithms for Box-Constrained Minimization Problems and Optimal Routing in Data Networks. / Tsai, Wei K.; Huang, Garng Morton; Antonio, John K.

In: IEEE Transactions on Automatic Control, Vol. 34, No. 1, 01.01.1989, p. 34-46.

Research output: Contribution to journalArticle

@article{e17c250a5733414e97ec4da4c903af06,
title = "Distributed Iterative Aggregation Algorithms for Box-Constrained Minimization Problems and Optimal Routing in Data Networks",
abstract = "A new 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. As an important application, we also show how the algorithm is applied to optimal routing in a large interconnected data communication network. The aggregation/disaggregation method proposed results in a multilevel hierarchical clustering of a large network, which naturally fits the hierarchical topological structure of large networks. An implementation of the algorithm for a 52-node network shows that the serial version of the algorithm has a savings of 35 percent of the computational time as compared to a path-formulated gradient projection code developed by Bertsekas, Gendron, and Tsai, which is among the fastest existing programs for path-formulated optimal routing.",
author = "Tsai, {Wei K.} and Huang, {Garng Morton} and Antonio, {John K.}",
year = "1989",
month = "1",
day = "1",
doi = "10.1109/9.8647",
language = "English",
volume = "34",
pages = "34--46",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Distributed Iterative Aggregation Algorithms for Box-Constrained Minimization Problems and Optimal Routing in Data Networks

AU - Tsai, Wei K.

AU - Huang, Garng Morton

AU - Antonio, John K.

PY - 1989/1/1

Y1 - 1989/1/1

N2 - A new 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. As an important application, we also show how the algorithm is applied to optimal routing in a large interconnected data communication network. The aggregation/disaggregation method proposed results in a multilevel hierarchical clustering of a large network, which naturally fits the hierarchical topological structure of large networks. An implementation of the algorithm for a 52-node network shows that the serial version of the algorithm has a savings of 35 percent of the computational time as compared to a path-formulated gradient projection code developed by Bertsekas, Gendron, and Tsai, which is among the fastest existing programs for path-formulated optimal routing.

AB - A new 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. As an important application, we also show how the algorithm is applied to optimal routing in a large interconnected data communication network. The aggregation/disaggregation method proposed results in a multilevel hierarchical clustering of a large network, which naturally fits the hierarchical topological structure of large networks. An implementation of the algorithm for a 52-node network shows that the serial version of the algorithm has a savings of 35 percent of the computational time as compared to a path-formulated gradient projection code developed by Bertsekas, Gendron, and Tsai, which is among the fastest existing programs for path-formulated optimal routing.

UR - http://www.scopus.com/inward/record.url?scp=0024478864&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024478864&partnerID=8YFLogxK

U2 - 10.1109/9.8647

DO - 10.1109/9.8647

M3 - Article

VL - 34

SP - 34

EP - 46

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 1

ER -