This preview shows page 1. Sign up to view the full content.
Unformatted text preview: finite form of routing. Once the network administrator programs the routers, there is no change in the routing pattern unless it is reprogrammed to a new route. If the pattern runs through a congested network area, a router in the pattern is not functioning properly, or part of the network is down, the router continues to try the same pattern because that is all it is programmed to remember. For todays larger networks, an unforgiving router mapping is not necessarily the most efficient way of passing information within the network. When routing dynamically, software is used to program a router to be forgiving. This means that the router remembers the best or most efficient path, but if that path is not working, it will try the next most efficient route. The router is able to do this by remembering the routing tables most often used in the network....
View Full Document
- Spring '11