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

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

Research output: Contribution to journalConference article

6 Citations (Scopus)

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 languageEnglish
Pages (from-to)1799-1804
Number of pages6
JournalProceedings of the American Control Conference
Volume88 pt 1-3
Publication statusPublished - 1 Dec 1988
Externally publishedYes

Fingerprint

Agglomeration
Telecommunication networks
Computer simulation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

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

In: Proceedings of the American Control Conference, Vol. 88 pt 1-3, 01.12.1988, p. 1799-1804.

Research output: Contribution to journalConference article

@article{7adb890a7219449f9f0a362bfc75539e,
title = "Distributed aggregation/disaggregation algorithms for optimal routing in data networks.",
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.",
author = "Tsai, {Wei K.} and Huang, {Garng Morton} and Antonio, {John K.} and Tsai, {Wei T.}",
year = "1988",
month = "12",
day = "1",
language = "English",
volume = "88 pt 1-3",
pages = "1799--1804",
journal = "Proceedings of the American Control Conference",
issn = "0743-1619",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

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 -