Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Analysis of speculative prefetching
ACM SIGMOBILE Mobile Computing and Communications Review
Performance Optimization Problem in Speculative Prefetching
IEEE Transactions on Parallel and Distributed Systems
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
PROMISE: peer-to-peer media streaming using CollectCast
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
An improved data stream summary: the count-min sketch and its applications
Journal of Algorithms
Distributed prefetching scheme for random seek support in peer-to-peer streaming applications
Proceedings of the ACM workshop on Advances in peer-to-peer multimedia streaming
Efficient and decentralized computation of approximate global state
ACM SIGCOMM Computer Communication Review
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
Centralized peer-to-peer streaming with layered video
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
A progressive flow auction approach for low-cost on-demand P2P media streaming
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Time-decaying sketches for sensor data aggregation
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Robust video-on-demand streaming in peer-to-peer environments
Computer Communications
oStream: asynchronous streaming multicast in application-layer overlay networks
IEEE Journal on Selected Areas in Communications
Efficient search and scheduling in P2P-based media-on-demand streaming service
IEEE Journal on Selected Areas in Communications
Push-to-Peer Video-on-Demand System: Design and Evaluation
IEEE Journal on Selected Areas in Communications
VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Most existing Peer-to-Peer (P2P) Video-on-Demand (VoD) systems have been designed and optimized for the sequential playback. In practice, users often want to seek to the positions they are interested in. Such frequent seeks raise greater challenges to the design of the prefetching scheme. In this work, we first propose the concept of guided seeks. With the guidance, users can perform more efficient seeks to the desired positions. The guidance can be obtained from collective seeking statistics of other peers who have watched the same title in the previous and/or concurrent sessions. However, it is very challenging to aggregate the statistics efficiently, timely and in a completely distributed way. We design the hybrid sketches that not only capture the seeking statistics at significantly reduced space and time complexity, but also adapt to the popularity of the video. From the collected seeking statistics, we estimate the segment access probability, based on which we further develop an optimal prefetching scheme and an optimal cache replacement policy to minimize the expected seeking delay at every viewing position. Through extensive simulations, we demonstrate that the proposed prefetching framework significantly reduces the seeking delay compared to the sequential prefetching scheme.