BLT 0.4.3 is out

Dijkstra graph in BLT 0.4.3

As usual you can grab the binary (Java multiplatform) from Github here, and the source code there

New major feature is the implementation of local Dijkstra shortest path computation, based on data collected with BGP linkstate.

Dijkstra algorithm has been coded inside the controller.

New REST primitives have also been added so you can directly read shortest path between two nodes in the network:

• the first one provides the list of nodes on the shortest path between two nodes:

  https://{{bltserver}}:8443/api/networks/{{net}}/routers/{{rtr1}}/shortestpathto/{{rtr2}}

• the second one provides a list of shortest path from the selected node:


https://{{bltserver}}:8443/api/networks/{{net}}/routers/{{rtr}}/shortestpathtree

Dijkstra path visbility in Google Maps view:

Shortest path between two nodes

select target node with a left click:

reveal shortest path from any selected router with a right click on source node:

When right clicking on any source node (xrv1 here below), the "infobubble" of targeted node temporarily disappears.

Shortest path from a single node towards multiple nodes

select target nodes with a left click:

reveal shortest paths from any selected router with a right click on source node:

Get the whole Dijkstra tree rooted at a single node

select origin node with a left click (you must select only one node for this feature to work):

reveal Dijkstra tree with a right click on the origin node: