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.
|Number of pages||5|
|Journal||IEEE Symposium on Parallel and Distributed Processing - Proceedings|
|Publication status||Published - 1 Jan 1995|
ASJC Scopus subject areas