Textbook Required: Cisco Networking Academy Program CCNP: Building Scalable Internetworks v5.0 Lab Manual.

Transcription

1 Course: NET 251 Building Scalable Internetworks Credits: 3 Textbook Required: Cisco Networking Academy Program CCNP: Building Scalable Internetworks v5.0 Lab Manual. Course Description: In this course, students will learn how to create an efficient and expandable enterprise network. Students will also learn how to install, configure, monitor, and troubleshoot network infrastructure equipment. Topics include configuration of EIGRP, OSPF, IS-IS, and BGP routing protocols, and how to manipulate and optimize routing updates between these protocols. Other topics include multicast routing, IPv6, and DHCP configuration. Course Objectives: The following are skills students will be able to perform upon completion of the course: Explain routing in the enterprise network Implement and verify multicast forwarding using PIM Implement IPv6 in an enterprise network Implement and verify EIGRP operations Implement and verify OSPF operations Implement and verify IS-IS operations Implement and verify BGP operations Build a scalable multi-area network with OSPF Evaluation: Evaluation will be based on the scores achieved on the chapter tests, the final online test, the successful completion of the lab assignments, and the final skills test. The online chapter tests will be scored on a scale of The lab assignments will be scored as 2 points for each one successfully completed. Challenge labs will be scored on a scale of 0-5 points each. The course case study will be scored on a scale of 0 15 points. The skills test will be scored on a scale of points. The final test will be scored on a scale of points. The final grade will be based on the percentage of points earned in accordance with the grading scale. (Note: only pencil, preferably.5 HB lead, is to be used in the lab book). Due Dates: Lab Assignments are posted on e-learning without due dates. All lab work must be completed by the end of the course. To allow students to work at their own pace and to complete the labs by the end of the course the lab will be open beyond the scheduled class time. It is essential to maintain the schedule of due dates on the chapter tests. Therefore a 10% deduction will occur for each day an online chapter test is late. It is also essential that all lab assignments are completed prior to the skills test. The skills test will be scheduled during the last week of the course at the discretion of the instructor. Students are expected to manage their time accordingly as any assignments not completed by this time will be graded as a zero. Grading Scale: % = A Chapter Tests... 25% 87-93% = B Lab Assignments... 25% 80-86% = C Skills Test... 25% 79% and under = F Final test... 25% Total = 100% Attendance: Attendance is mandatory. Any student absent more than 6 hours will cause an automatic drop slip to be filed. The student may request an appeal and should attend all scheduled classes until the outcome of their appeal is known. Accumulated tardiness or early exits from a class period may count as an hour absent. Academic Honesty: Refer to department policy on cheating and use of other s work.

2 NET 251 Page 2 Policy and Procedures: General policies and procedures are outlined in the LATI Student Handbook. Use of the computers is restricted to that necessary to complete Cisco class assignments. Online chapter tests may be retaken one time only. The final online test may be retaken once and only if it will make the difference between passing and failing the class. The maximum grade that will be recorded for second attempt will be 80%. The Skills test must be passed with an 80% score or above. Skills test may be retaken once by anyone choosing to do so or until passed but must be completed within the scheduled class dates. Statement: Without my permission, you do not have the authority to record any of my class, its class members, or any content expressed here. Schedule: Class times and location will be at the discretion of the instructor. Course Outline: Module 1 Module 2 of Scalable Internetworks 1.1 The Hierarchical Network Design Model The three-layer hierarchical design model Router function in the hierarchy Core layer example Distribution layer example Access layer example 1.2 Key Characteristics of Scalable Internetworks Five characteristics of a scalable network Making the network reliable and available Making the network responsive Making the network efficient Making the network efficient, continued Making the network adaptable Making the network accessible but secure 1.3 Case Study The International Travel Agency 1.4 Basic Router Configuration Lab Exercises Getting started and building start.txt Capturing HyperTerminal and Telnet sessions Access control list basics and extended ping Implementing quality of service with priority queuing 1.5 Load Balancing Lab Exercises Equal-cost load balancing with RIP Unequal-cost load balancing with IGRP Advanced IP Addressing Management 2.1 IPv4 Addressing Address architecture of the Internet Classes of IP addresses Classes of IP addresses, continued Subnet masking 2.2 IP Addressing Crisis and Solutions IP addressing crisis Classless Interdomain Routing (CIDR) Route aggregation and supernetting Supernetting and address allocation 2.3 VLSM Variable-Length Subnet Masks Classless and classful routing protocols 2.4 Route Summarization An overview of route summarization Route flapping

3 NET 251 Page Private Addressing and NAT Private IP addresses (RFC 1918) Discontiguous subnets Network Address Translation (NAT) 2.6 IP Unnumbered Using IP unnumbered 2.7 DHCP and Easy IP DHCP overview DHCP operation Configuring an IOS DHCP server Easy IP 2.8 Helper Addresses Using helper addresses Configuring IP helper addresses IP helper address example 2.9 IPv IP address issues and solutions IPv6 address format 2.10 Advanced IP Addressing Management Lab Exercises Configuring VLSM and IP unnumbered VLSM Using DHCP and IP helper addresses Network Address Translation Module 3 Routing 3.1 Routing Routing fundamentals Static routing Configuring dynamic routing Distance vector routing protocols Link-state routing protocols Hybrid routing with EIGRP 3.2 Default Routing Default routing overview Configuring static default routes Default routing with IGRP Default route caveats Floating Static Routes Configuring floating static routes 3.3 Convergence Convergence issues 3.4 Route Calculation Route calculation fundamentals The initiation of routing updates Routing metrics 3.5 Routing Process Configuration Lab Exercises Migrating from RIP to EIGRP Configuring IGRP Configuring default routing with RIP and IGRP Configuring floating static routes

4 NET 251 Page 4 Module 4 Module 5 Routing Information Protocol 4.1 RIPv RIPv2 operation Issues addressed by RIPv RIPv2 message format Compatibility with RIPv Classless route lookups Classless routing protocols Authentication Limitations of RIPv2 4.2 Configuring RIPv Basic RIPv2 configuration Compatibility with RIPv Discontiguous subnets and classless routing Configuring authentication 4.3 Verifying RIPv2 operation Show commands Debug commands 4.4 RIP v2 Lab Exercises Routing between RIPv1 and RIPv RIPv2 MD5 authentication EIGRP 5.1 EIGRP Fundamentals EIGRP and IGRP compatibility EIGRP design EIGRP terminology 5.2 EIGRP Features EIGRP technologies Neighbor discovery and recovery Reliable transport protocol DUAL finite-state machine Protocol-dependent modules 5.3 EIGRP Components EIGRP packet types EIGRP tables EIGRP tables, continued Route tagging with EIGRP 5.4 EIGRP Operation Convergence using EIGRP 5.5 Configuring EIGRP Configuring EIGRP for IP networks EIGRP and the bandwidth command The bandwidth-percent command Summarizing EIGRP routes for IP Summarizing EIGRP routes for IP 5.6 Monitoring EIGRP Verifying EIGRP operation 5.7 EIGRP Configuration Lab Exercises Configuring EIGRP Configuring EIGRP fault tolerance Configuring EIGRP summarization 5.8 EIGRP Configuration Challenge Lab Exercise EIGRP challenge lab

5 NET 251 Page 5 Module 6 OSPF 6.1 OSPF Issues addressed by OSPF OSPF terminology OSPF states OSPF network types The OSPF hello protocol 6.2 OSPF Operation Steps of OSPF operation Step 1: Establish router adjacencies Step 2: Elect a DR and a BDR Step 3: Discover routes Step 4: Select appropriate routes Step 5: Maintain routing information 6.3 OSPF Configuration and Verification Configuring OSPF on routers within a single area Optional configuration commands Optional configuration commands, continued Show commands Clear and debug commands 6.4 Configuring OSPF Over NBMA NBMA overview Full-mesh Frame Relay Partial-mesh Frame Relay Point-to-multipoint OSPF 6.5 Multi-area OSPF Operation Creating multiple OSPF areas OSPF router types OSPF LSA and area types Configuring OSPF operation across multiple areas Flooding LSUs to multiple areas Updating the routing table Opaque LSAs 6.6 Multiarea OSPF Configuration and Verification Using and configuring OSPF multiarea components Configuring OSPF route summarization Verifying multiarea OSPF operation 6.7 Stub, Totally Stubby and Not-So-Stubby Areas Using stub and totally stubby areas Stub and totally stubby area criteria Configuring stub and totally stubby areas OSPF stub area configuration example OSPF totally stubby configuration example NSSA overview How NSSA operates Configuring NSSA 6.8 Virtual Links Meeting the backbone area requirements Configuring virtual links Virtual link configuration example 6.9 OSPF Verification and Configuration Lab Exercises Configuring OSPF Examining the DR/BDR election process Multiarea OSPF Configuring a stub area and a totally stubby area Configuring an NSSA Configuring virtual links 6.10 Creating Multiarea OSPF Challenge Lab Exercise OSPF challenge lab

6 NET 251 Page 6 Module 7 Module 8 IS-IS 7.1 IS-IS Fundamentals OSI protocols OSI terminology ES-IS and IS-IS Integrated IS-IS OSPF versus IS-IS 7.2 ISO Addressing NSAPs NETs ISO addressing with Cisco routers Identifying systems in IS-IS 7.3 IS-IS Operation High-level view of IS-IS operation OSI PDUs IS-IS hello messages IS-IS link-state PDU (LSP) formats IS-IS routing levels IS-IS adjacencies Designated Intermediate Systems (DIS) and Pseudonodes (PSN) IS-IS data flow LSP flooding and synchronization LSD flooding and synchronization, continued IS-IS metrics IS-IS network types SPF algorithm 7.4 IP Routing with Integrated IS-IS OSI, IP, and dual Suboptima IS-IS routing Intra-area and Inter-area Integrated IS-IS routing example 7.5 Configuration of Integrated IS-IS Basic configuration of Integrated IS-IS Multi-Area Integrated IS-IS configuration 7.6 Integrated IS-IS Operation in a WAN Environment Point-to-point and point-to-multipoint operation with IS-IS Configuring Integrated IS-IS in a WAN environment Frame Relay point-to-point scenario with Integrated IS-IS Frame Relay point-to-multipoint scenario with Integrated IS-IS Detecting mismatched interfaces with Integrated IS-IS 7.7 IS-IS Configuration Lab Exercises Configuring basic integrated IS-IS Configuring multi-area integrated IS-IS Configuring IS-IS over Frame Relay Route Optimization 8.1 Controlling Routing Update Traffic Controlling routing updates Passive interfaces Filtering routing updates with distribute-list 8.2 Policy Routing Policy routing overview Policy routing example

7 NET 251 Page Route Redistribution Redistribution overview Redistribution overview, continued Administrative distance Modifying administrative distance by using the distance command Redistribution guidelines Configuring one-way redistribution Configuring two-way redistribution Redistributing connected and static routes Verifying redistribution operation 8.4 Redistribution Example Phase 1: Configuring a RIP network Phase 2: Adding OSPF to the core of a RIP network Phase 3: Adding OSPF areas 8.5 Route Optimization Configuration Lab Exercises Configuring distribute lists and passive interfaces Configuring route maps Unequal-cost load balancing with IGRP 8.6 Route Optimization Challenge Lab Exercise Route optimization challenge lab Module 9 Routing 9.1 Autonomous Systems of autonomous systems Single-homed autonomous systems Multihomed nontransit autonomous systems Multi-homed transit autonomous systems When not to use BGP 9.2 Basic VGP Operation BGP routing updates BGP neighbors BGP message types BGP neighbor negotiation Network-Layer Reachability Information (NLRI) Path attributes 9.3 Configuring BGP Basic BGP configuration EBGP and IBGP EBGP and IBGP configuration example EBGP multi-hop Clearing the BGP table Peering BGP continuity inside an AS 9.4 Monitoring BGP operation Verifying BGP operation 9.5 The BGP Routing Process An overview of the BGP routing process The BGP routing process model Implementing BGP routing policy

8 NET 251 Page 8 Case Study: Routing 9.6 BGP Attributes Controlling BGP routing with attributes The Next Hop attribute Next Hop behavior on multiaccess media Next Hop behavior on NBMA networks The AS_Path attribute AS_Path and private AS numbers The Atomic Aggregate attribute The Aggregator attribute The Local Preference attribute Manipulating Local Preference The Weight attribute The Multiple Exit Discriminator attribute MED configuration example The Origin attribute 9.7 The BGP Decision Process The BGP decision process 9.8 BGP Route Filtering and Policy Routing BGP route filtering Using filters to implement routing policy Using distribute-list to filter BGP routes The ip prefix-list command Example ip prefix-list configuration 9.9 Redundancy, Symmetry, and Load Balancing Issues with redundancy, symmetry, and load balancing Redundancy, symmetry, and load balancing Default routing in BGP networks Symmetry Load balancing Multihomed connections 9.10 BGP Redistribution BGP redistribution overview Injection of unwanted or faulty information Injecting information statically into BGP BGP redistribution configuration example 9.11 BGP Configuration Lab Exercises Configuring BGP Configuring IBGP and EBGP sessions Using the AS_PATH attribute Using the LOCAL_PREF and MED attributes 9.12 BGP Configuration Challenge Lab Exercise BGP challenge lab Revised: 8/09