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 <[email protected]> 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" <[email protected]> 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 
>> > <[email protected] <mailto:[email protected]>> 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 <[email protected] 
>> > <mailto:[email protected]>> 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 
>> > <[email protected] <mailto:[email protected]>>
>> >         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
>> > [email protected]
>> > https://lists.opendaylight.org/mailman/listinfo/l2switch-dev
>> >
_______________________________________________
L2switch-dev mailing list
[email protected]
https://lists.opendaylight.org/mailman/listinfo/l2switch-dev

Reply via email to