I don't think that functionality is present in l2switch m at this time. You could ask other projects that program flows, e.g., NetVirt, SFC, Group Based Policy, and maybe VTN.
--Colin On Tue, Jul 11, 2017 at 7:44 PM Shahram Gohardehi < shahram.gohard...@gmail.com> wrote: > Sure, but I am not a programmer and I just need a l2switch feature that > supports shortest path for my topology. Because of that I ask this > question. Sorry about that. > Thank you for your email. > > Best > Shahram > > On Tue, Jul 11, 2017 at 11:04 AM, Colin Dixon <co...@colindixon.com> > wrote: > >> (Also CC'ing the l2switch developer list.) >> >> Not out of the box to my knowledge, but writing a shortest path version >> should be relatively straightforward. >> >> --Colin >> >> On Mon, Jul 10, 2017 at 10:31 PM Shahram Gohardehi < >> shahram.gohard...@gmail.com> wrote: >> >>> Hello Colin >>> >>> This is Shahram. I am working on some SDN feature as a research. I saw >>> some of your codes in opendaylight forums and sent you this email. I need >>> your help and appreciate if you help me: >>> I installed opendaylight Beryllium version and installed l2switch. but I >>> need to have shortest path in l2switch. >>> Is there any version of beryllium version that support shortest path >>> (for example by Dijkestra algorithm)? >>> >>> Best >>> Shahram >>> >>> >
_______________________________________________ L2switch-dev mailing list L2switch-dev@lists.opendaylight.org https://lists.opendaylight.org/mailman/listinfo/l2switch-dev
