Segment-based proxy caching of multimedia streams
Proceedings of the 10th international conference on World Wide Web
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
A survey of Web cache replacement strategies
ACM Computing Surveys (CSUR)
Cache replacement policies revisited: the case of P2P traffic
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Should internet service providers fear peer-assisted content distribution?
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Does internet media traffic really follow Zipf-like distribution?
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Cost-aware WWW proxy caching algorithms
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
Challenges, design and analysis of a large-scale p2p-vod system
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
A Measurement Study of Cache Rejection in P2P Live Streaming System
ICDCSW '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops
A Measurement Study of a Large-Scale P2P IPTV System
IEEE Transactions on Multimedia
Proxy caching for media streaming over the Internet
IEEE Communications Magazine
| Hi-index | 0.00 |
Peer-to-Peer (P2P) live streaming has become increasingly popular over the Internet. To alleviate the inter-ISP traffic load and to minimize the access latency, proxy caching has been widely suggested for P2P applications. In this paper, we carry out an extensive measurement study on the properties of P2P live streaming data requests. Our measurement demonstrates that the P2P living streaming traffic exhibits strong localities that could be explored by caching. This is particularly noticeable for the temporal locality, which is often much weaker in the conventional P2P file sharing applications. Our results further suggest that the request time of the same data piece from different peers exhibits a generalized extreme value distribution. We then propose a novel sliding window (SLW)-based caching algorithm, which predicts and caches popular data pieces according to the measured distribution. Our experimental results suggest that the P2P live streaming can greatly benefit from the proxy caching. And, with much lower overhead, our SLW algorithm works closer to an off-line optimal algorithm that holds the complete knowledge of future requests.