Performance analysis of look strategies of DHT in NATed environment

Network address translation (NAT) causes well-known difficulties for distributed hash table (DHT) application, which needs end-to-end communication. This paper focuses on the impact of NAT on the lookup performance of DHT. The evaluation models considering the impact of NATs are presented for the performances of three representative lookup strategies (symmetric recursive routing, semi-recursive routing and iterative routing). Based on the evaluation models, the performances of these lookup strategies are compared under different conditions. Analysis results show that symmetric recursive routing can outperform the other two lookup strategies in NATed environment.