[ndnSIM] shortestpath poblem

[Christian Kreuzberger]

Hi,


I've tracked my issue with CalculateAllPossibleRoutes down and found a bug in the ndnSIM source of ndn-global-routing-helper.cpp.
I've created a redmine ticket and attached a patch for it already:
http://redmine.named-data.net/issues/2535


Best regards,
Christian

> -----Original Message-----
> From: ndnSIM [mailto:ndnsim-bounces at lists.cs.ucla.edu] On Behalf Of
> Christian Kreuzberger
> Sent: Tuesday, February 17, 2015 5:00 PM
> To: ndnsim at lists.cs.ucla.edu
> Subject: Re: [ndnSIM] shortestpath poblem
> 
> Hi,
> 
> I have a similar problem with version 2.0.
> CalculateAllPossibleRoutes() crashes - I have about 300 nodes, a single prefix
> (/prefix) and several content providers (about 5-10) that host /prefix.
> I will try to create an example scenario to reproduce the problem ASAP.
> 
> 
> Best Regards,
> Christian
> 
> 
> On 2015-02-16 08:40, Spyridon (Spyros) Mastorakis wrote:
> > Hello,
> >
> > the FibHelper is not available in ndnSIM 1.0. I would suggest that you
> > update to the new version if you want to use it.
> >
> > --
> > Spyridon (Spyros) Mastorakis
> > Personal Website: http://cs.ucla.edu/~mastorakis/ Internet Research
> > Laboratory PhD Computer Science UCLA
> >
> >
> >
> >
> >> On Feb 15, 2015, at 3:04 AM, narjes aloulou <aloulounarjes at yahoo.fr>
> >> wrote:
> >>
> >> Hi,
> >>
> >> I test it with the optimised mode, but it did'nt work. Can I use the
> >> FibHelper from 1.0 version?
> >>
> >> Thanks for your Help
> >>
> >> Best Regards
> >>
> >> --------------------------------------------
> >> En date de : Jeu 12.2.15, Alex Afanasyev
> >> <alexander.afanasyev at ucla.edu> a écrit :
> >>
> >> Objet: Re: [ndnSIM] shortestpath poblem
> >> À: "narjes aloulou" <aloulounarjes at yahoo.fr>
> >> Cc: ndnsim at lists.cs.ucla.edu
> >> Date: Jeudi 12 février 2015, 7h05
> >>
> >> Double check that you
> >> have build NS-3/ndnSIM in optimized mode.  Implementation
> >> of CalculateRoutes internally uses Dijkstra algorithm from
> >> Boost graph library (which is known to be extremely slow in
> >> debug mode).  It should be a problem for this number of
> >> prefixes and nodes.
> >>
> >> If
> >> still fails, you can compute all routes and prefixes offline
> >> and install them directly using FibHelper.
> >>
> >> --
> >> Alex
> >>
> >>> On Feb 11, 2015, at 4:55 PM, narjes
> >> aloulou <aloulounarjes at yahoo.fr>
> >> wrote:
> >>>
> >>> Hi,
> >>>
> >>> Considering a large
> >> catalog (10⁶ prefixes),
> >> "ndnGlobalRoutingHelper.CalculateRoutes ()"
> >> creates an infinite loop and crashes the system. My scenario
> >> consists of 300 nodes and I use ndnSIM 1.0.
> >>>
> >>> Any solution to
> >> resolve this problem , please?
> >>> Are
> >> there any way to use ShortestPath without using the
> >> ndnGlobalRoutingHelper ?
> >>>
> >>>
> >>> Best Regards
> >>
> >>
> >> _______________________________________________
> >> ndnSIM mailing list
> >> ndnSIM at lists.cs.ucla.edu
> >> http://www.lists.cs.ucla.edu/mailman/listinfo/ndnsim
> >
> >
> > _______________________________________________
> > ndnSIM mailing list
> > ndnSIM at lists.cs.ucla.edu
> > http://www.lists.cs.ucla.edu/mailman/listinfo/ndnsim
> _______________________________________________
> ndnSIM mailing list
> ndnSIM at lists.cs.ucla.edu
> http://www.lists.cs.ucla.edu/mailman/listinfo/ndnsim