Path l 4 path l 5 0 12 1 2 5 1 3 1 1 4 22 1 2 4 1 4

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1-4-5-3 1 1-4 2 1-4-5 4 1-4-5-6 42 1-2 3 1-4-5-3 1 1-4 2 1-4-5 4 1-4-5-6 h h h h Comparison Comparison results from two algorithms agree Bellman-Ford calculation for node n needs link cost to neighbouring calculation nodes plus total cost to each neighbour from s nodes each node can maintain set of costs and paths for each every other node every can exchange information with direct neighbors can update costs and paths based on information can from neighbors and knowledge of link costs from Dijkstra each node needs complete topology must know link costs of all links in network must exchange information with all other nodes Evaluation Evaluation dependent on dependent processing time of algorithms amount of information required from other nodes implementation specific both converge under static topology and costs both converge to same solution if link costs change, algs attempt to catch up iif link costs depend on traffic, which depends on f routes chosen, may have feedback instability routes Summary Summary routing in packet-switched networks routing strategies fixed, flooding, random,adaptive ARPAnet examples least-cost algorithms Dijkstra, Bellman-Ford...
View Full Document

Ask a homework question - tutors are online