Lecture Distributed Systems - Lecture 3: Routing Algorithms. In this chapter, students will be able to understand: Main features, performance issues, good paths, destination-based forwarding, floyd-warshall algorithm, the simple distributed algorithm, important property of the simple algorithm, toueg’s improvement, the chandy-misra algorithm, the netchange algorithm. |