With significant increases in mobile device traffic slated for the foreseeable future, numerous technologies must be embraced to satisfy such demand. Notably, one of the more intriguing approaches has been blending on-device caching and device-to-device (D2D) communications. While various past research has pointed to potentially significant gains (30 +) via redundancy elimination (RE), some skepticism has emerged to whether or not such gains are truly harnessable in practice. The premise of this paper is to explore whether or not significant potential for redundancy elimination exists and whether the rise of video and encryption might blunt said efforts. Critically, we find that absent significant synchronized interests of mobile users, the actual redundancy falls well short of the promising values from the literature. In our paper, we investigate the roots for said shortcomings by exploring RE savings with regards to cache hit characteristics and to what extent client and domain diversity contribute to the realized redundancy savings.
 A significant percentage of Web objects are replicas. For example, a vast majority of image files such as banners, buttons, and logos are duplicated throughout the WWW. Nevertheless, Web caching systems generally treat the replicas as different objects because they have different URLs. In this paper, we propose a simple and efficient way to manage the replicated objects for Web proxy caches. In the proposed scheme, the MD5 checksum, together with the size of an object, forms an identifier of a Web object that can distinguish replicas. Experimental results show that the proposed scheme significantly improves the cache hit rate and the byte hit rate by removing the redundant objects from the cache and reflecting the popularity of objects more precisely. We present a technique for identifying repetitive information transfers and use it to analyze the redundancy of network traffic. Our insight is that dynamic content, streaming media and other traffic that is not caught by today's Web caches is nonetheless likely to derive from similar information. We have therefore adapted similarity detection techniques to the problem of designing a system to eliminate redundant transfers. We identify repeated byte ranges between packets to avoid retransmitting the redundant data. We find a high level of redundancy and are able to detect repetition that Web proxy caches are not. In our traces, after Web proxy caching has been applied, an additional 39 of the original volume of Web traffic is found to be redundant. Moreover, because our technique makes no assumptions about HTTP protocol syntax or caching semantics, it provides immediate benefits for other types of content, such as streaming media, FTP traffic, news and mail.