Fast Freenet: Improving Freenet Performance by Preferential Partition Routing and File Mesh Propagation

The Freenet Peer-to-Peer network is doing a good job in providing anonymity to the users. But the performance of the network in terms of download speed and request hit ratio is not that good. We propose two modifications to Freenet in order to improve the download speed and request hit ratio for all participants. To improve download speed we propose Preferential Partition Routing, where nodes are grouped according to bandwidth and slow nodes are discriminated when routing. For improvements in request hit ratio we propose File Mesh propagation where each node sends fuzzy information about what documents it posesses to its neigbors. To verify our proposals we simulate the Freenet network and the bandwidth restrictions present between nodes as well as using observed distributions for user actions to show how it affects the network. Our results show an improvement of the request hit ratio by over 30 times and an increase of the average download speed with six times, compared to regular Freenet routing

Archives for the Dark Web: A Field Guide for Study

This chapter provides a field guide for other digital humanists who want to study the Dark Web. In order to focus the chapter, I emphasize my belief that, in order to study the cultures of Dark Web sites and users, the digital humanist must engage with these systems' technical infrastructures. I will provide specific reasons why I believe that understanding the technical details of Freenet, Tor, and I2P will benefit any researchers who study these systems, even if they focus on end users, aesthetics, or Dark Web cultures. To this end, I offer a catalog of archives and resources researchers could draw on and a discussion of why researchers should build their own archives. I conclude with some remarks about ethics of Dark Web research

Neighbor selection and hitting probability in small-world graphs

Small-world graphs, which combine randomized and structured elements, are seen as prevalent in nature. Jon Kleinberg showed that in some graphs of this type it is possible to route, or navigate, between vertices in few steps even with very little knowledge of the graph itself. In an attempt to understand how such graphs arise we introduce a different criterion for graphs to be navigable in this sense, relating the neighbor selection of a vertex to the hitting probability of routed walks. In several models starting from both discrete and continuous settings, this can be shown to lead to graphs with the desired properties. It also leads directly to an evolutionary model for the creation of similar graphs by the stepwise rewiring of the edges, and we conjecture, supported by simulations, that these too are navigable.Comment: Published in at http://dx.doi.org/10.1214/07-AAP499 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Small-worlds: Beyond Social Networking

Small-world phenomena were initially studied in the 1960s through a series of social network experiments, and are, as evidenced by the game The six degrees of Kevin Bacon , even part of our pop-culture. Recently, mathematicians and physicists have shown that most small-world phenomena are expected consequences of the mathematical properties of certain networks -- known as {\em small-world networks}. In this paper, we survey some recent mathematical developments dealing with small-world networks, as well as present a new small-world network model and discuss some new ideas for decentralized searching. The goal is to give the reader a sense of the importance of small-world networks, and some of the useful applications dealing with these networks