TL;DR
This paper introduces Bingo, a proactive social group-based content caching scheme for wireless networks that leverages social group information to reduce backhaul load, achieving significant performance gains without requiring complete social graph knowledge.
Contribution
Bingo is a novel caching scheme that uses social group information inferred from user request logs, enabling efficient content caching without full social graph knowledge.
Findings
Bingo achieves up to 30%-34% gain over baseline caching schemes.
It effectively adapts to evolving social groups and content popularity.
Simulation results validate its superior performance.
Abstract
The unprecedented growth of wireless mobile traffic, mainly due to multimedia traffic over online social platforms has strained the resources in the mobile backhaul network. A promising approach to reduce the backhaul load is to proactively cache content at the network edge, taking into account the overlaid social network. Known caching schemes require complete knowledge of the social graph and mainly focus on one-to-one interactions forgoing the prevalent mode of content sharing among circles of 'friends'. We propose Bingo, a proactive content caching scheme that leverages the presence of interest groups in online social networks. The mobile network operator (MNO) can choose to incrementally deploy Bingo at select network nodes (base stations, packet core, data center) based on user profiles and revenue numbers. We approximate the group memberships of users using the available…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
