A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is
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 realisticdoi:10.1109/jsac.2007.07007 fatcat:a2mljzecl5cljgxh7dwg3gzz6m