Scheduled System Maintenance:
On April 27th, single article purchases and IEEE account management will be unavailable from 2:00 PM - 4:00 PM ET (18:00 - 20:00 UTC).
We apologize for the inconvenience.
By Topic

A new HAD algorithm for optimal routing of hierarchically structured 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.

The purchase and pricing options are temporarily unavailable. Please try again later.
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 algorithm based on hierarchical aggregation/disaggregation and decomposition/composition (HAD) scheme is proposed to solve the optimal routing problems (ORP) for hierarchically structured networks of multi-layer backbones. Our algorithm has two major differences with the existing HAD algorithms for hierarchically clustered networks: (1) our algorithm works with more general networks than the networks with the clustered structure; (2) our algorithm parallelizes the computations for different commodities (message flows defined by a pair of origin node and destination node) so that it speeds up with a parallel time complexity of O(mlog2(n)), which is much less than O(Mlog2(n)) needed for the existing HAD algorithms. Here, n is the number of nodes in the network; M is the number of commodities and m is a positive number usually much smaller than M and is a function of the patterns of all the commodities including the locations of all origin nodes and destination nodes, and the flow demand of each commodity. Furthermore, our algorithm can make a trade-off between the run time and the optimality, i.e., by allowing the solution to be sub-optimal, our algorithm can save great amount of computation time. The implementation of the algorithm for a 200-node network is simulated using OPNET simulation package (OPNET or Optimized Network Engineering Tools is developed by MIL3, Inc.), and the test results are consistent with our analysis

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:7 ,  Issue: 9 )