- Page 2 and 3:
OUTLINEInternet- intra-domain: RIP,
- Page 5 and 6:
Shared BackplaneCPURouteTableBuffer
- Page 7 and 8:
Switched BackplaneLineCardCPUCardLi
- Page 11 and 12:
1. MooreMoore 2. Moore
- Page 13 and 14:
DRAM10001980 1983 1986 1989 1992 19
- Page 15 and 16:
OUTLINEInternet- intra-domain: RIP,
- Page 17 and 18:
Routing and ForwardingDefault toups
- Page 19 and 20:
Virtual circuits“source-to-dest p
- Page 21 and 22:
Datagram networks:the Internet mode
- Page 23 and 24:
Internet- intra-domain: RIP, OSPF-
- Page 25 and 26:
Before We Go AnyFurther …Usually,
- Page 27 and 28:
Routing AlgorithmClassificationGlob
- Page 29 and 30:
A Link-State RoutingAlgorithmDijkst
- Page 31 and 32:
Dijsktra’s Algorithm1 Initializat
- Page 33 and 34:
Spanning tree gives routing tableSt
- Page 35 and 36:
Distance Vector Routing Algorithmit
- Page 37 and 38:
Distance table gives routingtableED
- Page 39 and 40:
Distance Vector Algorithm:At all no
- Page 41 and 42:
Distance Vector Algorithm:exampleX2
- Page 43 and 44:
Distance Vector: link costchangesLi
- Page 45 and 46:
Comparison of LS and DValgorithmsMe
- Page 47 and 48:
Internet- intra-domain: RIP, OSPF-
- Page 49 and 50:
Requirements for Intra-ASRoutingSho
- Page 51 and 52:
Requirements for Inter-ASRoutingSho
- Page 53 and 54:
Internet AS HierarchyIntra-AS borde
- Page 55 and 56: Internet- intra-domain: RIP, OSPF-
- Page 57 and 58: RIP: Examplezw x yADBDestination Ne
- Page 59 and 60: RIP: Link Failure andRecoveryIf no
- Page 61 and 62: Internet- intra-domain: RIP, OSPF-
- Page 63 and 64: Hierarchical OSPFBackboneArea1 Area
- Page 65 and 66: OSPFUse IP as transport, IP protoco
- Page 67 and 68: OSPF Motivation (Cont.)Suffered fro
- Page 69 and 70: Functional Requirements ofOSPF (Con
- Page 71 and 72: OSPF BasicsDistributed, replicated
- Page 73 and 74: OSPF Basics (Cont.)OSPF has 3 sub-p
- Page 75 and 76: Neighbor Discovery andMaintenanceOS
- Page 77 and 78: Choosing RoutesDijkstra - Shortest
- Page 79 and 80: Internet- intra-domain: RIP, OSPF-
- Page 81 and 82: Intra-AS and Inter-AS routingaHosth
- Page 83 and 84: Autonomous Routing DomainA collecti
- Page 85 and 86: AS Numbers (ASNs)ASNs are 16 bit va
- Page 87 and 88: Nontransit vs. Transit ASesISP 1ISP
- Page 89 and 90: Customers and Providersproviderprov
- Page 91 and 92: The Peering Relationshippeerprovide
- Page 93 and 94: ISP6- “”- “”- “”CERNET
- Page 95 and 96: BGP-4 BGP = Border Gateway Protocol
- Page 97 and 98: BGP Operations (Simplified)Establis
- Page 99 and 100: BGP AttributesValue Code Reference-
- Page 101 and 102: Route Selection SummaryHighest Loca
- Page 103 and 104: AS PATH Attribute135.207.0.0/16AS P
- Page 105: Two Types of BGP NeighborRelationsh
- Page 109 and 110: Attention• BGP is not guaranteed
- Page 111 and 112: BGP SummaryBGP is a fairly simple p
- Page 113: END