Improving the Performance of P2P Content Distribution Systems by Choosing Proper Content Providers
Yi Wan, Takuya Asaka, Tatsuro Takahashi
Abstract
Yi Wan, Takuya Asaka, Tatsuro Takahashi
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Computer science, Overlay, Content distribution, Content (measure theory), Simple (philosophy), Overlay network, Computer network, Database