[p2p-hackers] p2p query method and implementation

[Marco Ceci]

On 9/23/05, Aaron Harwood <aharwood at cs.mu.oz.au> wrote:
> We are using a publish/subscribe system built on efficient
> P2P range query techniques on a DHT. It depends a lot on what kind
> of information that you are querying for and what index is usable
> for that information.

I'm working on a way to weight the relevance of a alert generated by
multiple intrusion detection system. The information consist in a pair
(src_ip, alert_id) and i want to check how many times the global
system have seen this. Every peer can put in the system that
information and every other peer would read that. The frequence of put
and check operation is supposed to be hight but is not important to
have access to the latest information. I'm following the idea coming
from the paper "Towards Collaborative Security and P2P Intrusion
Detection" wich use bloom filters for storing information on peer ad a
semi-random way to choose peer from the set for joining information.
Any suggestion would be very appreciated. Thank you all.


best regards

--
Marco Ceci