DocumentCode :
2713339
Title :
Reconfigurable disruption tolerant routing via Reinforcement Learning
Author :
Kim, Tae-Hyung ; Pyeatt, Larry D. ; Wunsch, Donald C., II
Author_Institution :
Dept. of Electr. & Comput. Eng., Missouri Univ. of Sci. & Technol., Rolla, MO, USA
fYear :
2009
fDate :
14-19 June 2009
Firstpage :
1611
Lastpage :
1616
Abstract :
This paper shows packet delivery rate can be improved by adopting learning-based hybrid routing strategies when a wired network suffers from severe link disruption. The dynamics of the link disruptions complicate the routing problem; successful and stable routing operations of conventional routing approaches are hindered as the level of disruption increases. The target is to develop a robust and efficient routing approach in a single structure. A robust routing approach means a packet should be delivered to a destination even under severe disruptions. Efficient routing should deliver a packet with the shortest path at no disruption. These goals should be achieved with the maximum utilization of preexisting network components and with the minimal human intervention once installed. Therefore, we chose a popular conventional routing scheme, link state, and add-ons that can learn changing network environment. Our approach is to add a learning agent and a simple routing scheme to link state in order to automatically select a better routing scheme at an arbitrary level of disruption. Markov decision process is employed to model this problem. The simulation results show robustness and packet delivery rate are increased up to 35% at acceptable cost of computational and architectural complexity even when link state approach is close to be collapsed.
Keywords :
Internet; Markov processes; computational complexity; computer network reliability; decision theory; fault tolerance; graph theory; learning (artificial intelligence); multi-agent systems; routing protocols; Internet; Markov decision process; computational complexity; link state routing protocol; packet delivery; reconfigurable link disruption tolerant routing; reinforcement learning agent; shortest path problem; wired network; Computational intelligence; Disruption tolerant networking; Fault tolerance; Internet; Laboratories; Learning; Neural networks; Robustness; Routing protocols; TCPIP;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 2009. IJCNN 2009. International Joint Conference on
Conference_Location :
Atlanta, GA
ISSN :
1098-7576
Print_ISBN :
978-1-4244-3548-7
Electronic_ISBN :
1098-7576
Type :
conf
DOI :
10.1109/IJCNN.2009.5178992
Filename :
5178992
Link To Document :
بازگشت