IterativeLookupConfiguration Class Reference

This class holds the lookup configuration. More...

#include <IterativeLookupConfiguration.h>

List of all members.

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 verifySiblings
 true, if siblings need to be authenticated with a ping
bool majoritySiblings
 true, if sibling candidates are selected by a majority decision if using parallel paths
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
bool acceptLateSiblings
 if true, a FindNodeResponse with sibling flag set is always accepted, even if it is from a previous lookup step

Detailed Description

This class holds the lookup configuration.

Author:
Sebastian Mies, Ingmar Baumgart

Definition at line 32 of file IterativeLookupConfiguration.h.


Member Data Documentation

if true, a FindNodeResponse with sibling flag set is always accepted, even if it is from a previous lookup step

Definition at line 48 of file IterativeLookupConfiguration.h.

Referenced by IterativeLookup::handleRpcResponse(), and BaseOverlay::initialize().

communicate failed nodes

Definition at line 46 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 sibling candidates are selected by a majority decision if using parallel paths

Definition at line 44 of file IterativeLookupConfiguration.h.

Referenced by IterativeLookup::checkStop(), BaseOverlay::initialize(), 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().

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().

true, if siblings need to be authenticated with a ping

Definition at line 43 of file IterativeLookupConfiguration.h.

Referenced by IterativeLookup::addSibling(), BaseOverlay::initialize(), and IterativeLookup::IterativeLookup().

if true, the same node is never asked twice during a single lookup

Definition at line 47 of file IterativeLookupConfiguration.h.

Referenced by BaseOverlay::initialize(), and IterativePathLookup::sendRpc().


The documentation for this class was generated from the following file:
Generated on Wed May 26 16:21:17 2010 for OverSim by  doxygen 1.6.3