### Abstract

In this paper, a new distributed algorithm is investigated for optimal routing problems of large data network with multicommodities. The existing algorithms for general network topology have parallel time complexity of at least O(MΦ^{2}) using all the nodes of the network as processors. 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 and is a function of the pattern of all the OD pairs including the locations of each origin node and destination node, and the flow demand of each OD pair. 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) | 551-555 |

Number of pages | 5 |

Journal | IEEE Symposium on Parallel and Distributed Processing - Proceedings |

Publication status | Published - 1 Jan 1995 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

**Fast distributed optimal routing algorithm for multicommodity large data networks.** / Huang, Garng Morton; Zhu, Shan.

Research output: Contribution to journal › Conference article

}

TY - JOUR

T1 - Fast distributed optimal routing algorithm for multicommodity large data networks

AU - Huang, Garng Morton

AU - Zhu, Shan

PY - 1995/1/1

Y1 - 1995/1/1

N2 - In this paper, a new distributed algorithm is investigated for optimal routing problems of large data network with multicommodities. The existing algorithms for general network topology have parallel time complexity of at least O(MΦ2) using all the nodes of the network as processors. 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 and is a function of the pattern of all the OD pairs including the locations of each origin node and destination node, and the flow demand of each OD pair. 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 investigated for optimal routing problems of large data network with multicommodities. The existing algorithms for general network topology have parallel time complexity of at least O(MΦ2) using all the nodes of the network as processors. 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 and is a function of the pattern of all the OD pairs including the locations of each origin node and destination node, and the flow demand of each OD pair. 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=0029236092&partnerID=8YFLogxK

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

M3 - Conference article

SP - 551

EP - 555

JO - IEEE Symposium on Parallel and Distributed Processing - Proceedings

JF - IEEE Symposium on Parallel and Distributed Processing - Proceedings

SN - 1063-6374

ER -