✦ LIBER ✦

A packet routing method for complex networks by a stochastic neural network

✍ Scribed by Takayuki Kimura; Hiroyuki Nakajima; Tohru Ikeguchi

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 615 KB
Volume: 376
Category: Article
ISSN: 0378-4371
DOI: 10.1016/j.physa.2006.10.061

No coin nor oath required. For personal study only.

✦ Synopsis

We propose a new algorithm for controling packet routing by a neural network. First, we show that the conventional method for a packet routing control using a neural network is not so effective when it is applied to a network with irregular topology. To overcome this problem, we propose a modified method with stochastic effects. In the present paper, we evaluated our proposed method for irregular, randomized and scale-free networks. Further, we compared our method with the conventional method and another modified method. We show that our proposed method exhibits better performance than the conventional routing method.

Introducing some additional measures, we also analyze why the proposed method shows better performance. As a result, we confirmed that our proposed method skillfully decentralizes the packets in the computer network, and which improves the performance of the proposed method.

📜 SIMILAR VOLUMES

A packet routing strategy using neural n

A packet routing strategy using neural networks on scale-free networks

✍ Yuki Naganuma; Akito Igarashi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 379 KB

We propose a dynamic packet routing strategy by using neural networks on scale-free networks. In this strategy, in order to determine the nodes to which the packets should be transmitted, we use path lengths to the destinations of the packets, and adjust the connection weights of the neural networks

Scale-free property of optimal network f

Scale-free property of optimal network for packet flow by a packet routing control

✍ Jun Ohkubo; Tsuyoshi Horiguchi 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 326 KB

A proposal of a greedy neural network fo

A proposal of a greedy neural network for route assignments in multihop radio networks

✍ Takayuki Baba; Nobuo Funabiki; Seishi Nishikawa 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB 👁 1 views

In a radio communications network, all of the nodes cannot communicate with each other directly. Then packets are transferred from a source node to a destination node through several nodes. Therefore, we need to schedule transfer timing at each node, and communications routes must be assigned to min

A stochastic network formulation for com

A stochastic network formulation for complex sequential processes

✍ Austin J. Lemoine 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 668 KB

Principles of evolutionary learning desi

Principles of evolutionary learning design for a stochastic neural network

✍ Harold M. Hastings; Stefan Waner 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 347 KB

A neural network for one-shot scheduling

A neural network for one-shot scheduling problems in multicast packet switching systems

✍ Takayuki Baba; Nobuo Funabiki; Seishi Nishikawa 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 274 KB 👁 2 views

In a multicast packet switching system, multiple output ports can send out packets simultaneously by means of the packet copying function. In realizing such a switching system, the transmission pattern must be determined for successively arising transfer requests, so that the number of transmitted p