Design of frame dependency for VCR streaming videos
Image Communication
Hierarchical video patching with optimal server bandwidth
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
P-chaining: a practical VoD service scheme autonomically handling interactive operations
Multimedia Tools and Applications
A stream tapping protocol involving clients in the distribution of videos on demand
Advances in Multimedia
Hybrid chaining scheme for video-on-demand applications based on popularity
AIC'08 Proceedings of the 8th conference on Applied informatics and communications
M-chaining scheme for VoD application on cluster-based Markov process
International Journal of Advanced Media and Communication
Accelerated chaining: a better way to harness peer power in video-on-demand applications
Proceedings of the 2011 ACM Symposium on Applied Computing
| Hi-index | 0.00 |
By forwarding the server stream client by client, a chaining-based scheme is a good way to reduce the server streams for streaming applications in well-connected networks. In this paper, we prove that the minimum number of required server streams in such schemes is n-k+1, where n is the number of client requests and k is a value determined by client buffer sizes and the distribution of requests. In addition, we present an optimal chaining algorithm using a dynamic buffer allocation strategy. Compared to existing chaining schemes, our scheme not only utilizes the backward (basic chaining) and/or forward (adaptive chaining) buffer, but also exploits the buffers of other clients in order to extend the chain as much as possible. In this way, more clients can be chained together and served by the same server stream. Our simulation results show that the requirements of the server streams in the presented scheme are much lower those of existing chaining schemes. We also introduce mechanisms for handling VCR functions and fault exceptions in practical applications.