EE 281 Lecture 3: Routing
Document Summary
For finding the shortest path and most economical path from the source to receiver, various routing algorithms are used these are classified according to various aspects as follows: A global routing algorithm computes the least-cost path between a source and destination using complete, global knowledge about the network. That is, the algorithm takes the connectivity between all nodes and all link costs as inputs. In practice, algorithms with global state information are often referred to as link-state (ls) algorithms, since the algorithm must be aware of the cost of each link in the network. In a decentralized routing algorithm, the calculation of the least-cost path is carried out in an iterative, distributed manner. No node has complete information about the costs of all network links. In static routing algorithms, routes change very slowly over time, often as a result of human intervention (for example, a human manually editing a router"s forwarding table).
