[ndnSIM] shortestpath poblem

Alex Afanasyev alexander.afanasyev at ucla.edu
Wed Feb 11 22:05:26 PST 2015

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.


> 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

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 841 bytes
Desc: Message signed with OpenPGP using GPGMail
URL: <http://www.lists.cs.ucla.edu/pipermail/ndnsim/attachments/20150211/c6c16478/attachment.bin>

More information about the ndnSIM mailing list