A parallel textured algorithm for optimal routing in data networks

Garng Morton 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
Volume3
ISBN (Print)0879426977
Publication statusPublished - 1 Dec 1991
Externally publishedYes
EventIEEE Global Telecommunications Conference - GLOBECOM '91 Part 3 (of 3) - Phoenix, AZ, USA
Duration: 2 Dec 19915 Dec 1991

Other

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

Fingerprint

Parallel algorithms
Decomposition

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 (Vol. 3, pp. 1701-1705). Publ by IEEE.

A parallel textured algorithm for optimal routing in data networks. / Huang, Garng Morton; Hsieh, Wen Lin.

IEEE Global Telecommunications Conference and Exhibition. Vol. 3 Publ by IEEE, 1991. p. 1701-1705.

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

Huang, GM & Hsieh, WL 1991, A parallel textured algorithm for optimal routing in data networks. in IEEE Global Telecommunications Conference and Exhibition. vol. 3, Publ by IEEE, pp. 1701-1705, IEEE Global Telecommunications Conference - GLOBECOM '91 Part 3 (of 3), Phoenix, AZ, USA, 2/12/91.
Huang GM, Hsieh WL. A parallel textured algorithm for optimal routing in data networks. In IEEE Global Telecommunications Conference and Exhibition. Vol. 3. Publ by IEEE. 1991. p. 1701-1705
Huang, Garng Morton ; Hsieh, Wen Lin. / A parallel textured algorithm for optimal routing in data networks. IEEE Global Telecommunications Conference and Exhibition. Vol. 3 Publ by IEEE, 1991. pp. 1701-1705
@inproceedings{1a0e4ce2ff754f51ab00368356c05ea3,
title = "A parallel textured algorithm for optimal routing in data networks",
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.",
author = "Huang, {Garng Morton} and Hsieh, {Wen Lin}",
year = "1991",
month = "12",
day = "1",
language = "English",
isbn = "0879426977",
volume = "3",
pages = "1701--1705",
booktitle = "IEEE Global Telecommunications Conference and Exhibition",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - A parallel textured algorithm for optimal routing in data networks

AU - Huang, Garng Morton

AU - Hsieh, Wen Lin

PY - 1991/12/1

Y1 - 1991/12/1

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

SN - 0879426977

VL - 3

SP - 1701

EP - 1705

BT - IEEE Global Telecommunications Conference and Exhibition

PB - Publ by IEEE

ER -