Update of "Application Example: Distributed Search Engine"
Not logged in

Artifact ID: 988454d8243f6163a56733f50b9149713b69b1b5
Page Name:Application Example: Distributed Search Engine
Date: 2016-09-03 02:09:53
Original User: martin_vahi
Parent: 0a2f8c95da12b2c32b23adaccc7269b508881866 (diff)
Next c9249cb111298f5a8554057f743fde48b7bb2ef5

The idea in this chapter has not yet been tested out in practice. It's just a thought, a starting point for an experiment.

The Gist of the Idea

A document or part of a document resides at a Silktorrent packet. A search query calculates a rational number, a distance, between the query and the Silktorrent packet. The question to the network of nodes is: "Do You have a Silktorrent packet that has a MAXIMUM distance of L from the point that is determined by a search-engine specific, pre-defined, function with the following input parameters, param_1,...,param_N?" Some of the nodes on the network will lie, but the only possible, specified, answers to that question are:

Each node maintains its own, personal, table of node reputations. The query initiator asks the packet owner directly for the packet and verifies that the promised distance between the query and the packet match. In terms of search hops the nodes closer to the liar get higher penalty points than the nodes further from the liar. The rest is a matter of custom heuristics that can be very creative. The liars might lie only occasionally, at random moments or according to some heuristic or statistical distribution, instructions from censors, etc.

Sources of Inspiration