### Abstract

A gradient projection algorithm using iterative aggregation and disaggregation is proposd and analyzed for box-constrained minimization problems. In a variation of the distributed computation model, the algorithm is shown to converge. 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 fits naturally the hierarchical topological structure of large networks. A numerical simulation of a 52-node network shows that the serial version of the algorithm achieves 35% saving of computation time as compared to a path-formulated gradient projection code developed by D. P. Bertsekas, B. Gendron and W. K. Tsai (1984), which is among the fastest existing programs for path-formulated optimal routing.

Original language | English |
---|---|

Pages (from-to) | 1799-1804 |

Number of pages | 6 |

Journal | Proceedings of the American Control Conference |

Volume | 88 pt 1-3 |

Publication status | Published - 1 Dec 1988 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### Cite this

*Proceedings of the American Control Conference*,

*88 pt 1-3*, 1799-1804.

**Distributed aggregation/disaggregation algorithms for optimal routing in data networks.** / Tsai, Wei K.; Huang, Garng Morton; Antonio, John K.; Tsai, Wei T.

Research output: Contribution to journal › Conference article

*Proceedings of the American Control Conference*, vol. 88 pt 1-3, pp. 1799-1804.

}

TY - JOUR

T1 - Distributed aggregation/disaggregation algorithms for optimal routing in data networks.

AU - Tsai, Wei K.

AU - Huang, Garng Morton

AU - Antonio, John K.

AU - Tsai, Wei T.

PY - 1988/12/1

Y1 - 1988/12/1

N2 - A gradient projection algorithm using iterative aggregation and disaggregation is proposd and analyzed for box-constrained minimization problems. In a variation of the distributed computation model, the algorithm is shown to converge. 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 fits naturally the hierarchical topological structure of large networks. A numerical simulation of a 52-node network shows that the serial version of the algorithm achieves 35% saving of computation time as compared to a path-formulated gradient projection code developed by D. P. Bertsekas, B. Gendron and W. K. Tsai (1984), which is among the fastest existing programs for path-formulated optimal routing.

AB - A gradient projection algorithm using iterative aggregation and disaggregation is proposd and analyzed for box-constrained minimization problems. In a variation of the distributed computation model, the algorithm is shown to converge. 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 fits naturally the hierarchical topological structure of large networks. A numerical simulation of a 52-node network shows that the serial version of the algorithm achieves 35% saving of computation time as compared to a path-formulated gradient projection code developed by D. P. Bertsekas, B. Gendron and W. K. Tsai (1984), which is among the fastest existing programs for path-formulated optimal routing.

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

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

M3 - Conference article

VL - 88 pt 1-3

SP - 1799

EP - 1804

JO - Proceedings of the American Control Conference

JF - Proceedings of the American Control Conference

SN - 0743-1619

ER -