Age | Commit message (Collapse) | Author |
|
|
|
ok claudio@
|
|
transfers.
ok claudio@
|
|
Ospfd can be used as DR or BDR since quite some time so there is no need to
make ospfd ineligible as DR or BDR.
|
|
Reworked by me.
ok claudio@
|
|
ok and input claudio@
|
|
ok claudio@
|
|
Calculate Shortest Path Tree for each area known in the link state
database.
The Shortest Path Tree is used as input for route table calculation.
Route tabled is calculated and the result is inserted into the kernel
route table.
ok claudio@
|
|
ok claudio@
|
|
though the seq_num needs to be compared as signed number.
No idea how IETF came up with such a stupid idea especially because the
seq_num is not allowed to wrap.
requested by henning@ OK henning@
|
|
strict as possible. OK norby@
|
|
ok claudio@ henning@
|
|
OK claudio@
|
|
do with this software, just happend to be my only valid email address at
the time.
|
|
started by Esben Norby some time ago by using the imsg/three process framework
of bgpd. He implemented the basic concept plus the ospf finite state machines.
Later I joined and helped him cleanup, debug and extend his work.
Right now it is not particularly useful, major parts are still missing but is
imported to allow more people to work on it.
status:
The basic protocol works for broadcast networks and the LS database is
synchronized and updated. It is not possible to be DR or BDR on a network
and other interface types like point-to-point are not yet supported.
The shortest path tree is not calculated and so no routing information is
exchanged with the kernel FIB.
Not yet connected to the builds.
OK henning@
|