Ouroboros main repository http://www.ouroboros.rocks/cgit/ouroboros/atom?h=master 2017-05-15T16:21:45+00:00 2017-05-15T16:21:45+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-05-15T16:08:53+00:00 urn:sha1:5d87cec1757c4e1c23ae778f2814363c1e39b43c This makes the routing component into a policy since different approaches may exist to do this, depending on how high the rank of the DIF is. 2017-03-29T12:42:37+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-03-29T12:42:37+00:00 urn:sha1:e43fd05ba896ad5b4ac390f6097d6e6a06308f28 This turns the directed graph into an undirected one. Only one side of the flow creates an FSDB entry. The graph structure creates an edge object for every vertex involved when an edge is updated or removed. 2017-03-28T08:24:54+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-03-27T09:08:01+00:00 urn:sha1:8f88486a5a549e1b6644670e5eb011a9309f176b This removes the graph_add_edge operation of the graph component. The routing component now only listens to RO_MODIFY events, and updates the graph accordingly. 2017-03-23T15:32:12+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-03-23T14:51:42+00:00 urn:sha1:bb30c4f0488d5d444fd316d716f59c824a01540f This adds routing table calculation to the graph component. The routing instances can then periodically ask the graph component for the routing table, and update their PFFs accordingly. 2017-03-14T15:06:33+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-03-14T15:06:33+00:00 urn:sha1:7714673b65daf1fd0266d2855d9bfc91d735b51a This adds a graph structure which will be updated by routing when it is notified about a new RIB event. The routing can then use this graph as input for calculating the shortest path to a destination.