Franske CNT-2520 SP10 Schedule: Difference between revisions
No edit summary |
|||
(8 intermediate revisions by the same user not shown) | |||
Line 43: | Line 43: | ||
==Session 2: March 18== | ==Session 2: March 18== | ||
'''Topics:''' | '''Topics:''' | ||
* Directly Connected Networks | *Chapter Introduction | ||
*Routers and Network | |||
**Role of the Router | |||
**Introducing the Topology | |||
**Examining the Connections of the Router | |||
*Router Configuration Review | |||
**Examining Router Interfaces | |||
**Configuring an Ethernet Interface | |||
**Verifying Ethernet interface | |||
**Configuring A Serial Interface | |||
**Examining Router Interfaces | |||
*Exploring Directly Connected Networks | |||
**Verifying Changes to the Routing Table | **Verifying Changes to the Routing Table | ||
**Devices on Directly Connected Networks | **Devices on Directly Connected Networks | ||
**CDP | **Cisco Discovery Protocol (CDP) | ||
**Using CDP for Network Discovery | **Using CDP for Network Discovery | ||
* Next | *Static Routes with "Next Hop" Addresses | ||
**Purpose and Command Syntax of ip | **Purpose and Command Syntax of ip route | ||
**Configuring Static Routes | **Configuring Static Routes | ||
**Routing Table Principles and Static Routes | **Routing Table Principles and Static Routes | ||
**Resolving to an Exit Interface | **Resolving to an Exit Interface | ||
* | *Static Routes with Exit Interfaces | ||
**Configuring a Static Route with an Exit Interface | **Configuring a Static Route with an Exit Interface | ||
**Modifying Static Routes | **Modifying Static Routes | ||
**Verifying the Static Route | **Verifying the Static Route Configuration | ||
**Static Routes with Ethernet Interfaces | **Static Routes with Ethernet Interfaces | ||
* Summary and Default Static Routes | *Summary and Default Static Routes | ||
**Summary Static Routes | **Summary Static Routes | ||
**Default Static Route | **Default Static Route | ||
*Managing and Troubleshooting Static Routes | |||
**Static Routes and Packet Forwarding | |||
**Troubleshooting a Missing Route | |||
**Solving the Missing Route | |||
'''Readings:''' | '''Readings:''' | ||
Line 71: | Line 87: | ||
==Session 3: March 23== | ==Session 3: March 23== | ||
'''Topics:''' | '''Topics:''' | ||
* | *Chapter Introduction | ||
*Introduction and Advantages | |||
**Perspective and Background | **Perspective and Background | ||
**Network | **Network discovery and routing table maintenance | ||
**Advantages | **Advantages | ||
* Classifying Routing Protocols | *Classifying Dynamic Routing Protocols | ||
**Overview | |||
**IGP and EGP | **IGP and EGP | ||
**Distance Vector and Link State | **Distance Vector and Link State | ||
**Classful and Classless | **Classful and Classless | ||
**Convergence | **Convergence | ||
* Metrics | *Metrics | ||
**Purpose | **Purpose of a Metric | ||
**Routing Protocols | **Metrics and Routing Protocols | ||
**Load Balancing | **Load Balancing | ||
* Administrative | *Administrative Distances | ||
**Purpose | **Purpose of Administrative Distance | ||
**Dynamic Routing | **Dynamic Routing Protocols | ||
**Static Routes | **Static Routes | ||
**Directly Connected Networks | **Directly Connected Networks | ||
'''Readings:''' | '''Readings:''' | ||
Line 100: | Line 119: | ||
==Session 4: March 25== | ==Session 4: March 25== | ||
'''Topics:''' | '''Topics:''' | ||
* Distance Vector | *Chapter Introduction | ||
* Network Discovery | *Introduction to Distance Vector Routing Protocols | ||
* Routing Table Updates | **Distance Vector Routing Protocols | ||
* Routing Loops | **Distance Vector Technology | ||
**Routing Protocol Algorithms | |||
**Routing Protocol Characteristics | |||
*Network Discovery | |||
**Cold Start | |||
**Initial Exchange of Routing Information | |||
**Exchange of Routing Information | |||
**Convergence | |||
*Routing Table Maintenance | |||
**Periodic Updates: RIPv** and IGRP | |||
**Bounded Updates: EIGRP | |||
**Triggered Updates | |||
**Random Jitter | |||
*Routing Loops | |||
**Definition and Implications | |||
**Problem: Count to Infinity | |||
**Setting a Maximum | |||
**Preventing Routing Loops with Holddown Timers | |||
**Split Horizon Rule | |||
**Split Horizon with Poison Reverse or Route Poisoning | |||
**IP and TTL | |||
*Distance Vector Routing Protocols today | |||
**RIP and EIGRP | |||
'''Readings:''' | '''Readings:''' | ||
Line 113: | Line 155: | ||
==Session 5: March 30== | ==Session 5: March 30== | ||
'''Topics:''' | '''Topics:''' | ||
* RIPv1 | *Chapter Introduction | ||
* Basic RIPv1 Configuration | *RIPv1: Distance Vector, Classful Routing Protocol | ||
* Automatic Summarization | **Background and Perspective | ||
* Default | **RIPv1 Characteristics and Message Format | ||
**RIP Operation | |||
**Administrative Distance | |||
*Basic RIPv1 Configuration | |||
**Basic RIPv1 Configuration | |||
**Enabling RIP: router rip command | |||
**Specifying Networks | |||
*Verification and Troubleshooting | |||
**Verifying RIP: show ip route | |||
**Verifying RIP: show ip protocols | |||
**Verifying RIP: debug ip rip | |||
**Passive Interfaces | |||
*Automatic Summarization | |||
**Modified Topology: Scenario B | |||
**Boundary Routers and Automatic Summarization | |||
**Processing RIP Updates | |||
**Sending RIP Updates | |||
**Advantages and Disadvantages of Automatic Summarization | |||
*Default Route and RIPv1 | |||
**Modified Topology: Scenario C | |||
**Propagating the Default Route in RIPv1 | |||
'''Readings:''' | '''Readings:''' | ||
Line 136: | Line 199: | ||
==Session 7: April 6== | ==Session 7: April 6== | ||
'''Topics:''' | '''Topics:''' | ||
* IP Addressing | *Chapter Introduction | ||
* | *Classful and Classless Addressing | ||
* Classless | **Classful IP Addressing | ||
**Classful Routing Protocol | |||
**Classless IP Addressing | |||
**Classless Routing Protocol | |||
*VLSM | |||
**VLSM in Action | |||
**VLSM and IP Addresses | |||
*CIDR | |||
**Route Summarization | |||
**Calculating Route Summarization | |||
'''Readings:''' | '''Readings:''' | ||
Line 155: | Line 227: | ||
==Session 8: April 13== | ==Session 8: April 13== | ||
'''Topics:''' | '''Topics:''' | ||
* RIP | *Chapter Introduction | ||
*RIPv1 Limitations | |||
**Lab Topology | |||
**RIP v1 Topology Limitations | |||
**RIP v1: Discontiguous Networks | |||
**RIP v1: No VLSM Support | |||
**RIP v1: No CIDR Support | |||
*Configuring RIPv2 | |||
**Enabling and Verifying RIP v2 | |||
**Auto-summary and RIP v2 | |||
**Disabling Auto-Summarization in RIP v2 | |||
**Verifying RIP v2 Updates | |||
*VLSM and CIDR | |||
**RIPv2 and VLSM | |||
**RIPv2 and CIDR | |||
*Verifying and Troubleshooting RIPv2 | |||
**Verifying and Troubleshooting Commands | |||
**Common RIPv2 issues | |||
**Authentication | |||
'''Readings:''' | '''Readings:''' | ||
Line 165: | Line 257: | ||
==Session 9: April 15== | ==Session 9: April 15== | ||
'''Topics:''' | '''Topics:''' | ||
* The Routing Table: | *Chapter Introduction | ||
*The Routing Table Structure | |||
**Lab Topology | |||
**Routing Table Entries | |||
**Level 1 Routes | |||
**Parent and Child Routes: Classful Networks | |||
**Parent and Child Routes: Classless Networks | |||
*Routing Table Lookup Process | |||
**Steps in the Route Lookup Process | |||
**Longest Match: Level 1 Network Routes | |||
**Longest Match: Level 1 Parent and Level 2 Child Routes | |||
*Routing Behavior | |||
**Classful and Classless Routing Behavior | |||
**Classful Routing Behavior: no ip classless | |||
**Classful Routing Behavior - Search Process | |||
**Classless Routing Behavior: ip classless | |||
**Classless Routing Behavior - Search Process | |||
'''Readings:''' | '''Readings:''' | ||
Line 175: | Line 283: | ||
==Session 10: April 20== | ==Session 10: April 20== | ||
'''Topics:''' | '''Topics:''' | ||
* EIGRP | *Chapter Introduction | ||
*Introduction to EIGRP | |||
**EIGRP: An Enhanced Distance Vector Routing Protocol | |||
**EIGRP Message Format | |||
**Protocol Dependent Modules (PDM) | |||
**RTP and EIGRP Packet Types | |||
**Hello Protocol | |||
**EIGRP Bounded Updates | |||
**DUAL: An Introduction | |||
**Administrative Distance | |||
**Authentication | |||
*Basic EIGRP Configuration | |||
**EIGRP Network Topology | |||
**Autonomous Systems and Process IDs | |||
**The router eigrp command | |||
**The network Command | |||
**Verifying EIGRP | |||
**Examining the Routing Table | |||
*EIGRP Metric Calculation | |||
**EIGRP Composite Metric and the K Values | |||
**EIGRP Metrics | |||
**Using the bandwidth Command | |||
**Calculating the EIGRP Metric | |||
*DUAL | |||
**DUAL Concepts | |||
**Successor and Feasible Distance | |||
**Feasible Successors, Feasibility Condition and Reported Distance | |||
**Topology Table: Successor and Feasible Successor | |||
**Topology Table: No Feasible Successor | |||
**Finite State Machine | |||
*More EIGRP Configurations | |||
**The Null0 Summary Route | |||
**Disabling Automatic Summarization | |||
**Manual Summarization | |||
**EIGRP Default Route | |||
**Fine-tuning EIGRP | |||
'''Readings:''' | '''Readings:''' | ||
Line 193: | Line 336: | ||
==Session 12: April 27== | ==Session 12: April 27== | ||
'''Topics:''' | '''Topics:''' | ||
* Link-State Routing Protocols | *Chapter Introduction | ||
*Link-State Routing | |||
**Link-State Routing Protocols | |||
**Introduction to the SPF Algorithm | |||
**Link-State Routing Process | |||
**Learning about Directly Connected Networks | |||
**Sending Hello Packets to Neighbors | |||
**Building the Link-State Packet | |||
**Flooding Link-State Packets to Neighbors | |||
**Constructing a Link-State Database | |||
**Shortest Path First (SPF) Tree | |||
*Implementing Link-State Routing Protocols | |||
**Advantages of a Link-State Routing Protocol | |||
**Requirements of a Link-State Routing Protocol | |||
**Comparison of Link-State Routing Protoco | |||
'''Readings:''' | '''Readings:''' | ||
Line 203: | Line 360: | ||
==Session 13: April 29== | ==Session 13: April 29== | ||
'''Topics:''' | '''Topics:''' | ||
* OSPF | *Chapter Introduction | ||
*Introduction to OSPF | |||
**Background of OSPF | |||
**OSPF Message Encapsulation | |||
**OSPF Packet Types | |||
**Hello Protocol | |||
**OSPF Link-state Updates | |||
**OSPF Algorithm | |||
**Administrative Distance | |||
**Authentication | |||
*Basic OSPF Configuration | |||
**Lab Topology | |||
**The router ospf Command | |||
**The network Command | |||
**OSPF Router ID | |||
**Verifying OSPF | |||
**Examining the Routing Table | |||
*The OSPF Metric | |||
**OSPF Metric | |||
**Modifying the Cost of the Link | |||
*OSPF and Multiaccess Networks | |||
**Challenges in Multiaccess Networks | |||
**DR/BDR Election Process | |||
**OSPF Interface Priority | |||
*More OSPF Configuration | |||
**Redistributing an OSPF Default Route | |||
**Fine-tuning OSPFls | |||
'''Readings:''' | '''Readings:''' |
Latest revision as of 17:42, 13 October 2010
Information Technology & Careers | Network Routers and Routing Fundamentals
CNT-2520-01 - 3 credits Instructor: Dr. Ben Franske Term: Spring 2010 Q2 (3/16/2010-5/13/2010) Meetings: T Th 10:00am-1:00pm Location: B143 |
This schedule provides an outline of the topics expected to be covered in this course as well as the readings and assignments due each week. Topics and readings may change in which case you will be notified in class or by e-mail and the latest version of this document is always available from the course wiki. Please have all readings completed prior to the start of each class and be prepared to take part in the discussion. Unless otherwise noted online quizzes and exams are due at 11:59pm on the date indicated.
Session 1: March 16
Topics:
- Chapter Introduction
- Inside the Router
- Routers are Computers
- Router CPU and Memory
- Internetwork Operating System
- Router Boot-up Process
- Router Interfaces
- Routers and the Network Layer
- CLI Configuration and Addressing
- Implementing Basic Addressing Schemes
- Basic Router Configuration
- Building the Routing Table
- Introducing the Routing Table
- Directly-Connected Networks
- Static Routing
- Dynamic Routing
- Routing Table Principles
- Path Determination and Switching Functions
- Packet Fields and Frame Fields
- Best Path and Metric
- Equal Cost Load Balancing
- Path Determination
- Switching Function
Readings:
Due:
Session 2: March 18
Topics:
- Chapter Introduction
- Routers and Network
- Role of the Router
- Introducing the Topology
- Examining the Connections of the Router
- Router Configuration Review
- Examining Router Interfaces
- Configuring an Ethernet Interface
- Verifying Ethernet interface
- Configuring A Serial Interface
- Examining Router Interfaces
- Exploring Directly Connected Networks
- Verifying Changes to the Routing Table
- Devices on Directly Connected Networks
- Cisco Discovery Protocol (CDP)
- Using CDP for Network Discovery
- Static Routes with "Next Hop" Addresses
- Purpose and Command Syntax of ip route
- Configuring Static Routes
- Routing Table Principles and Static Routes
- Resolving to an Exit Interface
- Static Routes with Exit Interfaces
- Configuring a Static Route with an Exit Interface
- Modifying Static Routes
- Verifying the Static Route Configuration
- Static Routes with Ethernet Interfaces
- Summary and Default Static Routes
- Summary Static Routes
- Default Static Route
- Managing and Troubleshooting Static Routes
- Static Routes and Packet Forwarding
- Troubleshooting a Missing Route
- Solving the Missing Route
Readings:
- Chapter 1
- Chapter 2
Due:
Session 3: March 23
Topics:
- Chapter Introduction
- Introduction and Advantages
- Perspective and Background
- Network discovery and routing table maintenance
- Advantages
- Classifying Dynamic Routing Protocols
- Overview
- IGP and EGP
- Distance Vector and Link State
- Classful and Classless
- Convergence
- Metrics
- Purpose of a Metric
- Metrics and Routing Protocols
- Load Balancing
- Administrative Distances
- Purpose of Administrative Distance
- Dynamic Routing Protocols
- Static Routes
- Directly Connected Networks
Readings:
- Chapter 3
Due:
- Chapter 1 Online Assessment
- Chapter 2 Online Assessment
Session 4: March 25
Topics:
- Chapter Introduction
- Introduction to Distance Vector Routing Protocols
- Distance Vector Routing Protocols
- Distance Vector Technology
- Routing Protocol Algorithms
- Routing Protocol Characteristics
- Network Discovery
- Cold Start
- Initial Exchange of Routing Information
- Exchange of Routing Information
- Convergence
- Routing Table Maintenance
- Periodic Updates: RIPv** and IGRP
- Bounded Updates: EIGRP
- Triggered Updates
- Random Jitter
- Routing Loops
- Definition and Implications
- Problem: Count to Infinity
- Setting a Maximum
- Preventing Routing Loops with Holddown Timers
- Split Horizon Rule
- Split Horizon with Poison Reverse or Route Poisoning
- IP and TTL
- Distance Vector Routing Protocols today
- RIP and EIGRP
Readings:
- Chapter 4
Due:
- Chapter 3 Online Assessment
Session 5: March 30
Topics:
- Chapter Introduction
- RIPv1: Distance Vector, Classful Routing Protocol
- Background and Perspective
- RIPv1 Characteristics and Message Format
- RIP Operation
- Administrative Distance
- Basic RIPv1 Configuration
- Basic RIPv1 Configuration
- Enabling RIP: router rip command
- Specifying Networks
- Verification and Troubleshooting
- Verifying RIP: show ip route
- Verifying RIP: show ip protocols
- Verifying RIP: debug ip rip
- Passive Interfaces
- Automatic Summarization
- Modified Topology: Scenario B
- Boundary Routers and Automatic Summarization
- Processing RIP Updates
- Sending RIP Updates
- Advantages and Disadvantages of Automatic Summarization
- Default Route and RIPv1
- Modified Topology: Scenario C
- Propagating the Default Route in RIPv1
Readings:
- Chapter 5
Due:
- Chapter 4 Online Assessment
Session 6: April 1
Topics:
- Project Advising Session: Your project group must make an appointment to meet with the instructor and present a project proposal.
Readings:
- Look at projects which have been completed in the past
Due:
- You must come to your meeting with at least one preferred project and one backup project
Session 7: April 6
Topics:
- Chapter Introduction
- Classful and Classless Addressing
- Classful IP Addressing
- Classful Routing Protocol
- Classless IP Addressing
- Classless Routing Protocol
- VLSM
- VLSM in Action
- VLSM and IP Addresses
- CIDR
- Route Summarization
- Calculating Route Summarization
Readings:
- Chapter 6
Due:
- Chapter 5 Online Assessment
NO CLASS: April 8
Topics:
Readings:
Due:
Session 8: April 13
Topics:
- Chapter Introduction
- RIPv1 Limitations
- Lab Topology
- RIP v1 Topology Limitations
- RIP v1: Discontiguous Networks
- RIP v1: No VLSM Support
- RIP v1: No CIDR Support
- Configuring RIPv2
- Enabling and Verifying RIP v2
- Auto-summary and RIP v2
- Disabling Auto-Summarization in RIP v2
- Verifying RIP v2 Updates
- VLSM and CIDR
- RIPv2 and VLSM
- RIPv2 and CIDR
- Verifying and Troubleshooting RIPv2
- Verifying and Troubleshooting Commands
- Common RIPv2 issues
- Authentication
Readings:
- Chapter 7
Due:
- Chapter 6 Online Assessment
Session 9: April 15
Topics:
- Chapter Introduction
- The Routing Table Structure
- Lab Topology
- Routing Table Entries
- Level 1 Routes
- Parent and Child Routes: Classful Networks
- Parent and Child Routes: Classless Networks
- Routing Table Lookup Process
- Steps in the Route Lookup Process
- Longest Match: Level 1 Network Routes
- Longest Match: Level 1 Parent and Level 2 Child Routes
- Routing Behavior
- Classful and Classless Routing Behavior
- Classful Routing Behavior: no ip classless
- Classful Routing Behavior - Search Process
- Classless Routing Behavior: ip classless
- Classless Routing Behavior - Search Process
Readings:
- Chapter 8
Due:
- Chapter 7 Online Assessment
Session 10: April 20
Topics:
- Chapter Introduction
- Introduction to EIGRP
- EIGRP: An Enhanced Distance Vector Routing Protocol
- EIGRP Message Format
- Protocol Dependent Modules (PDM)
- RTP and EIGRP Packet Types
- Hello Protocol
- EIGRP Bounded Updates
- DUAL: An Introduction
- Administrative Distance
- Authentication
- Basic EIGRP Configuration
- EIGRP Network Topology
- Autonomous Systems and Process IDs
- The router eigrp command
- The network Command
- Verifying EIGRP
- Examining the Routing Table
- EIGRP Metric Calculation
- EIGRP Composite Metric and the K Values
- EIGRP Metrics
- Using the bandwidth Command
- Calculating the EIGRP Metric
- DUAL
- DUAL Concepts
- Successor and Feasible Distance
- Feasible Successors, Feasibility Condition and Reported Distance
- Topology Table: Successor and Feasible Successor
- Topology Table: No Feasible Successor
- Finite State Machine
- More EIGRP Configurations
- The Null0 Summary Route
- Disabling Automatic Summarization
- Manual Summarization
- EIGRP Default Route
- Fine-tuning EIGRP
Readings:
- Chapter 9
Due:
- Chapter 8 Online Assessment
Session 11: April 22
Topics:
- Project / Lab Work Day
Readings:
Due:
Session 12: April 27
Topics:
- Chapter Introduction
- Link-State Routing
- Link-State Routing Protocols
- Introduction to the SPF Algorithm
- Link-State Routing Process
- Learning about Directly Connected Networks
- Sending Hello Packets to Neighbors
- Building the Link-State Packet
- Flooding Link-State Packets to Neighbors
- Constructing a Link-State Database
- Shortest Path First (SPF) Tree
- Implementing Link-State Routing Protocols
- Advantages of a Link-State Routing Protocol
- Requirements of a Link-State Routing Protocol
- Comparison of Link-State Routing Protoco
Readings:
- Chapter 10
Due:
- Chapter 9 Online Assessment
Session 13: April 29
Topics:
- Chapter Introduction
- Introduction to OSPF
- Background of OSPF
- OSPF Message Encapsulation
- OSPF Packet Types
- Hello Protocol
- OSPF Link-state Updates
- OSPF Algorithm
- Administrative Distance
- Authentication
- Basic OSPF Configuration
- Lab Topology
- The router ospf Command
- The network Command
- OSPF Router ID
- Verifying OSPF
- Examining the Routing Table
- The OSPF Metric
- OSPF Metric
- Modifying the Cost of the Link
- OSPF and Multiaccess Networks
- Challenges in Multiaccess Networks
- DR/BDR Election Process
- OSPF Interface Priority
- More OSPF Configuration
- Redistributing an OSPF Default Route
- Fine-tuning OSPFls
Readings:
- Chapter 11
Due:
- Chapter 10 Online Assessment
Session 14: May 4
Topics:
- Project / Lab Work Day
Readings:
Due:
- Chapter 11 Online Assessment
- Online Final Exam (Open 2:00pm-9:00pm)
Session 15: May 6
Topics:
- Final Skills Assessment By Appointment
Readings:
Due:
EXAM WEEK: May 11, 13
Topics:
- Final Skills Assessment By Appointment
Readings:
Due:
- Lab Reports (All Labs/Homework Due!)
- CNT Service Project(s)