Probabilistic Prefetching Scheme for P2P VoD Applications With Frequent Seeks
Source: Ryefone Inc.
In Peer-to-Peer Video-on-Demand (P2P VoD) applications, users tend to seek to the positions that they are interested in. The frequent seeks raise a great challenge to the design of the prefetching scheme. In this paper, the authors propose a probabilistic prefetching framework to reduce the seeking distance. Each peer performs prefetching based on the segment access probability, which is estimated from the seeking statistics in the previous sessions. It is a challenging task to collect the seeking statistics in a distributed P2P network. In the proposed framework, they employ FM sketches to represent the seeking statistics, thus greatly reducing the space and time complexity.