tree 6f9968d034b7382fda8d7cb8adaa475b8e5facf6
parent 8c7c22804c2437166af14156b6681a245e8724fa
author Ashlesh Gawande <agawande@memphis.edu> 1689363438 -0500
committer awlane <awlane@memphis.edu> 1712679679 -0500

Replace FullSync algorithm and fix bugs to lower delay and overhead

1) During high update frequency PSync nodes can send data that contain
nothing new. This blocks the receiver nodes from syncing leading to
high delays. To fix this, Sync interests now include the cumulative number
of elements inserted into the IBF. This is used as an heuristic to guide
PSync on decode failures to minimize the chance of sending of such data
packets. Sync data freshness for entire dataset is also reduced.
If a no new update still happens, introduce some safeguards in the code.

2) Fast reaction upon negative set being detected is introduced. Timed
processing for interests is also introduced.

3) Fix satisfyPendingInterests to send the new update on publish even if
pending IBF decode fails, since we have something to send.

4) For interests which request segments, only respond with segments already contained
in in-memory storage.

refs: [solution II] in Thesis:
"Improvements to PSync: Distributed Full Dataset Synchronization
in Named-Data Networking"
https://digitalcommons.memphis.edu/cgi/viewcontent.cgi?article=3162&context=etd

Change-Id: Ie235b4fb56fcb7de21068511205e407006292b23