Routing scalability has always been a problem in networking research. Now, computer scientists at UC San Diego (UCSD) have developed a new algorithm to improve the routing efficiency of networks.

1. Dijkstra's Link State Algorithm (similar to Chapter 5, P3-5) (3/8)*4.0 2. Dijkstra's Link State Algorithm - Advanced (2/8)*4.0 3. Bellman Ford Distance Vector algorithm (similar to Chapter 5, P8) ...