Matthew Toseland wrote: > Your backtracking code will backtrack forever and visit every node if > necessary ... could this skew the simulation results? I suggest you increment > depth just before calling n.request() in request(), this would be a closer > approximation with the same simulation performance, and more accurate path > lengths.
It does seem excessive to search every node within 10 hops, but OTOH depth isn't meant to be an accurate representation of HTL - the aim is to find out how many nodes you'd have to visit to find the data (visited.size()) and how many nodes would cache the data on the return path (depth). > Also, do you use the request rate code? No, there are no bandwidth limits in these simulations and the network only handles one request at a time - I had to strip out as much as possible to be able to simulate more than 100 nodes. Cheers, Michael
