Dark nets, anonymous and membership-concealing P2P networks, aim at providing censorship-resistance without relying on a central authority. An efficient routing algorithm is needed to create Dark nets that offer an acceptable performance to a large number of users. Designing such an algorithm is hard due to the restricted topology of Dark nets, which has not been modelled adequately up to now. We present such a model of Dark nets by modifying Kleinberg's small-world model and a new algorithm, Next Best Once. It is shown analytically that Next Best Once takes O (log2 n) steps on our model, simulations show that it performs better than existing Dark net routing algorithms such as the one used in the dark Free net, especially with regard to the maximal path length which is bounded by O (log2 n) for Next Best Once, but scales linearly in case of Free net.
展开▼
