On 07/20/2017 11:15 AM, Jamo Luhrsen wrote: > Karthik, > > feel free to commit while working on it and even before testing. The gerrit > jobs > will provide a full odl distribution and we can even take that distribution > and > pass it through some of our system tests that would validate you haven't > broken > anything in our current tests.
for example, in your patch [0], there is a distribution-check job [1] that can create a full distribution. However in your patch, the build failed in loopremover-model, but I think Evan gave a hint in gerrit as to what would fix that. But, when it does fully build we will get a full distribution which we can pass it on to a CSIT job, like this l2switch job [2] to get some confidence. all just fyi. Thanks, JamO [0] https://git.opendaylight.org/gerrit/#/c/60496/ [1] https://jenkins.opendaylight.org/releng/job/l2switch-distribution-check-nitrogen/8/ [2] https://jenkins.opendaylight.org/releng/view/l2switch/job/l2switch-csit-1node-switch-only-carbon/ > that being said, we obviously don't have any system tests for shortest path > functionality in l2switch. > > JamO > > On 07/20/2017 11:08 AM, Karthik wrote: >> Hi Evan , I am working on your review comments, also adding some extra >> checks & features . I will commit after thoroughly >> testing. >> Apologizes for delay.Thank you ! >> >> Regards, >> Karthik >> >> On Wed, Jul 19, 2017 at 10:59 AM, Karthik <sdkarth...@gmail.com >> <mailto:sdkarth...@gmail.com>> wrote: >> >> Hi Evan, >> >> Thank you for your suggestion. I will start work on the master branch. >> >> I'm interested to develop an API which will give shortest path as well >> as push the flow to each switch according to the >> user input. I believe it is not yet implemented. Please advice me. >> >> It will be a great if our changes will go for the release plan. >> >> Regards, >> Karthik >> >> On 19-Jul-2017 11:04 PM, "Evan Zeller" <evanrzel...@gmail.com >> <mailto:evanrzel...@gmail.com>> wrote: >> >> Shahram and Karthik, >> >> Thanks for you interest. I've added some comments to Karthik's >> gerrit which you can take a look at. Beryllium and >> Boron have become older releases at this point-- I would recommend >> doing the development on the master branch >> (Nitrogen) and potentially cherry-picking back to the stable/carbon >> branch ( if you want your feature to be included >> in the next Carbon SR ). >> >> Question for you two, are there any other features that you would >> like to develop or see developed in this project? >> For a few releases this project has been in maintenance-mode, but if >> active development begins we can work the >> deliverables into the release plans. >> >> Let me know if you have any other questions or concerns. >> Thanks, >> Evan >> >> On Wed, Jul 19, 2017 at 10:19 AM, Shahram Gohardehi >> <shahram.gohard...@gmail.com >> <mailto:shahram.gohard...@gmail.com>> wrote: >> >> I really appreciate Karthik >> >> On Wed, Jul 19, 2017 at 1:16 PM, Karthik <sdkarth...@gmail.com >> <mailto:sdkarth...@gmail.com>> wrote: >> >> Hi Shahram, >> >> My l2switch project version is of boron. Since you are using >> beryllium , I will change to that version and >> will share to you. Thank you! >> >> Regards, >> Karthik >> >> On 19-Jul-2017 10:34 AM, "Shahram Gohardehi" >> <shahram.gohard...@gmail.com >> <mailto:shahram.gohard...@gmail.com>> wrote: >> >> Thank you James and thank you every one >> >> Hello karthik >> >> Sure, I test it and will let you know about the feedback. >> I am using Beryllium (karaf-0.4.0-Beryllium). >> I really appreciate for your help. >> >> Best >> Shahram >> >> >> >> Sent from my iPhone >> >> On Jul 18, 2017, at 11:07 PM, Karthik >> <sdkarth...@gmail.com <mailto:sdkarth...@gmail.com>> wrote: >> >>> Hi James , Thank you for adding me in the loop . >>> >>> Hi Shahram, >>> There is no direct API available in l2switch project to >>> find the shortest path between 2 hosts . >>> I implemented API for that inside the l2switch. I have >>> committed in gerrit & it's pending for review. >>> >>> I do one thing, I will commit the code as public . So >>> that you can use and let me know the feedback.I >>> will share the link ASAP. May I know which version of >>> ODL are you using? >>> >>> Thank you everyone! >>> >>> On 19-Jul-2017 5:06 AM, "Jamo Luhrsen" >>> <jluhr...@gmail.com <mailto:jluhr...@gmail.com>> wrote: >>> >>> I know of someone (Karthik, who is CC'd) that also >>> has interest in this >>> shortest path in l2switch. Just bringing him in to >>> the loop as well. >>> >>> Thanks, >>> JamO >>> >>> >>> On 07/18/2017 07:26 AM, Colin Dixon wrote: >>> > 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 >>> <mailto:shahram.gohard...@gmail.com> >>> <mailto:shahram.gohard...@gmail.com >>> <mailto: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 >>> <mailto:co...@colindixon.com> >>> <mailto:co...@colindixon.com <mailto: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 >>> <mailto:shahram.gohard...@gmail.com> >>> <mailto:shahram.gohard...@gmail.com >>> <mailto: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 >>> <mailto:L2switch-dev@lists.opendaylight.org> >>> > >>> https://lists.opendaylight.org/mailman/listinfo/l2switch-dev >>> >>> <https://lists.opendaylight.org/mailman/listinfo/l2switch-dev> >>> > >>> >> >> >> _______________________________________________ >> L2switch-dev mailing list >> L2switch-dev@lists.opendaylight.org >> <mailto:L2switch-dev@lists.opendaylight.org> >> https://lists.opendaylight.org/mailman/listinfo/l2switch-dev >> <https://lists.opendaylight.org/mailman/listinfo/l2switch-dev> >> >> >> _______________________________________________ L2switch-dev mailing list L2switch-dev@lists.opendaylight.org https://lists.opendaylight.org/mailman/listinfo/l2switch-dev
