Ouroboros main repository http://www.ouroboros.rocks/cgit/ouroboros/atom?h=0.4 2017-01-31T19:36:18Z 2017-01-31T19:36:18Z dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-31T18:55:59Z urn:sha1:988355d5bb62405f3bd3fbaade1f26ba4b2c274e The rib_pack function allows packing a subtree of the RIB for dissemination. The options PACK_HASH_ROOT and PACK_HASH_ALL will add the hashes for the root object of the packed subtree or every object to the packed message respectively. Checking of the hashes is currently only performed at the top level object, verifying the complete operation. The rib_unpack function unpacks a packed message and inserts its contents in the RIB. The option UNPACK_CREATE flags that the unpack operation is allowed to create new objects, else it will only update existing objects. More advanced options could be added in the future. The packed message structure uses Google Protocol Buffers, as defined in ro.proto. It adds tests for these functions to the rib_test. 2017-01-21T08:55:10Z dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-20T11:59:17Z urn:sha1:9c92dd66d5e7fab3a3e243abbad9a20b29891fee The new RIB is implemented as a tree with doubly linked nodes (parents keep a link to each child, each child keeps a link to its parent). An index is kept in a btree using CRC32 hashes of the path name in the RIB. Nodes keep an SHA3-256 hash value that is unique for the entire subtree. This allows quick checks to see if two RIB subtrees are in sync. The event system for the RIB is based on the event system for flows (fqueue), but implemented completely in dynamic memory using linked lists. An initial test is performed for the RIB. This PR does not modify existing code to use the new RIB. 2017-01-16T14:53:17Z dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-16T12:40:57Z urn:sha1:fac7ffe8ea9f42ebcf67c011c944d165cbab3e3b Adds an implementation of B-trees of order k (k children, min fill is k/2, max fill k - 1). Useful to implement indexes for faster lookups. 2017-01-14T11:19:01Z dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-14T11:19:01Z urn:sha1:c18011259423f5d1cea7dfa67093c888c4882c1e The CRC32 implementation will be used to ID objects in the RIB. 2017-01-12T13:58:49Z dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-12T13:58:49Z urn:sha1:4e3c360377bc9b792c2fac83e9402d7531f79bbe Be gam 2017-01-11T18:49:54Z dimitri staessens dimitri.staessens@intec.ugent.be 2017-01-11T11:58:56Z urn:sha1:915b055978faeb516525e1a2a337d4c582fd088d Adds an SHA-3 hash implementation that will be used in the rib, adapted and redistributed from the RHASH project (https://github.com/rhash/RHash) 2017-01-09T15:05:57Z Sander Vrijders sander.vrijders@intec.ugent.be 2017-01-09T15:05:57Z urn:sha1:0b6a6d6445b5addcf38eb67a001b792456242481 This adds CACEP to the library, which can be used for authenticating the other party after flow allocation and for obtaining other relevant information. 2016-12-24T11:19:10Z dimitri staessens dimitri.staessens@intec.ugent.be 2016-12-23T17:13:40Z urn:sha1:f97dee45d3c1b0088aa8010a1c9d59593c3d0df0 Refactors the normal IPCP fmgr and ribmgr, and modifies the API for cdap so that no callbacks are needed. 2016-12-21T13:54:29Z Sander Vrijders sander.vrijders@intec.ugent.be 2016-12-21T13:29:31Z urn:sha1:b814df8ed2939649284533d61eb26c29ed2ab2c8 This adds a hash table that takes 64-bit integers as key and uses separate chaining on collision. It also adds the PDU Forwarding Function, which the Flow Manager can use to lookup the fd towards the next hop. Routing policies will add/update/remove entries in the PFF. 2016-10-21T12:17:51Z dimitri staessens dimitri.staessens@intec.ugent.be 2016-10-19T20:25:46Z urn:sha1:f516b51169020ea1957010fbd1005d746f01b1d9 The fast path will now use an incoming ring buffer per flow per process. This necessitated the development of a new method for the asynchronous io call, which is now based on an event queue system for scalability (fqueue). The ipcpd's and tools have been updated to this API.