1 / 8

Chapter 27 sections

Chapter 27 sections. CS 332 Spring 2014. Link-state Routing. Q: Could you go over link-state routing (like OSPF)?

tana
Download Presentation

Chapter 27 sections

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 27 sections CS 332 Spring 2014

  2. Link-state Routing Q: Could you go over link-state routing (like OSPF)? A: Each router constructs a graph of the network in its memory. Each router broadcasts on its interfaces – “I’m on this network”. Routers then figure out they are directly connected. When they learn they are directly connected to other routers they share that information with neighbors. So, all routers learn the entire topology and can run Dijkstra’s algorithm to compute best paths.

  3. OSPF vs. RIP Q: How common is RIP vs. OSPF? A: I don’t think most routers use RIP anymore. RIP wasn’t designed for CIDR addressing (although it was probably updated to handle it). RIP also has weird problems… “split horizon”, “count-to-infinity” and other stuff I’ve forgotten about. Most everyone uses OSPF, afaik.

  4. Broken connections Q: How does a routing protocol know that a connection is broken? A: The application somehow gets info from the OS that a port/connection is down (register for a callback or polls the connection status often). Then, when it goes down it quickly recomputes routes and sends out a status update to other routers.

  5. Routing Groups Q: Are routing groups statically or dynamically configured? A: Statically – i.e., manually by a network manager.

  6. Dijkstra’s Algorithm Q: In OSPF, for Dijkstra’s algorithm, what does it use for link metrics? (i.e., length’s of edges between routers) A: By default (afaik), it uses 1 for each connection. It can be configured by a network manager to have different metrics for each connection.

  7. ASes and sub-ASes Q: Can Autonomous Systems be sub-divided into sub-ASes? A: Not that I know.

  8. Routers not in an AS? Q: Is there ever a situation where there is a functional group of internetworked routers that is not classified as an autonomous system? A: Not every group of routers is an AS – or has an AS number assigned. As far as I can tell, Calvin does not have an AS assigned. I think you only need an AS number if you have multiple service providers connected via BGP.

More Related