Optimal Network Structure for Packet Flow in Shortest-Path Routing Control Model
Chiaki Yamaguchi, Tsuyoshi Horiguchi · Progress of Theoretical Physics Supplement · 2005
A network structure is responsible for efficient communication through a computer network. In order to obtain a network structure suitable for optimal packet communication on the network, we introduce a cost function for the efficiency of packet communication. By means of numerical simulations, we find an optimized network structure by reconnecting links in the network so as to minimize the defined cost function by using a shortest-path routing control model for packet flow. It turns out that the obtained optimized networks have the small-world property but a different structure from Erdös and Rényi's random graph [P. Erdös and A. Rényi, Publ. Math. (Debrecen) 6 (1959), 290] nor the real Internet. In addition, the distribution of links in the obtained network is not homogeneous and hence different from that obtained by Guimerá et al., who have also investigated an optimal network structure for packet communication without packet routing processes.