Pollution attacks and defenses for Internet caching systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximate analysis of LRU in the case of short term correlations
Computer Networks: The International Journal of Computer and Telecommunications Networking
The stretched exponential distribution of internet media access patterns
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Resource demand and supply in BitTorrent content-sharing communities
Computer Networks: The International Journal of Computer and Telecommunications Networking
User Access to Popular Data on the Internet and Approaches for IP Traffic Flow Optimization
ASMTA '09 Proceedings of the 16th International Conference on Analytical and Stochastic Modeling Techniques and Applications
Cooperative caching by clients constructing a peer-to-peer network for push-based broadcast
Data & Knowledge Engineering
Proxy caching for peer-to-peer live streaming
Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards an ISP-compliant, peer-friendly design for peer-to-peer networks
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
A resource-efficient traffic localization scheme for multiple BitTorrents
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
MTorrent: a multicast enabled bittorrent protocol
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Cooperative caching and relaying strategies for peer-to-peer content delivery
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
An incentive-based approach to traffic management for peer-to-peer overlays
ETM'10 Proceedings of the Third international conference on Incentives, overlays, and economic traffic control
The implication of overlay routing on ISPs' connecting strategies
Proceedings of the 23rd International Teletraffic Congress
Domical cooperative caching for streaming media in wireless home networks
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Content delivery and caching from a network provider's perspective
Computer Networks: The International Journal of Computer and Telecommunications Networking
Asymmetric caching: improved network deduplication for mobile devices
Proceedings of the 18th annual international conference on Mobile computing and networking
PIT overload analysis in content centric networks
Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking
A suitable server placement for peer-to-peer live streaming
The Journal of Supercomputing
Caching in information centric networking: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Measurement study on P2P streaming systems
The Journal of Supercomputing
| Hi-index | 0.00 |
Peer-to-peer (P2P) file sharing systems generate a major portion of the Internet traffic, and this portion is expected toincrease in the future. We explore the potential of deploying proxy caches in different Autonomous Systems (ASes) with thegoal of reducing the cost incurred by Internet service providers and alleviating the load on the Internet backbone. We conducta measurement study to model the popularity of P2P objects in different ASes. Our study shows that the popularity of P2P objectscan be modeled by a Mandelbrot-Zipf distribution, regardless of the AS. Guided by our findings, we develop a novel cachingalgorithm for P2P traffic that is based on object segmentation, and partial admission and eviction of objects. Our trace-basedsimulations show that with a relatively small cache size, less than 10% of the total traffic, a byte hit rate of up to 35%can be achieved by our algorithm, which is close to the byte hit rate achieved by an off-line optimal algorithm with completeknowledge of future requests. Our results also show that our algorithm achieves a byte hit rate that is at least 40% more,and at most triple, the byte hit rate of the common web caching algorithms. Furthermore, our algorithm is robust in face ofaborted downloads, which is a common case in P2P systems.