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.
展开▼
机译：暗网（匿名和隐藏成员的P2P网络）旨在在不依赖中央权威的情况下提供抗审查性。需要一种有效的路由算法来创建可为大量用户提供可接受性能的Dark网络。由于Dark网络的拓扑受限，因此设计此类算法非常困难，到目前为止，尚未对其进行足够的建模。通过修改Kleinberg的小世界模型和新算法Next Best Once，我们提出了这样的Dark nets模型。分析表明，Next Best Once在我们的模型上采取了O（log2 n）步，仿真表明，该算法比现有的Dark net路由算法（例如Dark Free net中使用的算法）表现更好，尤其是在最大路径长度方面对于下一个最佳一次，该值由O（log2 n）限制，但在Free net的情况下线性扩展。
展开▼
