Efficient lookup on unstructured topologies

R. Morselli, B. Bhattacharjee, M.A. Marsh, A. Srinivasan
2007 IEEE Journal on Selected Areas in Communications  
We present LMS, a protocol for efficient lookup on unstructured networks. Our protocol uses a virtual namespace without imposing specific topologies. It is vastly more efficient than existing lookup protocols for unstructured networks, and thus is an attractive alternative for applications in which the topology cannot be structured as a DHT. We present analytic bounds for the worst-case performance of our protocol. Through detailed simulations, we show that the actual performance on realistic
more » ... pologies is significantly better. We also show in both simulation and a complete implementation (which includes over one thousand nodes) that our protocol is inherently robust against multiple node failures and can adapt its replication strategy to optimize searches according to a specific heuristic. Moreover, the simulation demonstrates the resilience of LMS to high node turnover rates, and that it can easily adapt to orders of magnitude changes in network size. The overhead incurred by LMS is negligible, and its performance approaches that of DHTs on networks of similar size. We discuss several applications that are particularly suited to LMS as a replication platform. In particular, we give a model of a publishing service in a trust network and we show experimental results that confirm the advantages in this case of LMS over a DHT.
doi:10.1109/jsac.2007.07007 fatcat:a2mljzecl5cljgxh7dwg3gzz6m