Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.comnet.2009.11.013 | Computer Networks |
Keywords | DocType | Volume |
P2P,Live streaming,Proxy caching | Journal | 54 |
Issue | ISSN | Citations |
7 | Computer Networks | 8 |
PageRank | References | Authors |
0.52 | 17 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ke Xu | 1 | 1392 | 171.73 |
| Ming Zhang | 2 | 89 | 18.62 |
| Jiangchuan Liu | 3 | 4340 | 310.86 |
| Zhijing Qin | 4 | 131 | 8.18 |
| Mingjiang Ye | 5 | 76 | 5.70 |