By Topic

An innovative technique for backbone network design

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
$33 $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

3 Author(s)
N. G. Chattopadhyay ; Center for Comput. Inf. Networks Res., Drexel Univ., Philadelphia, PA, USA ; T. W. Morgan ; A. Raghuram

An algorithm is proposed for solving the minimum-cost backbone network design problem. The method includes time delay as the performance criterion and multiple-hop communication paths. The algorithm combines a branch-and bound method with the algorithm of L.R. Ford and D.R. Fulkerson (1962). The branch-and-bound method is used to find the network topology. A depth-first search using a cost heuristic that is a linear function of the maximum and current depth in the tree is used. When a feasible topology is found, the Ford-Fulkerson algorithm is applied to find the optimal paths. The resulting network is retained if it is the current optimum cost network. The algorithm is compared with a branch-and-bound algorithm and is found to produce globally optimal solutions. For large, sparsely connected networks computation times are reduced by a factor of over one thousand

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:19 ,  Issue: 5 )