Agree with KK! May be Ricardo meant OSPF-like shortest path computation.
With regard to the RouteFlow (former QuagFlow) project, it has finally taken off: https://sites.google.com/site/routeflow/ While the code (Apache-licensed) and initial documentation are already up, the "official" release will be only next week once we fix some pending issues like the new logo and further documentation / tutorial material. Regards, Christian -- Christian Esteve Rothenberg, Ph.D. Converged Networks Division (DRC) Tel.:+55 19-3705-4479 / Cel.: +55 19-8193-7087 est...@cpqd.com.br www.cpqd.com.br On Thu, May 19, 2011 at 13:41, kk yap <yap...@stanford.edu> wrote: > Hi, > > I am not sure what is meant by OSPF here. Routing_module uses the > method described in "A New Approach to Dynamic All Pairs Shortest > Paths" by C. Demetrescu. A little more description can be found in > the documentation: > > http://noxrepo.org/~yapkke/doc/classvigil_1_1applications_1_1Routing__module.html#_details > > Regards > KK > > On 19 May 2011 07:45, fernando farias <fer...@yahoo.com.br> wrote: >> Hi Marwen >> There is a project called initially of QuagFlow and now RouteFlow that is >> able to use route protocols (OSPF, BGP, RIP ...) together with NOX. >> http://chesteve.wordpress.com/2010/07/07/quagflow-the-softrouter-reloaded-or-partnering-quagga-with-openflow/ >> Thx >> Fernando N. N. Farias >> >> Electrical Engineer PhD. Student >> Member of the Research Group on Computer Networks and Multimedia >> Communications - GERCOM/UFPA >> Optical Research Team - GERCOM >> Federal University of Pará >> "Primeiro eles o ignoram. >> Depois, riem de você. >> Chega um ponto em que lutam contra voce. >> Ate o dia em que você vence." Gandhi >> >> ________________________________ >> De: Ricardo Bennesby <ricardo.benne...@gmail.com> >> Para: marwen mechtri <mechtri.mar...@gmail.com> >> Cc: nox-dev@noxrepo.org >> Enviadas: Quinta-feira, 19 de Maio de 2011 9:57:21 >> Assunto: Re: [nox-dev] Nox Application with dijkastra >> >> Hi Marwen. >> >> Nox routing implements OSPF protocol and It is based on Dijkstra algorithm >> (also called SPF). In this algorithm, the component knows the data of all >> nodes in the network. >> >> Hope it helped. >> >> Best Regards. >> >> 2011/5/19 marwen mechtri <mechtri.mar...@gmail.com> >>> >>> Hi all, >>> >>> I'm exploring "routing", "sample_routing" and "switch" module of Nox but >>> when I configure a partial mesh network this modules don't give any result. >>> Could you tell me if this modules use dijkstra to calculate Path between >>> source and destination. And if not, do you know a module that use dijkstra >>> or any kind of method to calculate source to destination Path, could you >>> please give me its name. >>> >>> Thinks >>> Best regards >>> Marwen >>> >>> >>> >>> _______________________________________________ >>> nox-dev mailing list >>> nox-dev@noxrepo.org >>> http://noxrepo.org/mailman/listinfo/nox-dev >>> >> >> >> >> -- >> Ricardo Bennesby da Silva >> Ciência da Computação - UFAM >> LabCIA - Laboratório de Computação Inteligente e Autonoma >> >> >> _______________________________________________ >> nox-dev mailing list >> nox-dev@noxrepo.org >> http://noxrepo.org/mailman/listinfo/nox-dev >> >> > _______________________________________________ > nox-dev mailing list > nox-dev@noxrepo.org > http://noxrepo.org/mailman/listinfo/nox-dev > -- Christian _______________________________________________ nox-dev mailing list nox-dev@noxrepo.org http://noxrepo.org/mailman/listinfo/nox-dev
