Table of ContentsRouting What is it? Basics Key problem Requirements Choices Outline Telephone network topology Routing algorithm Features of telephone network routing The cost of simplicity Dynamic nonhierarchical routing (DNHR) Metastability Trunk status map routing (TSMR) Real-time network routing (RTNR) Outline Distance vector routing Basic idea Example Why does it work Problems with distance vector Dealing with the problem Outline Link state routing Link state: topology dissemination Sequence numbers Aging A better solution More on lollipops Recovering from a partition Router failure Securing LSP databases Computing shortest paths Example Link state vs. distance vector Outline Choosing link costs Static metrics Dynamic metrics Modified metrics Routing dynamics Outline Hierarchical routing Example Hierarchy in the Internet External and summary records Interior and exterior protocols Exterior gateway protocol Interior protocols Issues in interconnection Outline Common routing protocols RIP OSPF EGP BGP PNNI Outline Routing within a broadcast LAN Internet solution Redirection Outline Multicast routing Multicast group Addressing Expanding ring search Multicast flavors Example Shortest path tree Issues in wide-area multicast Multicast in a broadcast LAN Class D to MAC translation Internet Group Management Protocol Wide area multicast Simplest solution A clever solution Cleverer Pruning Rejoining A problem A problem (contd.) Tunnels Multicast routing protocol DVMRP MOSPF Core-based trees Example Protocol independent multicast (PIM) PIM (contd.) More on core Outline Routing vs. policy routing Multiple metrics Problems with multiple metrics Provider selection Crankback Outline Mobile routing Mobile routing in the telephone network Mobile routing in the Internet Problems |
Author: S. Keshav
Email: skeshav@cs.cornell.edu Home Page: http://www.cs.cornell.edu/home/skeshav |