Lec16a-Freenet3 - o Look up the routing table find the nearest key bfk’ to bfk o Send f and its bfk to node(bfk’ o Do above until hops_to_live

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 COMP7370 Advanced Computer and Network Security Freenet: A Distributed Anonymous Information Storage and Retrieval System (3) Topics: 1. Retrieve Data 2. Store files 3. Manage files 4. Security issues Retrieve data o Need binary file keys to retrieve files o Send binary file keys as requests o Each node check its local store - Return if found, return the file - Otherwise, What? a) Look keys in its routing table; b) Forward the request to other nodes c) Found: pass data back to upstream requestor d) caching: update routing table (file key and source) Store file - input: f and hops_to_live o Compute binary file key, i.e., bfk(f) o Check existing keys in own store o If pre-existing key found, re-compute binary key
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: o Look up the routing table, find the nearest key bfk’ to bfk o Send f and its bfk to node(bfk’) o Do above until hops_to_live limit is reached 2 Manage data o Each node: configure datastore size o LRU cache o Routing table: LRU. o No guarantees of file lifetimes: outdated files can fade away Performance o Why simulations? o How to design experiments? -Performance -Scalability -Fault tolerance Security o Anonymity of requestors and inserters of files o Protection against malicious modifications. How? o A malicious node can not tell who are senders. Why? o Can we hide keys? No. need keys in routing tables -Use pre-routing of messages....
View Full Document

This note was uploaded on 12/07/2011 for the course COMP 7370 taught by Professor Qin,x during the Summer '08 term at Auburn University.

Page1 / 2

Lec16a-Freenet3 - o Look up the routing table find the nearest key bfk’ to bfk o Send f and its bfk to node(bfk’ o Do above until hops_to_live

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online