WebExpress: a system for optimizing Web browsing in a wireless environment
MobiCom '96 Proceedings of the 2nd annual international conference on Mobile computing and networking
A protocol-independent technique for eliminating redundant network traffic
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
WWW '03 Proceedings of the 12th international conference on World Wide Web
HPP: HTML macro-preprocessing to support dynamic document caching
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Modeling and Caching of Peer-to-Peer Traffic
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Packet caches on routers: the implications of universal redundant traffic elimination
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Redundancy in network traffic: findings and implications
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
EndRE: an end-system redundancy elimination service for enterprises
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
The power of prediction: cloud bandwidth and cost reduction
Proceedings of the ACM SIGCOMM 2011 conference
REfactor-ing content overhearing to improve wireless performance
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Celleration: loss-resilient traffic redundancy elimination for cellular data
Proceedings of the Twelfth Workshop on Mobile Computing Systems & Applications
How to reduce smartphone traffic volume by 30%?
PAM'13 Proceedings of the 14th international conference on Passive and Active Measurement
Intra-AS cooperative caching for content-centric networks
Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking
A divide-and-conquer approach for content replication in WMNs
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Network deduplication (dedup) is an attractive approach to improve network performance for mobile devices. With traditional deduplication, the dedup~source uses only the portion of the cache at the dedup~destination that it is aware of. We argue in this work that in a mobile environment, the dedup~destination (say the mobile) could have accumulated a much larger cache than what the current dedup~source is aware of. This can occur because of several reasons ranging from the mobile consuming content through heterogeneous wireless technologies, to the mobile moving across different wireless networks. In this context, we propose asymmetric caching, a solution that is overlaid on baseline network deduplication, but which allows the dedup~destination to selectively feedback appropriate portions of its cache to the dedup~source with the intent of improving the redundancy elimination efficiency. We show using traffic traces collected from 30 mobile users, that with asymmetric caching, over 89% of the achievable redundancy can be identified and eliminated even when the dedup~source has less than one hundredth of the cache size as the dedup~destination. Further, we show that the ratio of bytes saved from transmission at the dedup~source because of asymmetric caching is over 6x that of the number of bytes sent as feedback. Finally, with a prototype implementation of asymmetric caching on both a Linux laptop and an Android smartphone, we demonstrate that the solution is deployable with reasonable CPU and memory overheads.