Dynamic programming for optimal packet routing control using two neural networks

Tsuyoshi Horiguchi, Hideyuki Takahashi, Keisuke Hayashi and Chiaki Yamaguchi

Physica A: Statistical Mechanics and its Applications, 2004, vol. 339, issue 3, 653-664

Abstract: 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 destination node. We set a dynamics for the thermal average of the state of neuron in order to make the mean-field energy of each neural network decrease as a function of time. By computer simulations with discrete time steps, we show that the optimal control of packet flow is possible by using the proposed method, in which a goal-directed learning has been done for time-dependent environment for packets.

Keywords: Spin model; Computer network; Routing control; Packet flow; Goal-directed learning; Dynamic programming (search for similar items in EconPapers)
Date: 2004
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437104003413
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:339:y:2004:i:3:p:653-664

DOI: 10.1016/j.physa.2004.03.064

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().