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-31T15:37:18+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-03-31T15:37:18+00:00 urn:sha1:d57f771135f81003985d9332430332b93902f766 This removes some logs in the graph component and replaces prints of uin64_t variables with an architecture agnostic variant. 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:26:06+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-03-27T10:47:20+00:00 urn:sha1:ad6a813edab5a14866b045d37fe2ce7e1f9a126d The index j in the function that transforms the list of predecessors to a routing table was incremented at the wrong time. 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-28T08:24:54+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-03-25T17:48:30+00:00 urn:sha1:c0bfc1752df3530570a24c930220b94a4e3afabb This fixes several bugs in the ro sets, rib. And it fixes several bugs in the graph and routing component of the normal IPCP. 2017-03-24T10:40:30+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-03-24T10:40:30+00:00 urn:sha1:6a119fb353ec862151543489201b20f67628a6f2 This adds a check to prevent a negative malloc in case the graph structure is empty. 2017-03-24T10:16:11+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-03-24T10:11:47+00:00 urn:sha1:81a70d5ed630cad01b5a47a56b96c4d7bfe08765 The next vertex was not taken at the end of the Dijkstra calculation loop. 2017-03-24T09:59:15+00:00 Sander Vrijders sander.vrijders@ugent.be 2017-03-24T09:59:15+00:00 urn:sha1:a02044a3b9a44e24699311ed753491ebca472c62 This fixes a dumb segfault in the dijkstra calculation. If an entry can be removed from the table it was set to NULL. However, if the table is completely empty, the index was -1, resulting in an illegal access into the table. 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.