Abstract
Searching mechanisms employed in unstructured overlay networks typically hit multiple peers for the desired content. We propose the use of a simple method that raises the hit rates of unpopular contents and balances the loads by choosing the peer holding the least contents as the provider when multiple candidates exist.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have