Scribd
Upload
5 views5 pages

Routing Switching Detailed Summary No IPv6

The document summarizes the Routing and Switching Essentials course, focusing on static and dynamic routing, distance vector and link-state protocols, and routing tables. It highlights the characteristics, advantages, and disadvantages of both static and dynamic routing methods, as well as the functioning of distance vector and link-state protocols. Additionally, it provides an overview of routing tables and compares various routing protocols based on their metrics and scalability.

Uploaded by

malzeedi9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views5 pages

Routing Switching Detailed Summary No IPv6

The document summarizes the Routing and Switching Essentials course, focusing on static and dynamic routing, distance vector and link-state protocols, and routing tables. It highlights the characteristics, advantages, and disadvantages of both static and dynamic routing methods, as well as the functioning of distance vector and link-state protocols. Additionally, it provides an overview of routing tables and compares various routing protocols based on their metrics and scalability.

Uploaded by

malzeedi9
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Comprehensive Summary: Routing and Switching Essentials (Without IPv6)

### Introduction
This document provides a **detailed summary** of the Routing and Switching
Essentials course,
focusing on **static and dynamic routing, distance vector and link-state protocols, and
routing tables**.

---

## Chapter 6: Static Routing

### Definition and Importance:


Static routing is a manual method where administrators configure routes on a router.
This is ideal for **small, stable networks** where changes do not occur frequently.

### Key Features:


- **Manual configuration:** Routes must be entered manually by the administrator.
- **No automatic updates:** Unlike dynamic routing, static routes do not update when
network topology changes.
- **Security and control:** Since no routing updates are shared between routers, static
routing is more secure.
- **Lower resource consumption:** Does not require CPU processing to recalculate
routes.

### Configuration Commands:


- To add a static route:
```
Router(config)# ip route <destination-network> <subnet-mask> <next-hop-IP>
```
- To remove a static route:
```
Router(config)# no ip route <destination-network> <subnet-mask> <next-hop-IP>
```

### Advantages and Disadvantages:


| Advantages | Disadvantages |
|------------|--------------|
| Simple and predictable | Does not scale well for large networks |
| More secure (no updates shared) | Requires manual changes for every network update
|
| Less CPU and memory usage | Difficult to manage in dynamic environments |

---

## Chapter 7a: Dynamic Routing

### Definition:
Dynamic routing allows routers to **exchange routing information** and **adjust
automatically** to network changes.

### Key Protocols:


1. **RIP (Routing Information Protocol)**: Uses hop count as a metric (max 15 hops).
2. **EIGRP (Enhanced Interior Gateway Routing Protocol)**: Uses bandwidth, delay, and
reliability as metrics.
3. **OSPF (Open Shortest Path First)**: Uses link-state database and SPF algorithm.

### Advantages and Disadvantages:


| Advantages | Disadvantages |
|------------|--------------|
| Automatically adapts to topology changes | Higher CPU and memory usage |
| Reduces administrative overhead | More complex to configure and troubleshoot |
| Scales well for large networks | Potential for routing loops if not properly managed |
---

## Chapter 7b: Distance Vector Protocols

### How They Work:


- Routers **periodically send** updates to neighbors.
- Each router **only knows about its neighbors** and does not have a full network view.
- Examples: RIP, IGRP.

### Characteristics:
- Uses **hop count** or **composite metrics**.
- **Slow convergence** due to periodic updates.
- Susceptible to **routing loops**.

### Routing Algorithm:


- Based on **Bellman-Ford algorithm**.
- Updates are sent in a **distance and direction format**.

---

## Chapter 7c: Link-State Protocols

### How They Work:


- Each router **maintains a complete network map**.
- Updates are only sent when a **topology change** occurs.
- Examples: OSPF, IS-IS.

### Characteristics:
- Uses **Dijkstra’s SPF algorithm**.
- **Fast convergence** compared to distance vector protocols.
- More **CPU-intensive** due to full topology calculations.

### OSPF Example:


- Builds **Link-State Database (LSDB)**.
- Uses **areas** to optimize large networks.

---

## Chapter 7d: The Routing Table

### Components of a Routing Table:


1. **Directly connected networks**: Interfaces that are directly attached.
2. **Static routes**: Manually added routes.
3. **Dynamically learned routes**: Routes from RIP, OSPF, or EIGRP.

### Route Types:


- **Level 1 Route**: Classful networks, default routes, supernets.
- **Level 2 Route**: Subnet routes.
- **Ultimate Route**: Contains next-hop IP or exit interface.

### Routing Lookup Process:


1. Check for **level 1 ultimate routes**.
2. If a **parent route** is found, check **child routes**.
3. If no match is found, use **default route or drop the packet**.

---

## Comparison of Routing Protocols

| Protocol | Type | Metric | Convergence Speed | Scalability |


|----------|------|--------|------------------|-------------|
| RIP | Distance Vector | Hop Count | Slow | Low |
| EIGRP | Distance Vector | Composite | Fast | High |
| OSPF | Link-State | Cost | Fast | High |
| BGP | Path Vector | Policy-based | Slow | Very High |
---

### Conclusion:
Routing and switching are **core components of network infrastructure**.
Understanding the differences between **static vs. dynamic routing**, **distance
vector vs. link-state protocols**, and the **structure of routing tables** is essential for
**network engineers**.

You might also like