English | MP4 | AVC 1280×720 | AAC 44KHz 2ch | 7h 04m | 4.68 GB
There are many elements to a networking system, including hosts, virtual hosts, routers, virtual routers, routing protocols, discovery protocols, etc. Each protocol and device (whether virtual or physical) is generally studied as an individual thing. It is not common to consider all these parts as components of a system that works together to carry traffic through a network. To show how all these components work together to form a complete system, this video course presents a series of walk throughs showing the processing involved in various kinds of network events, and how control planes use those events to build the information needed to carry traffic through a network.
One of the foremost internetworking experts, Russ White leverages his decades of experience in building and troubleshooting large scale networks at the likes of Cisco, LinkedIn, and Juniper to present you with a proven methodology that will help you understand why and how networking technologies work. You will learn to consider the specific problems being solved, why specific solutions are chosen, and how solutions relate to one another. In addition to providing a solid overview of many common protocols and solutions, this valuable insight helps you develop the ability to understand why you should make particular implementation decisions and what the tradeoffs are in each situation, enhance your troubleshooting skills by understanding how each technology works and what problems might arise with any solution, and finally to quickly understand new technologies as they are released by relating them to previously developed technologies.
The course begins with the discovery of the information a host needs to send traffic and the forwarding process within a network device. The first walk through is simple, but they will build in complexity until traffic carried in an overlay through a hardware optimized forwarding plane is explained. Along the way, the four problems a control plane must solve will be exposed along with the solutions commonly used to solve these problems. After this basic information is covered, more advanced situations will be considered, including network resilience from a control plane perspective and fast reroute techniques.
Learn the problems and solutions associated with transporting packets through networks, including:
- Transport solutions
- Routing protocol basics
- Control plane examples and convergence
- Control plane resilience
This video course addresses fundamental concepts in a way that is applicable for many kinds of students in a wide variety of learning situations, including:
- Beginning learners just starting a career in network engineering
- Intermediate level network engineers who have some experience, and perhaps an associates or professional
- level certification, who would like to take their career to the next level
- Experienced network engineers who would like to fill in their knowledge, or understand why things work the way they do, rather than simply how they work
- Programmers who would like to understand the operation of networks in order to improve their ability to write network-based applications
- Development operations engineers who would like to understand why networks operate the way they do, and possibly migrate into full time network engineering roles
- College students who are taking courses in or majoring in information technology who would like to supplement their learning in the network engineering space
- College students taking a course that uses the Problems and Solutions in Network Engineering book as course material, and would like additional knowledge to help them to better understand the material
Lesson 1: Transport
Networks are primarily designed to do one thing–transport data, in the form of packets, from one device to another. This lesson covers the process, beginning with information starting within the host and carrying that data across the network. Basic concepts such as multiplexing, marshaling, error control, and flow control will be covered.
Lesson 2: Routing Protocol Basics
Carrying information across a network requires there to be a path through the network–but not just any old path will do. Instead, the path chosen must be loop-free, so traffic is delivered quickly, in order, and without loss. This lesson will explore the concept of a loop-free path, and explain several methods used in computer networks for computing loop-free paths.
Lesson 3: Abstraction
Networks contain a lot of information about each destination that can be reached (devices attached to the network), links between network devices, metrics, topology changes, etc. The amount of information in a network can quickly overwhelm network devices, causing them to fail, or simply making the network run inefficiently. This lesson will explore the concept of abstraction in network control planes. Two specific kinds of abstraction will be considered, summarization and aggregation, and the tradeoffs involved in removing information through abstraction thought through.
Lesson 4: Control Plane Examples
Understanding the theory behind how to discover the networks topology and reachable destinations is important, but how are these things implemented in real protocols? This lesson uses widely deployed protocols as an example, showing how the theory in the last three lessons is used to implement real-world solutions.
Lesson 5: Control Plane Convergence
Control planes must not only discover the network topology and compute loop-free paths through the network, they must also react to changes in the topology of the network quickly and efficiently. This lesson considers the convergence properties of the three major kinds of control planes: distance-vector, path-vector, and link-state.
Lesson 6: Control Plane Resilience
Faster convergence is often better. The fewer packets a network drops in response to link or device failures, the more reliable the network will be for the applications and services relying on it. This lesson will explore fast convergence technologies in relation to network control planes.
Table of Contents
1 How Networks Really Work – Introduction
2 Learning objectives
3 Host Traffic
4 One Hop IPv4
5 One Hop IPv6
6 Switching Process
9 Segment Routing
10 Host Packet Path
11 VxLAN VPLS Packet Path Example
12 eVPN Packet Path Example
15 Learning objectives
16 Loop-Free Paths
18 Dijkstra 1
19 Dijkstra 2
20 Dijkstra 3
21 Control Plane Distribution
22 Learning objectives
23 Basic Theory
24 Abstraction in Routing
25 Leaky Abstractions
26 Fate Sharing
27 Learning objectives
28 IS-IS on Point-to-Point Links
29 IS-IS on Multiaccess Links
30 IS-IS Aggregation
31 BGP Loop-Free Paths
32 BGP Intra-AS Models
33 Four Things Review
34 Learning objectives
35 Convergence Basics
36 IS-IS Convergence
37 IS-IS Convergence With Flooding Domains
38 BGP Convergence–Part 1
39 BGP Convergence–Part 2
40 Learning objectives
41 Convergence Steps
42 Resilience Theory
44 Fast Hellos
45 BGP Resilience
46 Link State Resilience
47 Graceful Restart
48 Loop Free Alternate
49 How Networks Really Work – Summary