Evaluation of Point-to-Point Network Routing Algorithms

A sampling of routing algorithms is evaluated through simulation. The algorithms selected are random walk, fixed directory, split traffic, isolated shortest queue (hot potato) and backward learning. Backward learning exhibited the most desirable characteristics, approaching fixed directory routing in delay and path length, while adapting to link failures.