Changes To Application Example: Distributed Search Engine
Not logged in

Changes to "Application Example: Distributed Search Engine" between 2016-09-03 01:42:43 and 2016-09-03 02:02:24

     1      1   <p><br>
     2      2   </p>
     3      3   
     4         -<h1>General Idea</h1>
            4  +<h1>The Gist of the Idea</h1>
     5      5   
     6      6   <p>A document or part of a document resides at a Silktorrent packet. A search
     7      7   query calculates a rational number, a distance, between the query and the
     8         -Silktorrent packet.&nbsp;<br>
            8  +Silktorrent packet. The to the network of nodes is: <b>"Do You have a
            9  +Silktorrent packet that has a MAXIMUM distance of L from the point that is
           10  +determined by a search-engine specific, pre-defined, function with the
           11  +following input parameters, param_1,...,param_N?" </b>Some of the nodes on the
           12  +network will lie, but the only possible, specified, answers to that question
           13  +are:<br>
     9     14   </p>
    10     15   
    11     16   <p><br>
    12     17   </p>
    13     18   
           19  +<p>
           20  +<ul>
           21  +<li>I do not have it, nor was I able to reach anybody within N hops, who has
           22  +it.</li>
           23  +<li>I have it, the Silktorrent packet name is foo and the distance is bar.</li>
           24  +<li>I do not have it, but ask from node N_x1. Either the N_x1 has it or it can
           25  +refer to some other node that either has it itself or can give a new node name.
           26  +The Silktorrent packet name is foo and the distance is bar.</li>
           27  +</ul></p>
           28  +
           29  +<p>Each node maintains its own, personal, table of node reputations. The query
           30  +initiator asks the packet owner directly for the packet and verifies that the
           31  +promised distance between the query and the packet match. In terms of search
           32  +hops the nodes closer to the liar get higher penalty points than the nodes
           33  +further from the liar. The rest is a matter of custom heuristics that can be
           34  +very creative.</p>
           35  +
    14     36   <p><br>
    15     37   </p>
    16     38   
    17     39   <h1>Sources of Inspiration</h1>
    18     40   
    19         -<p>
           41  +<p></p>
    20     42   <ul>
    21     43   <li><a href="https://www.cs.cornell.edu/~bwong/cubit/approach.html">Cubit</a>
    22     44   <i>(<a href="https://archive.is/UsOtD">archival copy</a>)</i></li>
    23     45   <li>Cooperative Domain Name System,
    24     46   <a href="https://www.cs.cornell.edu/People/egs/beehive/codons.php">CoDoNS</a>
    25     47   <i>(<a href="https://archive.is/bABwI">archival copy</a>)</i></li>
    26         -</ul></p>
           48  +</ul>
           49  +
           50  +<p></p>
    27     51   
    28     52   <p><br>
    29     53   </p>
    30     54   
    31     55   <p><br>
    32     56   </p>