Loading learning content...
The repeater and hub solved the problem of physical signal extension but introduced a critical limitation: as networks grew, the single collision domain became a performance bottleneck. Every device competed for the same bandwidth, collisions increased proportionally with device count, and network performance degraded unacceptably.
The bridge represented a conceptual breakthrough—the first networking device to operate at the Data Link Layer (Layer 2) of the OSI model. Instead of blindly repeating every signal, a bridge examines each frame's destination MAC address and makes an intelligent forwarding decision: send the frame only where it's needed, or drop it if the destination is on the same segment as the source.
This seemingly simple intelligence—learning which devices are connected to which ports and forwarding selectively—transformed network design. Suddenly, large networks could be segmented into smaller, independent collision domains, each operating at full efficiency.
This page provides comprehensive coverage of network bridges—their operational principles, MAC address learning algorithms, forwarding table management, store-and-forward architecture, collision domain segmentation, bridge types, and the fundamental concepts that directly evolved into modern switch technology.
A bridge is a network device that operates at the Data Link Layer (Layer 2) of the OSI model. It connects two or more network segments and makes forwarding decisions based on MAC addresses contained within each frame. This represents a fundamental shift from the Physical Layer operation of repeaters and hubs.
Core Bridge Characteristics:
Bridge vs. Repeater/Hub: Conceptual Comparison:
| Aspect | Repeater/Hub (Layer 1) | Bridge (Layer 2) |
|---|---|---|
| Unit of Processing | Bits (electrical signals) | Frames (structured data) |
| Address Awareness | None | MAC addresses |
| Forwarding Decision | Broadcast (repeat to all) | Selective (forward or filter) |
| Collision Domains | Extends (single domain) | Segments (multiple domains) |
| Error Handling | None (repeats errors) | CRC validation, drop bad frames |
| Processing Delay | Minimal (~bit times) | Moderate (~frame time) |
| Learning | None | Automatic MAC learning |
Historical Context:
Bridges emerged in the mid-1980s as networks grew beyond what single collision domains could efficiently handle. The theoretical foundation was laid by Radia Perlman and others at Digital Equipment Corporation, who developed the spanning tree algorithm (which we'll cover in a later module) to enable bridges to operate in redundant topologies.
The term 'bridge' reflects the device's original use case: connecting two existing LAN segments—'bridging' between them—rather than the multi-port design we now associate with switches.
The defining characteristic of bridge operation is the store-and-forward architecture. Unlike repeaters that immediately retransmit incoming signals, bridges receive and buffer the complete frame before making a forwarding decision.
The Store-and-Forward Process:
┌─────────────────────────────────────────────────────────────────┐
│ Bridge Store-and-Forward Operation │
└─────────────────────────────────────────────────────────────────┘
Incoming Frame Bridge Processing
───────────── ──────────────────
┌──────────────────────┐
│ Preamble + SFD │ ──► Synchronize, detect frame start
├──────────────────────┤
│ Destination MAC │ ──► Read destination for forwarding
├──────────────────────┤
│ Source MAC │ ──► Learn: associate with ingress port
├──────────────────────┤
│ Type/Length │ ──► Store in buffer
├──────────────────────┤
│ Payload │ ──► Store in buffer (up to 1500 bytes)
├──────────────────────┤
│ FCS (CRC-32) │ ──► Validate entire frame integrity
└──────────────────────┘
│
▼
┌────────────────┐
│ CRC Valid? │
└───────┬────────┘
│
┌───────────────┴───────────────┐
│ │
▼ ▼
┌─────────┐ ┌─────────────┐
│ Yes │ │ No │
└────┬────┘ └──────┬──────┘
│ │
▼ ▼
Lookup destination Drop frame
in forwarding table (no forwarding)
Benefits of Store-and-Forward:
Error Isolation: By validating the FCS (Frame Check Sequence) before forwarding, bridges prevent corrupted frames from propagating. A frame damaged on one segment is discarded rather than wasting bandwidth on all segments.
Speed Buffering: Store-and-forward bridges can connect segments of different speeds. A 10 Mbps segment can communicate with a 100 Mbps segment; the bridge buffers frames as needed to accommodate the speed difference.
Complete Address Information: The bridge has access to both source and destination MAC addresses before making any forwarding decision, enabling accurate learning and forwarding.
Frame Filtering: Bridges can examine additional frame fields and implement filtering rules (in advanced implementations) based on frame content.
Latency Implications:
Store-and-forward introduces latency equal to the time required to receive the entire frame plus processing time:
Latency = Frame Reception Time + Processing Time + Transmission Time
For a 1518-byte frame at 10 Mbps:
- Reception: 1518 × 8 bits ÷ 10 Mbps = 1,214.4 μs ≈ 1.2 ms
- Processing: typically 10-100 μs
- Transmission: same as reception on equal-speed port
Total: ~2.5 ms per bridge hop (worst case)
This latency was considered significant in early networks but is negligible in modern switched networks with microsecond-level processing.
Some bridges (and later switches) implemented 'cut-through' forwarding, which begins transmitting the frame after reading only the destination address, before the entire frame is received. This reduces latency but cannot perform CRC validation, allowing corrupted frames to propagate. Most modern switches use variants that balance latency and error checking.
The bridge's ability to learn MAC addresses automatically—without any manual configuration—is among its most valuable features. This transparent learning process builds the forwarding table dynamically as the network operates.
The Learning Algorithm:
When a bridge receives a frame on any port:
Why Source Address?
The learning algorithm uses the source MAC address because:
| MAC Address | Port | Age (seconds) | Type |
|---|---|---|---|
| 00:1A:2B:3C:4D:5E | Port 1 | 15 | Dynamic |
| 00:1A:2B:3C:4D:5F | Port 1 | 45 | Dynamic |
| 00:2C:4E:6A:8C:12 | Port 2 | 3 | Dynamic |
| 00:3D:5F:71:93:AB | Port 2 | 120 | Dynamic |
| 00:4E:60:82:A4:CD | Port 3 | 0 | Dynamic |
| FF:FF:FF:FF:FF:FF | All | — | Static (Broadcast) |
Learning Walkthrough Example:
Consider a two-port bridge connecting Segment A (Port 1) and Segment B (Port 2):
Initial State: Forwarding table is empty
Step 1: Device A1 (MAC: AA:AA:AA:AA:AA:AA) on Segment A
sends a frame to Device B1
Bridge receives frame on Port 1
Source MAC: AA:AA:AA:AA:AA:AA
Action: Learn AA:AA:AA:AA:AA:AA → Port 1
Forwarding Table:
| AA:AA:AA:AA:AA:AA | Port 1 | Age: 0 |
Step 2: Device B1 (MAC: BB:BB:BB:BB:BB:BB) on Segment B
sends a reply to Device A1
Bridge receives frame on Port 2
Source MAC: BB:BB:BB:BB:BB:BB
Action: Learn BB:BB:BB:BB:BB:BB → Port 2
Forwarding Table:
| AA:AA:AA:AA:AA:AA | Port 1 | Age: 5 |
| BB:BB:BB:BB:BB:BB | Port 2 | Age: 0 |
Step 3: Device A2 (MAC: CC:CC:CC:CC:CC:CC) on Segment A
sends a frame to Device B1
Bridge receives frame on Port 1
Source MAC: CC:CC:CC:CC:CC:CC
Action: Learn CC:CC:CC:CC:CC:CC → Port 1
Forwarding Table:
| AA:AA:AA:AA:AA:AA | Port 1 | Age: 10 |
| BB:BB:BB:BB:BB:BB | Port 2 | Age: 5 |
| CC:CC:CC:CC:CC:CC | Port 1 | Age: 0 |
This passive learning process continues as long as the bridge operates, building a complete map of MAC address locations without any administrative intervention.
The bridge learns a device's location when that device transmits. A silent device—one that only receives traffic—will never appear in the forwarding table. During the initial period after startup, or when communicating with new devices, the bridge may not know the destination location and must flood the frame to all ports.
After learning the source address location, the bridge makes a forwarding decision based on the frame's destination MAC address. This decision determines whether to forward, filter, or flood the frame.
The Forwarding Algorithm:
RECEIVE frame on port P:
1. Learn source_MAC → port P (as described above)
2. Extract destination_MAC from frame
3. IF destination_MAC is broadcast (FF:FF:FF:FF:FF:FF)
OR destination_MAC is multicast (01:xx:xx:xx:xx:xx):
→ FLOOD: Forward to ALL ports except port P
4. ELSE lookup destination_MAC in forwarding table:
4a. IF destination_MAC found AND mapped to port P:
→ FILTER: Do not forward (destination on same segment)
4b. IF destination_MAC found AND mapped to port Q (Q ≠ P):
→ FORWARD: Send frame out port Q only
4c. IF destination_MAC NOT found in table:
→ FLOOD: Forward to ALL ports except port P
(Unknown unicast flooding)
Practical Examples:
Example 1: Known Unicast
Frame arrives on Port 1:
Source: AA:AA:AA:AA:AA:AA
Destination: BB:BB:BB:BB:BB:BB
Forwarding Table:
| BB:BB:BB:BB:BB:BB | Port 2 |
Decision: FORWARD to Port 2 only
Result: Port 2 receives frame; Ports 3, 4, ... do not
Example 2: Same-Segment Traffic (Filtering)
Frame arrives on Port 1:
Source: AA:AA:AA:AA:AA:AA
Destination: CC:CC:CC:CC:CC:CC
Forwarding Table:
| CC:CC:CC:CC:CC:CC | Port 1 |
Decision: FILTER (drop the frame)
Result: No ports receive forwarded frame
Reason: Source and destination are on the same segment
Example 3: Unknown Destination
Frame arrives on Port 1:
Source: AA:AA:AA:AA:AA:AA
Destination: DD:DD:DD:DD:DD:DD
Forwarding Table:
| DD:DD:DD:DD:DD:DD | (not found) |
Decision: FLOOD to all ports except Port 1
Result: Ports 2, 3, 4, ... all receive the frame
Reason: Bridge doesn't know where DD:DD:DD:DD:DD:DD is located
Example 4: Broadcast
Frame arrives on Port 2:
Source: BB:BB:BB:BB:BB:BB
Destination: FF:FF:FF:FF:FF:FF (broadcast)
Decision: FLOOD to all ports except Port 2
Result: Ports 1, 3, 4, ... all receive the frame
Reason: Broadcasts must reach all devices
While bridges segment collision domains, they do NOT segment broadcast domains. All broadcast frames flood through all bridge ports. This is why routers—operating at Layer 3—are needed to segment broadcast domains and why VLANs were developed to create logical broadcast domain boundaries.
Network topology is not static. Devices are added, removed, moved between ports, and powered off. The bridge's forwarding table must adapt to these changes automatically. The aging mechanism ensures stale entries are removed, keeping the table accurate.
The Aging Process:
Each forwarding table entry has an associated age timer:
Why Aging is Necessary:
Aging Timer Tuning:
The default 300-second aging time balances two competing concerns:
| Short Aging Time (e.g., 30 seconds) | Long Aging Time (e.g., 1800 seconds) |
|---|---|
| Fast adaptation to topology changes | Entries persist longer, less flooding |
| More unknown unicast flooding | Longer black hole period after device moves |
| Smaller forwarding table | Larger forwarding table |
| Higher CPU utilization (frequent updates) | Lower CPU utilization |
Typical recommendations:
Static Entries:
Network administrators can create static entries that never age:
Static Entry: 00:11:22:33:44:55 → Port 2 (never ages)
Use cases:
- Critical servers that must always be reachable
- Security: static entry for known legitimate devices
- Special handling for specific MAC addresses
Static entries override dynamic entries and prevent learning-based updates. This provides guaranteed forwarding behavior but requires manual maintenance.
When a device moves and transmits from its new location, the bridge immediately updates the forwarding table entry to reflect the new port. Aging is not required for device movement detection—learning handles this. Aging is specifically for removing entries for devices that have stopped transmitting entirely.
The bridge's most significant contribution to network performance is collision domain segmentation. Each bridge port creates an independent collision domain, allowing simultaneous transmissions on different segments without interference.
Understanding Collision domain Segmentation:
Without Bridge (Hub-based network) With Bridge
───────────────────────────────── ───────────
┌─────────────────────┐ Segment A Segment B
│ Single Hub │ (Port 1) (Port 2)
└─┬───┬───┬───┬───┬───┘ │ │
│ │ │ │ │ │ ┌──────┐ │
A1 A2 A3 B1 B2 B3 │ │Bridge│ │
│ └──┬───┘ │
━━━━━━━━━━━━━━━━━━━━━━━━━━━━ │ │ │
All 6 devices in ONE collision ┌──┴──┐ │ ┌───┴───┐
domain. If A1 and B2 transmit │ Hub │ │ │ Hub │
simultaneously → COLLISION └┬─┬─┬┘ │ └┬──┬──┬┘
│ │ │ │ │ │
A1 A2 A3 B1 B2 B3
━━━━━━━━ ━━━━━━━━
Collision Collision
Domain 1 Domain 2
A1 and B1 can transmit
SIMULTANEOUSLY!
Performance Impact of Segmentation:
Consider a network with 6 devices, each generating 2 Mbps of traffic:
Without Bridge (single 10 Mbps collision domain):
With Bridge (two segments, each with 3 devices):
But it gets even better: If most traffic is local (A1↔A2, B1↔B2), the bridge filters this traffic. Cross-segment traffic might be only 2 Mbps total:
Each segment operates independently with comfortable utilization, and the bridge handles only the inter-segment traffic.
Aggregate Bandwidth Enhancement:
| Configuration | Total Network Capacity |
|---|---|
| 6-port hub | 10 Mbps (shared) |
| 3-port hub + bridge + 3-port hub | 10 Mbps per segment, 20 Mbps aggregate* |
| 6-port bridge (each port separate) | 10 Mbps per port, 60 Mbps aggregate* |
*Aggregate capacity assumes no single conversation needs to exceed the bottleneck link (bridge inter-port) bandwidth.
This is why microsegmentation—connecting each device to its own bridge/switch port—became the standard practice. The evolution toward per-device switching maximizes aggregate bandwidth and eliminates collisions entirely.
While bridges excellently segment collision domains, they do NOT segment broadcast domains. All broadcasts flood through all ports. A broadcast storm on one segment floods through the bridge to all segments. This limitation is why routers (Layer 3) or VLANs are required for broadcast domain control.
Bridges evolved into several types to address different network requirements. Understanding these variations illuminates the path from early bridges to modern switches.
Transparent Bridges:
The most common type, transparent bridges operate invisibly to end devices:
Transparent bridges are the direct ancestors of modern Ethernet switches.
Source-Route Bridges:
Used primarily in IBM Token Ring networks, source-route bridges required hosts to determine the path through the network:
Translational Bridges:
These bridges connected networks using different Layer 2 protocols:
| Type | Learning Method | Path Determination | Configuration Required | Use Case |
|---|---|---|---|---|
| Transparent | Automatic MAC learning | Bridge decides | None on hosts | Ethernet LANs |
| Source-Route | Host discovers | Host specifies path | Special protocols | Token Ring (obsolete) |
| Source-Route Transparent (SRT) | Both | Auto-detect method | Minimal | Mixed environments |
| Translational | Varies | Protocol conversion | Significant | Multi-protocol (obsolete) |
Forwarding Methods:
Store-and-Forward:
Cut-Through:
Fragment-Free (Modified Cut-Through):
Adaptive:
Early bridges had limited forwarding table capacity (hundreds to low thousands of entries). Enterprise networks could exceed these limits, causing unknown unicast flooding. Modern switches support hundreds of thousands to millions of MAC addresses, but table capacity remains a consideration in large data center deployments.
While bridges represented a fundamental advance over hubs, they carried limitations that drove further development. Understanding these limitations explains the evolution to modern switches.
Port Density Limitations:
Early bridges typically had only 2-4 ports:
The desire for higher port density drove switch development—essentially multi-port bridges with optimized hardware.
Processing Performance:
Software-based forwarding in early bridges created bottlenecks:
Modern switches use ASICs (Application-Specific Integrated Circuits) for wire-speed forwarding.
Broadcast Domain Persistence:
As discussed, bridges do not segment broadcast domains:
Evolution to Switches:
The network switch emerged as the hybrid successor to bridges and hubs:
| Characteristic | Bridge | Switch |
|---|---|---|
| Ports | 2-4 typical | 8-48+ typical |
| Forwarding | Software (CPU) | Hardware (ASIC) |
| Performance | Thousands fps | Millions to billions fps |
| Latency | Milliseconds | Microseconds |
| Cost per port | High | Low (commodity) |
| Management | Limited | Full SNMP, web, CLI |
| VLANs | None originally | Standard feature |
The term 'switch' emerged to differentiate high-performance, high-port-count devices from traditional bridges. Technically, switches ARE bridges—they perform the same Layer 2 forwarding based on MAC addresses. The distinction is commercial and performance-based, not architectural.
Modern switches are multi-port bridges with:
There was no sharp dividing line between bridges and switches. Throughout the 1990s, products ranged from 2-port software bridges to 48-port hardware switches, with every combination in between. Today, the term 'bridge' is largely historical; 'switch' has become the universal term for Layer 2 forwarding devices.
We have thoroughly explored the network bridge—the first Layer 2 device and the conceptual foundation for all modern switch technology. Let's consolidate the key concepts:
Looking Ahead:
The bridge established the foundational concepts of Layer 2 networking: MAC learning, selective forwarding, and collision domain segmentation. The next page explores the switch—the commercial and technical evolution of the bridge that dominates modern networks. We'll examine hardware architectures, VLAN capabilities, and why switches completely replaced both hubs and traditional bridges.
You now understand the bridge's revolutionary contribution to network design—intelligent Layer 2 forwarding based on MAC addresses, automatic learning and aging, and collision domain segmentation. These concepts directly underpin modern switched network operation.