WAN Routing, Multiplexing, and Compression

Understanding WAN Routing, Multiplexing, and Compression

Wide Area Networks (WANs) are the backbone of modern enterprises, connecting remote offices, data centers, and cloud resources. To design efficient WANs, network engineers must master three core areas:

• Routing protocols – how routers discover and select optimal paths.
• Multiplexing techniques – how multiple data streams share a single physical medium.
• Data compression – how to reduce the amount of data transmitted without losing information.

This course translates the key concepts behind a typical quiz on these topics into a comprehensive, SEO‑friendly learning module.

1. Routing Approaches: Dynamic vs. Static

Routers need a method to build and maintain their routing tables. Two primary approaches exist:

• Static routing – administrators manually configure routes. It is simple but inflexible; any network change requires manual updates.
• Dynamic routing – routers exchange information using routing protocols, automatically adapting to topology changes.

The quiz question "Which routing approach updates routes automatically in response to network changes?" highlights that dynamic routing is the answer. Popular dynamic protocols include RIP, OSPF, EIGRP, and BGP.

2. Limitations of RIP (Routing Information Protocol)

RIP is one of the earliest distance‑vector protocols. While easy to configure, it suffers from a critical limitation:

• It supports a maximum of 15 hops. Any destination requiring more hops is considered unreachable.

This 15‑hop ceiling makes RIP unsuitable for large enterprise WANs, where paths often exceed that limit. The quiz correctly identifies this as the primary drawback.

3. Convergence Speed: Why EIGRP Leads the Pack

Convergence is the time a routing protocol takes to reach a consistent view of the network after a change (e.g., a link failure). Faster convergence reduces packet loss and improves application performance.

• RIP – slow convergence due to periodic updates (every 30 seconds) and simple hop count metric.
• OSPF – faster than RIP but can be delayed by SPF calculations in large topologies.
• BGP – designed for inter‑domain routing; convergence can be minutes to hours.
• EIGRP – Cisco’s hybrid protocol combines distance‑vector and link‑state features, using DUAL (Diffusing Update Algorithm) to achieve rapid, loop‑free convergence.

Therefore, the quiz answer "EIGRP" reflects its reputation as the fastest‑converging WAN routing protocol among the listed options.

4. Administrative Distance (AD): Choosing the Best Path

When multiple routing protocols provide routes to the same destination, a router must decide which route to install in the routing table. This decision is guided by Administrative Distance:

• AD is a numeric value; lower values are preferred.
• Typical default AD values: Directly connected – 0, Static – 1, EIGRP – 90, OSPF – 110, RIP – 120, BGP (external) – 20.

The quiz question "How does Administrative Distance influence routing decisions when multiple protocols are present?" emphasizes that lower AD values are preferred. Understanding AD helps engineers design deterministic routing policies.

5. OSPF and the Shortest Path First Algorithm

Open Shortest Path First (OSPF) is a link‑state protocol that builds a complete map of the network topology. To compute the optimal route, OSPF runs Dijkstra's algorithm, also known as the Shortest Path First (SPF) algorithm.

Dijkstra's algorithm works by:

• Initializing the source node with a distance of zero and all others with infinity.
• Repeatedly selecting the node with the smallest tentative distance, updating its neighbors, and marking it as visited.
• Continuing until all nodes are visited, producing the shortest‑path tree.

This deterministic approach ensures OSPF quickly converges to the most efficient routes, even in complex topologies.

6. Multiplexing Techniques: Synchronous vs. Statistical TDM

Multiplexing allows many logical channels to share a single physical medium. Two common Time‑Division Multiplexing (TDM) methods are:

• Synchronous TDM – slots are pre‑assigned to each user regardless of activity, leading to wasted bandwidth when a user is idle.
• Statistical TDM (STDM) – slots are allocated dynamically to active users only, eliminating empty slots and improving bandwidth utilization.

The quiz correctly states that in Statistical TDM, "Only active users transmit data, eliminating empty slots," which maximizes efficiency, especially when traffic is bursty.

7. Wavelength Division Multiplexing (WDM) vs. Traditional FDM

Fiber‑optic networks can carry massive amounts of data. Two multiplexing strategies are:

• Frequency Division Multiplexing (FDM) – separates signals by distinct frequency bands, typically used in copper or coaxial media.
• Wavelength Division Multiplexing (WDM) – splits the optical spectrum into multiple wavelengths (colors) and assigns each channel a unique wavelength.

WDM's key distinction is that it uses different light wavelengths instead of frequency bands, allowing many parallel channels over a single fiber without electrical conversion. This dramatically increases capacity and is the correct answer in the quiz.

8. Lossless Compression for Critical Data

Compression reduces the size of data before transmission. There are two main types:

• Lossy compression – discards some information (e.g., JPEG, MP3). Suitable for media where perfect fidelity is not required.
• Lossless compression – preserves every original bit (e.g., ZIP, PNG). Essential for data where any loss could be catastrophic.

Financial records, medical logs, and source code demand lossless compression because even a tiny alteration could affect audits, compliance, or functionality. The quiz highlights this necessity.

9. Integrating the Concepts: A Practical Scenario

Imagine a multinational corporation with headquarters in New York, regional offices in London and Tokyo, and a data center in Frankfurt. The network engineer must:

1. Choose a routing protocol that converges quickly after a link failure – EIGRP for internal WAN links.
2. Set appropriate Administrative Distances so that static routes for critical VPN tunnels are preferred over dynamic routes.
3. Deploy OSPF in the data center to compute optimal intra‑site paths using Dijkstra's algorithm.
4. Implement Statistical TDM on the leased line between New York and London to maximize bandwidth utilization during peak business hours.
5. Use WDM on the fiber backbone between Frankfurt and Tokyo, allowing multiple wavelength channels for voice, video, and data.
6. Compress nightly backup files with a lossless algorithm (e.g., gzip) before sending them over the WAN to ensure data integrity.

By aligning routing, multiplexing, and compression strategies, the engineer creates a resilient, high‑performance WAN.

10. Key Takeaways

• Dynamic routing automatically adapts to network changes, unlike static routing.
• RIP’s 15‑hop limit restricts its use in large networks.
• EIGRP offers the fastest convergence among common WAN protocols.
• Administrative Distance determines which protocol’s route is installed; lower values win.
• OSPF relies on Dijkstra’s algorithm to find the shortest path.
• Statistical TDM improves bandwidth efficiency by allocating slots only to active users.
• WDM multiplexes signals by wavelength, vastly increasing fiber capacity.
• Lossless compression is mandatory for data that cannot tolerate any alteration, such as financial records.

Mastering these concepts equips you to design robust WAN architectures that are both efficient and reliable. For deeper exploration, consider studying protocol‑specific configuration commands, the mathematics behind Dijkstra’s algorithm, and advanced compression techniques like LZMA and Brotli.