Since I had been dealing with Graphs for the past few months, So I thought of writing something basic rather than some new shiny thing. In this post we will take a look at Dijkstra, Pseudocode and code. As we all know that Dijkstra is a shortest path algorithm which is used by OSPF and […]
Providing a comprehensive solution for global connectivity is still not a trivial task. As most global enterprises know, the scale both geographically and organizationally can kill almost any well engineered network design. Size and complexity aside, just designing for the next “XaaS” solution and cloud sprawl can greatly challenge most network engineers One approach to […]
As the number of service providers you rely on increases, you need detailed network forensic data you can share with providers to assist with troubleshooting and speed up resolution.
In the last blog we looked at PCE for centralized path-computation and PCEP as a communication protocol between PCE and PCC.We also looked at brief demo of PCE sending ERO’s (IP or SR Node labels) to the PCC(Head end). In this Blog post we will particularly try to focus at Traffic Engineering (SR-TE) aspects of […]
In the last blog, I briefly mentioned about PCE and how BGP-LS can be used as one of the ways to collect the topology information. In this blog we will explore more about PCE, the problems it tries to solve and different elements of PCE. But before we go any deeper, I do want to […]