NOX comes with one simple example path calculation component (called "routing"). This component implements the algorithm described in the paper "A New Approach to Dynamic All Pairs Shortest Paths"<http://www.dis.uniroma1.it/~demetres/docs/dapsp-full.pdf>by Camil Demetrescu.
Some more info here: https://github.com/noxrepo/nox-classic/wiki/Routing This is the only "routing" implementation that comes with NOX (but note that this is not conventional routing) On Thu, Apr 19, 2012 at 9:44 PM, Weiyang Mo <[email protected]> wrote: > Hi,ALL, > > Are there any NOX components for routing algorithms(e.g RIP)? I wanto to > implement such algorithms in my OpenFlow networks. > > Thanks very much > > Weiyang >
