Changes To Application Example: Distributed Search Engine
Not logged in

Changes to "Application Example: Distributed Search Engine" between 2016-09-03 02:25:24 and 2016-09-03 02:25:36

    10     10   query calculates a rational number, a distance, between the query and the
    11     11   Silktorrent packet. The question to the network of nodes is: <b>"Do You have a
    12     12   Silktorrent packet that has a MAXIMUM distance of L from the point that is
    13     13   determined by a search-engine specific, pre-defined, function with the
    14     14   following input parameters, param_1,...,param_N?" </b>Some of the nodes on the
    15     15   network will lie, but the only possible, specified, answers to that question
    16     16   are:</p>
           17  +
           18  +<p><br>
           19  +</p>
    17     20   
    18     21   <p></p>
    19     22   <ul>
    20     23   <li>I do not have it, nor was I able to reach anybody within N hops, who has
    21     24   it.</li>
    22     25   <li>I have it, the Silktorrent packet name is foo and the distance is bar.</li>
    23     26   <li>I do not have it, but ask from node N_x1. Either the N_x1 has it or it can
    24     27   refer to some other node that either has it itself or can give a new node name.
    25     28   The Silktorrent packet name is foo and the distance is bar.</li>
    26     29   </ul>
           30  +
           31  +<p><br>
           32  +</p>
    27     33   
    28     34   <p>Each node maintains its own, personal, table of node reputations. The query
    29     35   initiator asks the packet owner directly for the packet and verifies that the
    30     36   promised distance between the query and the packet match. In terms of search
    31     37   hops the nodes closer to the liar get higher penalty points than the nodes
    32     38   further from the liar. The rest is a matter of custom heuristics that can be
    33     39   very creative. The liars might lie only occasionally, at random moments or