lec23 - ECE 333 Introduction to Communication Networks Fall...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
1 ECE 333: Introduction to Communication Networks Fall 2002 Lecture 23: Routing and Addressing II Link state routing Hierarchical routing 2 Link state Routing In Lecture 22, we considered distance vector routing. In distance vector routing, each node maintains a list of the distance to each destination and periodically broadcasts this list to its neighbors. Each node uses the Bellman- Ford algorithm to calculate shortest paths. Next we consider another type of shortest-path routing algorithm - Link state routing. In link state routing, each router must: 1. Discover its neighbors and learn their addresses. 2. Measure cost to each neighbor, this is called the “link state”. 3. Broadcast (e.g. flood) a packet containing the link state to all other routers 4. Use the information it receives to compute the shortest path to all other routers. Each node will receive a link state packet from every other node in the network. Thus, each node can reconstruct a graph of the entire network topology and use this to calculate the shortest paths to every node. Each node will individually calculate the shortest paths, based on this common information. To calculate shortest paths, Dijkstra’s Algorithm is used.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
3 Dijkstra’s Algorithm Given a graph for the entire network, Dijkstra's Algorithm can be used to find the shortest paths from a given node to every other node. The basic idea of Dijkstra's algorithm is to first find the closest node, then the second closest node, etc. For a given node, s , notice the first closest node must be a neighbor of s and the second closest node must either be a neighbor of
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/12/2009 for the course ECE ECE 333 taught by Professor Randallberry during the Fall '02 term at North-West Uni..

Page1 / 6

lec23 - ECE 333 Introduction to Communication Networks Fall...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online