An adaptive network routing strategy with temporal differences
Fuente:
Redalyc
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Artículo científico |
| Lenguaje: | en |
| Publicado: |
Asociación Española para la Inteligencia Artificial
2001
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1876427903292407808 |
|---|---|
| author | Yván Túpac Valdivia |
| author_facet | Yván Túpac Valdivia |
| contents | An adaptive network routing strategy with temporal differences Yván Túpac Valdivia Marley M. Vellasco Marco A. Pacheco Ingeniería Packet Routing Reinforcement Learning Network Communication Networks This paper describes the TD-Routing, an adaptive algorithm for packet routing, based on the Temporal DifferencesTD(λ) method, and compares its performance with other routing strategies: Shortest Path Routing,Bellman-Ford and the Q-Routing. High and low network traffic conditions are considered. In contrast withother algorithms that are also based on Reinforcement Learning (RL), the TD-Routing is able to discover goodpolicies for situations that present a reduction in network traffic. The performance of the proposed algorithmwas evaluated within a benchmark network configuration of 16 nodes with different traffic conditions in differenttopologies. The simulations demonstrate that the TD-Routing outperforms other RL-based algorithms interms of learning speed and adaptability 2001 artículo científico 1137-3601 https://www.redalyc.org/articulo.oa?id=92551211 en http://www.redalyc.org/revista.oa?id=925 Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial application/pdf Asociación Española para la Inteligencia Artificial Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial (España) Num.12 Vol.5 |
| format | Artículo científico |
| id | redalyc_92551211 |
| institution | Redalyc |
| language | en |
| publishDate | 2001 |
| publisher | Asociación Española para la Inteligencia Artificial |
| spellingShingle | An adaptive network routing strategy with temporal differences Yván Túpac Valdivia Ingeniería Packet Routing Reinforcement Learning Network Communication Networks An adaptive network routing strategy with temporal differences Yván Túpac Valdivia Marley M. Vellasco Marco A. Pacheco Ingeniería Packet Routing Reinforcement Learning Network Communication Networks This paper describes the TD-Routing, an adaptive algorithm for packet routing, based on the Temporal DifferencesTD(λ) method, and compares its performance with other routing strategies: Shortest Path Routing,Bellman-Ford and the Q-Routing. High and low network traffic conditions are considered. In contrast withother algorithms that are also based on Reinforcement Learning (RL), the TD-Routing is able to discover goodpolicies for situations that present a reduction in network traffic. The performance of the proposed algorithmwas evaluated within a benchmark network configuration of 16 nodes with different traffic conditions in differenttopologies. The simulations demonstrate that the TD-Routing outperforms other RL-based algorithms interms of learning speed and adaptability 2001 artículo científico 1137-3601 https://www.redalyc.org/articulo.oa?id=92551211 en http://www.redalyc.org/revista.oa?id=925 Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial application/pdf Asociación Española para la Inteligencia Artificial Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial (España) Num.12 Vol.5 |
| title | An adaptive network routing strategy with temporal differences |
| topic | Ingeniería Packet Routing Reinforcement Learning Network Communication Networks |
| url | https://www.redalyc.org/articulo.oa?id=92551211 |