Exploiting Correlation among Data Items for Cache Replacement in Ad-hoc Networks
Noman Islam, Zubair A. Shaikh

TL;DR
This paper introduces a new cache replacement method for ad-hoc networks that leverages data item correlations through association rule mining to improve cache efficiency.
Contribution
It presents a novel cache replacement technique that exploits correlations among data items using association rule mining, enhancing cache performance in ad-hoc networks.
Findings
Improved cache hit ratio in ad-hoc networks
Enhanced data retrieval efficiency
Reduced cache replacement overhead
Abstract
In this paper, we have proposed a novel technique for cache replacement in Ad-hoc Network based on the mining of Association Rules
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Network Packet Processing and Optimization · Mobile Ad Hoc Networks
