Back to Search
Start Over
Caching Scheme Research Based on Unstructured Peer-to-Peer Network
- Source :
- Physics Procedia. :1076-1083
- Publisher :
- Published by Elsevier B.V.
-
Abstract
- For Unstructured P2P (Peer-to-Peer) networks leading to the high-load of “high-degree peers”and the quick deletion of rarely requested contents. This paper proposed a new cache scheme MFU (Most Frequently Used) that replaces the cache on the basis of the number of request messages per unit of time. This algorithm aims to achieve the high-degree peers to delete the popular contents and low-degree ones hold the unpopular contents by setting the threshold properly. Moreover, The author also used a simulation to show the effectivity of the new algorithm. With the traditional LRU, LFU and ARP scheme compared to prove that the advantage of the new replacement policy in load balance and hit rate.
- Subjects :
- Scheme (programming language)
load balance
UnstructuredP2P
Basis (linear algebra)
Computer science
business.industry
Adaptive replacement cache
Peer-to-peer
Physics and Astronomy(all)
computer.software_genre
Power-law distribution
Research based
Hit rate
Cache replacement policy
Cache
business
Cache algorithms
computer
computer.programming_language
Computer network
Subjects
Details
- Language :
- English
- ISSN :
- 18753892
- Database :
- OpenAIRE
- Journal :
- Physics Procedia
- Accession number :
- edsair.doi.dedup.....724f5f6170b5c83bfe04e996e6f87942
- Full Text :
- https://doi.org/10.1016/j.phpro.2012.03.202