By Topic

Parallel optimal routing control by commodities for large data networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Huang, G.M. ; Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA ; Zhu, S.

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

Published in:

Decision and Control, 1994., Proceedings of the 33rd IEEE Conference on  (Volume:3 )

Date of Conference:

14-16 Dec 1994