Dear all, How one can calculate the overhead for updating the shortest paths, with the Best-route strategy? Thanks, C. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://www.lists.cs.ucla.edu/pipermail/ndnsim/attachments/20161221/aa5b2504/attachment.html>