Changes To Application Example: Distributed Search Engine
Not logged in

Changes to "Application Example: Distributed Search Engine" between 2016-09-03 02:03:05 and 2016-09-03 02:05:17

    29     29   <p></p>
    30     30   
    31     31   <p>Each node maintains its own, personal, table of node reputations. The query
    32     32   initiator asks the packet owner directly for the packet and verifies that the
    33     33   promised distance between the query and the packet match. In terms of search
    34     34   hops the nodes closer to the liar get higher penalty points than the nodes
    35     35   further from the liar. The rest is a matter of custom heuristics that can be
    36         -very creative.</p>
           36  +very creative. The liars might lie only occasionally, at random moments or
           37  +according to some heuristic or statistical distribution.</p>
    37     38   
    38     39   <p><br>
    39     40   </p>
    40     41   
    41     42   <h1>Sources of Inspiration</h1>
    42     43   
    43     44   <p></p>