### Abstract

In this paper, a new distributed algorithm is proposed to solve optimal routing problems (ORPs) for large data network with multicommodities. Contrast to the existing algorithms for general network topology, which have parallel time complexity of O (MΦ^{2}) assuming that all the nodes of the network have a processor, our algorithm takes O (mΦ^{2}) time units using the same number of processors if some mild network conditions are met. Here, Φ is the diameter of the network; M is the number of commodities; m is a positive number usually much smaller than M. The exact value of m depends on the pattern of the OD pairs including the locations of origin nodes and destination nodes, and the flow demand of OD pairs. The implementation of the algorithm for a 200-node network is simulated using OPNET simulation tool and the results show that our algorithm is much faster than the general algorithms.

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

Pages (from-to) | 2097-2098 |

Number of pages | 2 |

Journal | Proceedings of the IEEE Conference on Decision and Control |

Volume | 3 |

Publication status | Published - 1 Dec 1994 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Control and Systems Engineering
- Modelling and Simulation
- Control and Optimization

### Cite this

*Proceedings of the IEEE Conference on Decision and Control*,

*3*, 2097-2098.

**Parallel optimal routing control by commodities for large data networks.** / Huang, Garng Morton; Zhu, Shan.

Research output: Contribution to journal › Conference article

*Proceedings of the IEEE Conference on Decision and Control*, vol. 3, pp. 2097-2098.

}

TY - JOUR

T1 - Parallel optimal routing control by commodities for large data networks

AU - Huang, Garng Morton

AU - Zhu, Shan

PY - 1994/12/1

Y1 - 1994/12/1

N2 - In this paper, a new distributed algorithm is proposed to solve optimal routing problems (ORPs) for large data network with multicommodities. Contrast to the existing algorithms for general network topology, which have parallel time complexity of O (MΦ2) assuming that all the nodes of the network have a processor, our algorithm takes O (mΦ2) time units using the same number of processors if some mild network conditions are met. Here, Φ is the diameter of the network; M is the number of commodities; m is a positive number usually much smaller than M. The exact value of m depends on the pattern of the OD pairs including the locations of origin nodes and destination nodes, and the flow demand of OD pairs. The implementation of the algorithm for a 200-node network is simulated using OPNET simulation tool and the results show that our algorithm is much faster than the general algorithms.

AB - In this paper, a new distributed algorithm is proposed to solve optimal routing problems (ORPs) for large data network with multicommodities. Contrast to the existing algorithms for general network topology, which have parallel time complexity of O (MΦ2) assuming that all the nodes of the network have a processor, our algorithm takes O (mΦ2) time units using the same number of processors if some mild network conditions are met. Here, Φ is the diameter of the network; M is the number of commodities; m is a positive number usually much smaller than M. The exact value of m depends on the pattern of the OD pairs including the locations of origin nodes and destination nodes, and the flow demand of OD pairs. The implementation of the algorithm for a 200-node network is simulated using OPNET simulation tool and the results show that our algorithm is much faster than the general algorithms.

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

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

M3 - Conference article

AN - SCOPUS:0028748928

VL - 3

SP - 2097

EP - 2098

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

SN - 0191-2216

ER -