Chris Parker Network Fun-Times

234 Followers
28 Following
199 Posts

My blog teaches network engineering with jokes & fun!

Instructor/course writer for Juniper. JNCIE-SP, meme fanatic. CEO of the internet. Your new goth uncle.

Co-author of the book Beginners Guide to Learning Junos, which you might maybe enjoy?

Websitehttps://www.networkfuntimes.com
Missed a trick on the sign-up page - I could have said that my location was North Korea.

"Remember that each triple really represents a path from SOURCE to SON of length DISTANCE , where the next-to-last hop on that path is FATHER"

Good to know that I can simply run SPF to find out where my Dad went when he popped out to get milk 15 years ago

Lol so I don't know if this is common in math(s) or not, but the original spec for the shortest-path first (SPF) algorithm in 1978 used the term "son" and "father" to describe one node going to another https://apps.dtic.mil/sti/pdfs/ADA053450.pdf

Random fact that may or may not interest you: in graph theory, a leaf-spine topology is called a bipartite graph.

https://en.wikipedia.org/wiki/Bipartite_graph

(To be more precise, it's a complete bipartite graph)

Bipartite graph - Wikipedia

@Drew_CM Picked myself up some sweet reading for the weekend
Gonna be honest: I have zero fear of Artificial Intelligence replacing human writers for at least two more decades