### 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 language | English |
---|---|

Title of host publication | IEEE Global Telecommunications Conference and Exhibition |

Publisher | Publ by IEEE |

Pages | 1701-1705 |

Number of pages | 5 |

ISBN (Print) | 0879426977 |

Publication status | Published - 1 Dec 1991 |

Event | IEEE Global Telecommunications Conference - GLOBECOM '91 Part 3 (of 3) - Phoenix, AZ, USA Duration: 2 Dec 1991 → 5 Dec 1991 |

### Publication series

Name | IEEE Global Telecommunications Conference and Exhibition |
---|---|

Volume | 3 |

### Other

Other | IEEE Global Telecommunications Conference - GLOBECOM '91 Part 3 (of 3) |
---|---|

City | Phoenix, AZ, USA |

Period | 2/12/91 → 5/12/91 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*IEEE Global Telecommunications Conference and Exhibition*(pp. 1701-1705). (IEEE Global Telecommunications Conference and Exhibition; Vol. 3). Publ by IEEE.