29th Annual Student Research Conference
Link State Routing with Simulated Annealing
Valerie A. Free
Dr. John Seiffertt, Faculty Mentor
Routing algorithms are used by computer networks to find the best path to send packets from one router to another. One type of routing algorithm is link state routing. In this algorithm, each router discovers the costs to its neighbors, shares this knowledge with every other router, and computes the shortest path to each router using Dijkstra's algorithm. In this research, we investigate both a straight-forward implementation of link state routing as well as one in which we use the machine learning technique of simulated annealing to attempt to improve the process of finding best paths. This is especially valuable in a situation where the network topology can change.
Keywords: networks, routing algorithms, simulated annealing
Topic(s):Computer Science
Presentation Type: Oral Paper
Session: -4
Location: VH 1328
Time: 10:15