Occurrence of congestion of packet flow in computer networks is one of the unfavorable problems in packet communication and hence its avoidance should be investigated. We use a neural network model for packet routing control in a computer network proposed in a previous paper by Horiguchi and...

We propose a dynamic programming for optimal packet routing control using two neural networks within the framework of statistical physics. An energy function for each neural network is defined in order to express competition between a queue length and the shortest path of a packet to its...

We investigate an optimal network structure for packet flow on large-scale networks. For this aim, we introduce a cost function which represents efficiency of the packet flow. Our strategy for obtaining an optimal network is to reconnect links in the network so as to minimize the defined cost...