Steven – routingloop.net

IS-IS LSP Authentication

I learned something today that now seems obvious. IS-IS LSP Authentication only impacts the trust of the Link State Packet itself, not IS-IS neighbor maintenance. Neighbor adjacency authentication is a separate function in IS-IS. Neighbors will still form if LSP authentication is mismatched but the LSP content will not be published to the Link State

OSPF v2 LSDB Illustrated

27SeptemberStevenHome Lab, Routing

In this lab exercise, I am going to attempt to draw a diagram of the network based on the OSPF Link State Database (LSDB) using the virtualized network shown below. The diagram will be based on R1’s view of the network. R1’s OSPF Router ID (RID) is 1.1.1.1. Let’s start by examining R1s LSDB at

A World Without Window Scaling

24AugustStevenHome Lab

In the world of modern TCP, window scale multipliers are a commodity often ignored until it’s not there. The window is the number of bytes that the receiving TCP is prepared to receive. RFC 793 states that the window field is 16 bits. With 16 bits, the receiving TCP can indicate that it is willing

EIGRP in Clos Topologies

1DecemberStevenHome Lab, Routing

Link state protocols or BGP are typically used for underlay routing in data center fabrics, deployment of these protocols is Clos (aka spine and leaf) topologies are well documented. I decided to experiment with EIGRP to get a better understanding of its operation in such topologies. Although I don’t expect to ever see a production

Are We Spending Too Much on the Network?

26NovemberStevenRouting

Are We Spending Too Much on the Network? It’s a reasonable question. Many textbooks about networking have info about aggregating routing information, optimizing link state designs for more optimal flooding and shorter SPF runs, and many other techniques that were mandatory when router CPU and memory were a rarity. Moore’s Law continued to deliver and

A Thing About EIGRP Summaries

2OctoberStevenHome Lab, Routing

IP route summarization, sometimes called aggregation, allows us to suppress the advertisement of multiple longer prefixes into a shorter prefix that encompasses a range of more specific routes. There are plenty of excellent guides on summarization, so I’ll spare those details here and jump straight into some EIGRP specific things about summaries. Demo Network For

Clear arp-cache vs clear ip arp

20SeptemberStevenHome Lab, Routing

Cisco IOS CLI provides two different commands that seem the same on the surface but have a slightly different outcome on the wire. Based on the title you probably guessed that it’s clear arp-cache vs clear ip arp. To see the difference, I connected two routers on network 10.0.0.0/30 with a SPAN enabled switch in

TCP CUBIC vs BBR Pt. 1

1AugustStevenHome Lab

TCP congestion control algorithms have a tough problem to solve. They need to estimate the available capacity of a network path without any knowledge of network. Remember that TCP runs in the end hosts. It’s important to estimate the network capacity to achieve the maximum throughput for a single flow while sharing network resources with

Don’t Have a Bad Day

31MarchStevenHome Lab, Routing

Anycast RP with Multicast Source Discovery Protocol (MSDP) is a great way to provide fault tolerance to your multicast network. Configure another router with the RP address, bang out a few msdp commands on the RP routers and you’re all set for a basic anycast RP design. It’s important to not get tunnel vision and

EIGRP Metric Calculation

27MarchStevenHome Lab, Routing

If you’ve worked with or studied EIGRP, you’ve probably seen that scary formula with the K values that EIGRP uses to calculate routing metrics. It turns out that if you’re using the default K values so that only bandwidth and delay are being considered, the math involved isn’t that bad. In this article we’ll explore

routingloop.net

A place for me to ramble about computer networking.

Author Archives: Steven