shortestpathfirst_logoShortestPathFirst is an information technology blog covering DDoS Mitigation and Detection, Network Architecture and Design, Disaster Recovery Planning, Data Center Design and Infrastructure Virtualization, IPv6 Planning and Deployment, Multicast, Voice and Video Convergence, MPLS and BGP/MPLS L2 and L3 VPNs, and overall Information Security best practices.

Author Bio
Stefan Fouant brings over 18 years of experience in the Service Provider and network security industries as both an trusted advisor as well as a thought leader. Most recently, Fouant worked at Juniper Networks as a routing and security expert assisting large Tier 1 carriers. His background includes work at Verizon where he was responsible for launching one of the first large-scale cloud-enabled DDoS mitigation and detection services and also work at Neustar/UltraDNS where he was responsible for building out their layered DDoS response mechanisms, laying the groundwork for Neustar’s DDoS mitigation service offerings. Most recently during his time at Corero, he has authored drafts within the IETF relating to standardized signaling of coordinated DDoS attack filtering and mitigation mechanisms. He holds several patents in the areas of DDoS Detection and Mitigation, as well as many industry certifications including CISSP, JNCIE-SP, JNCIE-ENT, and JNCIE-SEC. He was the first person in the world to achieve all three expert level Juniper certifications and is a member of Juniper’s Ambassador Program. He was a technical editor of the book “Juniper MX Series” by O’Reilly as well as “Day One: Junos for IOS Engineers”. He also coauthored “Day One: Junos Tips, Techniques, and Templates”.

cert_inet_expert_graphic_rgb CISSP_logo
VMW_09Q3_LGO_VMwareAdvancedServices_K VMW_09Q3_LGO_VMwareAdvancedServices_K

Site Origins
The name for this site comes from Dijkstra’s algorithm, otherwise known as the “Shortest Path First” algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959. The Dijkstra algorithm is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing protocols such as OSPF and IS-IS, and modified forms of it are used in other applications, such as MPLS Traffic Engineering.