This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full 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.
- Summer '08