Topological design of local-area networks using genetic algorithms

被引:82
作者
Elbaum, R [1 ]
Sidi, M [1 ]
机构
[1] TECHNION ISRAEL INST TECHNOL,DEPT ELECT ENGN,IL-32000 HAIFA,ISRAEL
关键词
D O I
10.1109/90.541324
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we describe an algorithm for designing local-area networks (LAN's) with the objective of minimizing the average network delay, The topology design includes issues such as determination of the number of segments in the network, allocating the users to the different segments, and determining the interconnections and routing among the segments. The determination of the optimal LAN topology is a very complicated combinatorial optimization problem, Therefore, a heuristic algorithm that is based on genetic ideas is used, Numerical examples are provided and the quality of the designs obtained by using the algorithm is compared with lower bounds on the average network delay that are developed.
引用
收藏
页码:766 / 778
页数:13
相关论文
共 19 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2]  
BACKES F, 1988, IEEE NETWORK, P5
[3]  
Bertsekas D. P., 1992, DATA NETWORKS
[4]   TOPOLOGICAL DESIGN OF INTERCONNECTED LAN MAN NETWORKS [J].
ERSOY, C ;
PANWAR, SS .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1993, 11 (08) :1172-1182
[5]  
Even S., 1979, Graph Algorithms
[6]  
Goldberg DE, 1989, GENETIC ALGORITHMS S
[7]   EQUIVALENT CAPACITY AND ITS APPLICATION TO BANDWIDTH ALLOCATION IN HIGH-SPEED NETWORKS [J].
GUERIN, R ;
AHMADI, H ;
NAGHSHINEH, M .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1991, 9 (07) :968-981
[8]  
HO WW, 1990, IEEE INFOCOM SER, P982
[9]  
HOFFMAN AJ, 1973, IBM J RES DEV, P420
[10]  
KHALIL KM, 1991, GLOBECOM91, P658