Switching

MAC address table

topologies

multiple frame transmissions, and MAC address table

instability

redundant switch topology issues

Describe the purpose and operation of the STP
Explain how to implement STP to solve the problems

3
Transparent Bridging (Switching) Tasks

Forward frames transparently

Learn which port to use for each MAC
address

address hasn’t been learned yet

include the destination address

Flood broadcasts and multicasts

◦ Address learning
◦
◦ Loop avoidance
5
Cut-Through

Store and Forward

frame.
and checked before
forwarding.
Fragment-Free

MAC Address Table

Initial MAC address table is empty.

7
Station A sends a frame to station C.
Switch caches the MAC address of station A to port E0 by
learning the source address of data frames.
The frame from station A to station C is flooded out to all
ports except port E0 (unknown unicasts are flooded). 8

Station D sends a frame to station C.

Switch caches the MAC address of station D to port E3 by
learning the source address of data frames.
The frame from station D to station C is flooded out to all
ports except port E3 (unknown unicasts are flooded).
9
Filtering Frames

Station A sends a frame to station C.

10

Station D sends a broadcast or multicast frame.

than the originating port.

11
 Redundant Topology

12

Broadcast Storms

• Host X sends a broadcast (such as ARP frame).

• Switches continue to propagate broadcast traffic endlessly.
• Switches flood broadcast frames to all ports except the port
on which the frame was received
13
 Multiple Frame Copies

Host X sends a unicast frame to router Y.

MAC address of router Y has not been learned by either
switch yet.
14

MAC Database Instability

• Host X sends a unicast frame to router Y.

• MAC address of routerY has not been learned by either switch.
• Switches A and B learn the MAC address of host X on port 0.
• The frame to router Y is flooded.
• Switches A and B incorrectly learn the MAC address of host X on
port 1
15
 Spanning-Tree Protocol

topology.

active path to each network segment at any given time.

•

Spanning-Tree Operation
Elects one root bridge: Selects the root port on the Selects the designated STP
has a process to nonroot bridge: STP establishes port on each segment: On elect
a root bridge. Only one root port on each each segment, STP one bridge
can act as nonroot bridge. The root port establishes one designated the root
bridge in a is the lowest-cost path from port. The designated port given
network. On the the nonroot bridge to the root is selected on the bridge root
bridge, all ports are bridge. Root ports are in the that has the lowest-cost
designated ports. forwarding state. path to the root bridge.
Designated ports are in

are designated to
forward traffic for a
given segment.
• One root bridge per network
• One root port per nonroot bridge
• One designated port per segment
• Nondesignated ports are unused
17
 BPDU = Bridge Protocol Data Unit
(default: sent every 2 seconds)
Root bridge = Bridge with the lowest Bridge ID
Bridge ID =

In this example, which switch has the lowest Bridge ID?

18

Spanning-Tree Port States

19
Spanning-Tree Path Cost

based on bandwidth of a link.

20

Lowest BID

root port root port

designated port

21
Spanning-Tree Convergence

state.

topology changes.
Fast convergence is a desirable network feature

normal convergence time is 30 to 50 seconds for

22

Routing

23
 OSPF

dynamic routing
Identify the classes of routing protocols

24

What Is Routing?

Toroute, a router needs to do the following:

◦ Know the destination address
◦ Identify the sources it can learn from
◦ Discover possible routes
◦ Select the best route
◦ Maintain and verify routing information
25
What Is Routing? (Cont.)

E0

26

Identifying Static and Dynamic Routes

dynamic routes.
There are two ways to tell the router how to

connected
Static Route

into the router manually

Dynamic Route
Uses a route that a network routing protocol

27
Static Routes

packets take when moving between a source and a

destination.

network to allow communications to occur.

28

This is a unidirectional route.

29
Default Routes

networks beyond router A.

30

What Is a Routing Protocol?

Routing protocols
are used between

paths and maintain

routing tables.

Once the path is

can route a routed

protocol.

31
 Autonomous Systems:
Interior or Exterior Routing Protocols

• An autonomous system is a collection of networks under a

• IGPs operate within an autonomous system.

• EGPs connect different autonomous systems.
32

•
same time.
• AD value is used to rate the trustworthiness of each routing
information source
33
Default Administrative Distance Values

34

35
Classful Routing Overview

subnet masks is assumed.

foreign networks.
Examples of classful routing protocols:
◦ RIP Version 1 (RIPv1)
◦ IGRP

36

Classless Routing Overview

route advertisement.

masking (VLSM).

network.
Examples of classless routing protocols:
◦ RIP Version 2 (RIPv2)
◦ EIGRP
◦ OSPF
◦ IS-IS

37
 38

Selecting Routing Protocols

They all have the same general goal:

routers

Metrics supported
Dynamic versus static and default
Distance-vector versus link-state
Classful versus classless
Scalability

39
Routing Protocol Metrics
decide which route to a network is better than another

◦
◦ Delay - time
◦ Load - amount of network traffic
◦ Reliability - error rate
◦
through before reaching the destination network
◦
administrator

40

Routing Protocol Metrics

41
 Distance-Vector Routing
(vector) to each network, and the distance to each network

local segments
Router updates the routing table based on received broadcasts

42

• As the distance vector network discovery process proceeds,

routers discover the best path to nondirectly connected

neighbor
•
43
 Link-State Routing

change

neighbors

44

Link-State Routing

build routing tables

based on a topology
database.

•
between all the routers to describe the state of a network.
•
the routing table.
45
Distance-Vector Vs. Link-State
Distance-vector algorithms keep a list of

information

routers and links between them

◦
a graph instead of a list
◦

shortest path between any two nodes

46

Choosing Between

Choose Link-State

administrators

a big concern critical

47
Routing Information Protocol (RIP)

environments
◦ RIP Version 1 is documented in RFC 1058 (1988)
◦ RIP Version 2 is documented in RFC 2453 (1998)
Easy to configure and troubleshoot

25 routes per packet

48

RIP V2 Features
Includes the subnet mask with route updates
◦ Supports prefix routing (classless routing, supernetting)
◦ Supports variable-length subnet masking (VLSM)

crackers sending routing updates

49
IGRP Solved Problems with RIP

◦ IGRP supports 255 hops

RIP uses just one metric (hop count)
◦

RIP's 30-second update timer

◦ IGRP uses 90 seconds

50

EIGRP

quickly

full routing table

Updates are delivered reliably

Same metric as IGRP

51
Open Shortest Path First (OSPF)
Open standard, defined in RFC 2328
Adjusts to changes quickly
Supports very large internetworks
Does not use a lot of bandwidth
Authenticates protocol exchanges to meet security goals

network or within a defined area of the internetwork.

52

OSPF Metric

interface on the path to a network.The lower the

cost, the more likely the interface is to be used to
forward data traffic.
On a Cisco router,the cost of an interface defaults to
100,000,000 divided by the bandwidth for the

has a cost of 1.

53
 Routers (ABRs)
• Link-state protocols use a

hierarchy
•
of networks. Areas are

• An AS consists of a
collection of networks
under a common

The backbone area is the transition area because all other areas
communicate through it. 54

Border Gateway Protocol (BGP)

routing information
Exterior routing protocol
Used on the Internet among large ISPs and major companies
Supports route aggregation

55
Routing Protocols
in the Enterprise Architecture

56

Summary (switching)
creating dedicated network segments and interconnecting the
segments.

store and forward, cut-through, and fragment-free.

When a frame arrives with a known destination address, it is

station.

and devices, which can introduce problems, such as broadcast

A broadcast storm is when each switch on a redundant network

floods broadcast frames endlessly. 57
Summary (switching)

receiving protocol.

arrive on different ports of a switch.

up of the bridge’s priority and MAC address.

transitioning some blocked ports to the forwarding state.

58

Summary (routing)
Routing is the process by which an item gets from one location to
another

when the route from a source to a destination is not known.

Dynamic routing relies on a routing protocol to disseminate

router when it communicates with neighboring routers.

its neighbors. Link-state routing algorithms maintain a complex

awareness of distant routers.

each
59