A parallel textured algorithm for optimal routing in data networks

Garng M. Huang, Wen Lin Hsieh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

A textured decomposition-based algorithm is developed to solve the optimal routing problem in data networks. The idea of the algorithm is to decompose the large-scale network into several smaller-scale subnetworks; then these subnetworks are organized systematically into several levels. Each level contains mutually independent subnetworks. When the external flows to a level are frozen, one can concurrently compute the optimal solution of the subnetworks at the level. The proposed parallel-oriented algorithm will converge to the global optimal solution when some conditions are satisfied. The authors use a few examples to illustrate the convergence conditions of the textured algorithm. A numerical example to demonstrate the potential speedup of the algorithm is also provided.

Original languageEnglish
Title of host publicationIEEE Global Telecommunications Conference and Exhibition
PublisherPubl by IEEE
Pages1701-1705
Number of pages5
ISBN (Print)0879426977
Publication statusPublished - 1 Dec 1991
EventIEEE Global Telecommunications Conference - GLOBECOM '91 Part 3 (of 3) - Phoenix, AZ, USA
Duration: 2 Dec 19915 Dec 1991

Publication series

NameIEEE Global Telecommunications Conference and Exhibition
Volume3

Other

OtherIEEE Global Telecommunications Conference - GLOBECOM '91 Part 3 (of 3)
CityPhoenix, AZ, USA
Period2/12/915/12/91

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Huang, G. M., & Hsieh, W. L. (1991). A parallel textured algorithm for optimal routing in data networks. In IEEE Global Telecommunications Conference and Exhibition (pp. 1701-1705). (IEEE Global Telecommunications Conference and Exhibition; Vol. 3). Publ by IEEE.