ç¬¬äºè®²è·¯ç±å¨ç»æåè·¯ç±åè®®

More documents

Recommendations

Info

Autonomous Systems(ASes)An autonomous system is an autonomousrouting domain that has been assigned anAutonomous System Number (ASN)… the administration of an AS appears toother ASes to have a single coherent interiorrouting plan and presents a consistentpicture of what networks are reachablethrough itRFC 1930: Guidelines for creation, selection,and registration of an Autonomous System
AS Numbers (ASNs)ASNs are 16 bit values64512 through 65535 are “private”Currently over 41,000 in use Genuity: 1 MIT: 3 Harvard: 11 UC San Diego: 7377 AT&T: 7018, 6341, 5074, … UUNET: 701, 702, 284, 12199, … Sprint: 1239, 1240, 6211, 6242, … …ASNs represent units of routing policy
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 57 and 58: RIP: Examplezw x yADBDestination Ne
Page 59 and 60: RIP: Link Failure andRecoveryIf no
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 81 and 82: Intra-AS and Inter-AS routingaHosth
Page 83: Autonomous Routing DomainA collecti
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 and 106: Two Types of BGP NeighborRelationsh
Page 107 and 108: Join EGP with IGP ForConnectivity13
Page 109 and 110: Attention• BGP is not guaranteed
Page 111 and 112: BGP SummaryBGP is a fairly simple p
Page 113: END
show all

ç¬¬äºè®²è·¯ç±å¨ç»æåè·¯ç±åè®®

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?

ç¬¬äºè®²è·¯ç±å¨ç»æåè·¯ç±åè®®