Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
IEEE Internet Computing
Dynamic Programming
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Accurate, scalable in-network identification of p2p traffic using application signatures
Proceedings of the 13th international conference on World Wide Web
Transport layer identification of P2P traffic
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
An analysis of internet content delivery systems
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
The internet AS-level topology: three data sources and one definitive metric
ACM SIGCOMM Computer Communication Review
Cache replacement policies revisited: the case of P2P traffic
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
The impact and implications of the growth in residential user-to-user traffic
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Should internet service providers fear peer-assisted content distribution?
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Can ISPS and P2P users cooperate for improved performance?
ACM SIGCOMM Computer Communication Review
P4p: provider portal for applications
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Traffic modeling and proportional partial caching for peer-to-peer systems
IEEE/ACM Transactions on Networking (TON)
Incentive-compatible caching and peering in data-oriented networks
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Delay tolerant bulk data transfers on the internet
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
| Hi-index | 0.24 |
Traffic caused by P2P services dominates a large part of traffic on the Internet and imposes significant loads on the Internet, so reducing P2P traffic within networks is an important issue for ISPs. In particular, a huge amount of traffic is transferred within backbone networks; therefore reducing P2P traffic is important for transit ISPs to improve the efficiency of network resource usage and reduce network capital cost. To reduce P2P traffic, it is effective for ISPs to implement cache devices at some router ports and reduce the hop length of P2P flows by delivering the required content from caches. However, the design problem of cache locations and capacities has not been well investigated, although the effect of caches strongly depends on the cache locations and capacities. We propose an optimum design method of cache capacity and location for minimizing the total amount of P2P traffic based on dynamic programming, assuming that transit ISPs provide caches at transit links to access ISP networks. We apply the proposed design method to 31 actual ISP backbone networks and investigate the main factors determining cache efficiency. We also analyze the property of network structure in which deploying caches are effective in reducing P2P traffic for transit ISPs. We show that transit ISPs can reduce the P2P traffic within their networks by about 50-85% by optimally designing caches at the transit links to the lower networks.