Discover rpavlovs/OS-NNN Open Source project

OSPF

OSPF  uses  a  graph‐theoretic  model  of  network  topology  to  compute  shortest  paths.  Each  router  periodically  broadcasts  information  about  the  status  of  its  connections.  OSPF  floods  each  status  message  to  all  participating  routers.  A  router  uses  arriving  link  state  information to assemble a graph. Whenever a router receives information that changes its copy of the  topology  graph,  it  runs  a  conventional  graph  algorithm  to  compute  shortest  paths  in  the  graph,  and  uses the results to build a new next‐hop routing table. 

rpavlovs/OS-NNN

rpavlovs

Reviews

Repository Details

More Repositories