DocumentCode :
1421485
Title :
MENTour: An algorithm for designing reliable high-speed data networks
Author :
Cahn, Robert S.
Author_Institution :
T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598, U.S.A.
Volume :
20
Issue :
3
fYear :
1995
Firstpage :
101
Lastpage :
103
Abstract :
Interactive design is a foundation of a new generation of design tools, such as INTREPID [1] and NETDA/2. Interactive design requires that low-complexity algorithms be able to design realistic networks in minutes or seconds. The MENTOR algorithm has complexity O(n2) and is suitable to a wide variety of networks. However, if link speeds are much greater than the size of requirements, this algorithm builds networks which are tree-like. The typical design consists of a spanning tree with a few additional links and is generally too sparse to be reliable. Brute-force augmentation of these designs is reliable but too costly. The MENTour design has complexity O(n2) + O(b2), where n is the number of sites, b is the number of backbone sites and 3 ≤ k ≤ 4. It provides high-quality designs which are almost always two-connected. Experience has shown the best of these designs to be only a few per cent more costly than the best MENTOR designs.
Keywords :
Algorithm design and analysis; Clustering algorithms; Complexity theory; Partitioning algorithms; Reliability engineering; Routing;
fLanguage :
English
Journal_Title :
Electrical and Computer Engineering, Canadian Journal of
Publisher :
ieee
ISSN :
0840-8688
Type :
jour
DOI :
10.1109/CJECE.1995.7102094
Filename :
7102094
Link To Document :
بازگشت