DocumentCode :
779731
Title :
Low mean internodal distance network topologies and simulated annealing
Author :
Rose, Christopher
Author_Institution :
Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA
Volume :
40
Issue :
8
fYear :
1992
fDate :
8/1/1992 12:00:00 AM
Firstpage :
1319
Lastpage :
1326
Abstract :
Networks have been found through simulated annealing with mean internodal distances lower than any previously reported for a given number of nodes N with a maximum of p outgoing links per node. These networks form the closest known approximations to Moore networks. However, the improvements in mean internodal distance obtained are relatively small (a few percent) and this improvement decreases rapidly with increasing p. The relation between average nodal switching complexity and mean internodal distance is briefly explored through simulated annealing. Initial sharp decreases in mean internodal distance can be obtained through moderate increases in switching complexity. However, further decreases require much larger increases in average complexity
Keywords :
network topology; simulated annealing; telecommunication networks; Moore networks; average nodal switching complexity; mean internodal distance; network topology; simulated annealing; telecommunication network; Aggregates; Algorithm design and analysis; Communication switching; Computational modeling; Computer networks; Helium; Network topology; Simulated annealing;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/26.156636
Filename :
156636
Link To Document :
بازگشت