Freenet: a distributed anonymous information storage and retrieval system We describe Freenet, an adaptive peer-to-peer network application that permits the. Freenet: A Distributed Anonymous Information Storage and. Retrieval System. Ian Clarke. C Lyham Road, Clapham Park. London SW2. Download Citation on ResearchGate | Freenet: A Distributed Anonymous Information Storage and Retrieval System | We describe Freenet, an adaptive.
|Published (Last):||1 June 2009|
|PDF File Size:||17.21 Mb|
|ePub File Size:||9.36 Mb|
|Price:||Free* [*Free Regsitration Required]|
This paper addresses some problems that traditional file storage systems have. Some of these problems are outlined below:. I give this paper a rating of 4 for significant contribution.
I think this distributed peer-to-peer model is a significant improved over current server based central file storage systems. There are many limitations to Freenet, however.
Freenet – Wikipedia
The design goal of security of Freenet makes the retrieval of stored information difficult. The paper mentions several ways of classifying data into tree-like directory structures. These directories are hard to update and difficult to maintain.
The paper also suggests many layers of encryption and indirection to get around some nomenclature issues; however, this approach is complicated and not scalable. There lacks an efficient keyword search system. Using file indirection for keyword searches is hard to manage and bulky.
Ofcourse, I believe that anonymity can ease of file retrieval is a tradeoff, and a compromise needs to be achieved. One can’t have the best of both. Another limitation is that files need to be accessed to be kept on the storage network.
Freenet: A Distributed Anonymous Information Storage and Retrieval System
This design issue can be seen as a feature, since it relieves the responsibility of cleaning out old files. However, it is also not too practical if the user just wants to store some files for backup purposes and only needs to access them when needed. The methodology of the paper is convincing. However, I think the simulations done are too simple. I also would like to know how well Freenet adapts to network congestion.
The paper mentions that a node can time out if it does not receive a reply from a downstream node after a period rretrieval time, but how does one set the timer? Future work including figuring out a better naming structure for Freenet and better information retrieval methods, like keyword searches. Also, a better way to locate nodes may be useful.
Also, what are some incentives for people to stirage Freenet? Are people willing to give up free hard drive space in return for such a service?
These are just some of the questions that need to be addressed.