ouroboros/src/ipcpd/normal/pol/link_state.c, branch 0.9.2

include, src: Update copyright to 2018

2018-01-09T08:53:56+00:00

Happy New Year, Ouroboros. Signed-off-by: Dimitri Staessens Signed-off-by: Sander Vrijders

ipcpd: Remove protocol buffers from link state

2017-12-04T10:41:36+00:00

This will remove google protocol buffers from the link state routing algorithm in the normal IPCP. It now uses packed structs, as supported by the compilers of choice. Signed-off-by: Sander Vrijders Signed-off-by: Dimitri Staessens

lib, tools: Rename application process and instance

2017-12-02T13:56:20+00:00

This refactors ouroboros to use "program" instead of "application process" and "process" instead of "application process instance" to align with current naming in current Operating Systems courses instead of the ISO nomenclature adopted by RINA. This change permeates through the entire implementation. Also contains some minor other refactors. Signed-off-by: Dimitri Staessens Signed-off-by: Sander Vrijders

ipcpd: List adjacencies in link-state database

2017-11-07T10:34:18+00:00

The lsdb will now list management and data transfer adjacencies. Signed-off-by: Dimitri Staessens Signed-off-by: Sander Vrijders

ipcpd: Handle cancellation while writing LSAs

2017-10-07T08:11:00+00:00

This adds a cleanup handler to ensure the lock is released in the event that the thread is cancelled during a write. An alternative solution could be to make the flow write in a non-blocking way (only the blocking write contains an execution path that has a cancellation point). Fixes #55

ipcpd: normal: React to flow events in link state policy

2017-09-29T13:12:36+00:00

This will let the link state policy react to flow up and down events by notifying the PFFs of the routing instances of this event so they can take an appropriate action.

ipcpd: normal: Add Loop-Free Alternates routing

2017-09-29T13:12:36+00:00

This adds the Loop-Free Alternates (LFA) policy. In case a link goes down a LFA may be selected to route the SDUs on without causing loops instead of the main hop that just went down.

ipcpd: normal: Add refcount to graph edges

2017-09-26T13:27:19+00:00

This adds a refcount to the graph edges so that it is only included in the calculation if both sides announced it.

ipcpd: normal: Keep index in vertex struct

2017-09-25T13:55:47+00:00

This keeps the index in the vertex struct so that is more easily available during Dijkstra.

ipcpd: normal: Return list as routing table

2017-09-25T12:26:26+00:00

This returns a list as routing table instead of a pointer to a pointer to a pointer, which simplifies the looping through the routing table and makes it more extensible for future additions.