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

Artifact ID: 7e6ad9517ce2056959a005e6bce9c9043afef63a
Page Name:Application Example: Distributed Search Engine
Date: 2016-09-03 02:24:30
Original User: martin_vahi
Parent: 715b2963c303ab6d9096e0106abaa1ad734ed85e (diff)
Next da00e554ad1ddf188e31d5bdb57150baef145ab6

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

The Gist of the Idea


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, according to instructions from censors, etc. The search engine might be designed to search for text, but the algorithm works also on other data types, for example, 3D shapes, maps, images, sounds, etc.

Sources of Inspiration