#include <IterativeLookupConfiguration.h>
Public Attributes | |
| int | redundantNodes |
| number of next hops in each step | |
| int | parallelPaths |
| number of parallel paths | |
| int | parallelRpcs |
| number of nodes to ask in parallel | |
| bool | strictParallelRpcs |
| limited the number of concurrent RPCS to parameter parallelRpcs | |
| bool | useAllParallelResponses |
| merge all parallel responses from earlier steps | |
| bool | newRpcOnEveryTimeout |
| send a new RPC immediately after an RPC timeouts | |
| bool | newRpcOnEveryResponse |
| send a new RPC after every response, even if there was no progress | |
| bool | finishOnFirstUnchanged |
| finish lookup, if the last pending RPC returned without progress | |
| bool | secure |
| true, if all nodes should be identified with a ping | |
| bool | merge |
| true, if parallel RPCs results should be merged | |
| bool | failedNodeRpcs |
| communicate failed nodes | |
| bool | visitOnlyOnce |
| if true, the same node is never asked twice during a single lookup | |
Definition at line 32 of file IterativeLookupConfiguration.h.
communicate failed nodes
Definition at line 45 of file IterativeLookupConfiguration.h.
Referenced by IterativePathLookup::handleTimeout(), and BaseOverlay::initialize().
finish lookup, if the last pending RPC returned without progress
Definition at line 42 of file IterativeLookupConfiguration.h.
Referenced by BaseOverlay::initialize(), and IterativePathLookup::sendRpc().
true, if parallel RPCs results should be merged
Definition at line 44 of file IterativeLookupConfiguration.h.
Referenced by IterativePathLookup::accepts(), IterativePathLookup::add(), IterativePathLookup::handleResponse(), BaseOverlay::initialize(), oversim::Chord::initializeOverlay(), and IterativeLookup::IterativeLookup().
send a new RPC after every response, even if there was no progress
Definition at line 41 of file IterativeLookupConfiguration.h.
Referenced by IterativePathLookup::handleResponse(), and BaseOverlay::initialize().
send a new RPC immediately after an RPC timeouts
Definition at line 40 of file IterativeLookupConfiguration.h.
Referenced by BaseOverlay::initialize(), and IterativePathLookup::sendNewRpcAfterTimeout().
number of parallel paths
Definition at line 36 of file IterativeLookupConfiguration.h.
Referenced by IterativeLookup::addSibling(), IterativeLookup::checkStop(), BaseOverlay::initialize(), IterativeLookup::IterativeLookup(), and IterativeLookup::start().
number of nodes to ask in parallel
Definition at line 37 of file IterativeLookupConfiguration.h.
Referenced by IterativePathLookup::handleResponse(), BaseOverlay::initialize(), IterativePathLookup::sendNewRpcAfterTimeout(), IterativePathLookup::sendRpc(), and IterativeLookup::start().
number of next hops in each step
Definition at line 35 of file IterativeLookupConfiguration.h.
Referenced by IterativeLookup::createFindNodeCall(), Kademlia::handleBucketRefreshTimerExpired(), IterativePathLookup::handleResponse(), BaseOverlay::initialize(), IterativePathLookup::IterativePathLookup(), IterativeLookup::lookup(), IterativePathLookup::sendRpc(), and IterativeLookup::start().
true, if all nodes should be identified with a ping
Definition at line 43 of file IterativeLookupConfiguration.h.
Referenced by IterativePathLookup::handleResponse(), BaseOverlay::initialize(), IterativeLookup::IterativeLookup(), and IterativeLookup::start().
limited the number of concurrent RPCS to parameter parallelRpcs
Definition at line 38 of file IterativeLookupConfiguration.h.
Referenced by BaseOverlay::initialize(), and IterativePathLookup::sendRpc().
merge all parallel responses from earlier steps
Definition at line 39 of file IterativeLookupConfiguration.h.
Referenced by IterativePathLookup::accepts(), BaseOverlay::initialize(), and IterativeLookup::IterativeLookup().
if true, the same node is never asked twice during a single lookup
Definition at line 46 of file IterativeLookupConfiguration.h.
Referenced by BaseOverlay::initialize(), and IterativePathLookup::sendRpc().
1.5.8