.png){kind=icon}
返回
Efficient support for interactive browsing operations in clustered CBR video servers
.png){kind=icon}
PRE
AI
DOI：10.1109/6046.985553.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Providing efficient support for interactive browsing operations such as fast-forward (ff) and fast-backward (fb) is essential in video-on-demand and other multimedia server systems. In this paper, we propose two basic approaches to scheduling interactive browsing operations: 1) the prefetching approach and 2) the grouping approach. Block-skipping and frame-skipping algorithms are presented for constant bit rate (CBR) data blocks. These algorithms can precisely schedule video streams for both normal play and interactive browsing operations.
Keyword:
grouping
interactive
prefetching
scheduling
video servers
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.7
论文数:
4.6K
被引数:
2.4W
机构
暂无机构信息
引用论文
Optimal design of a class of generalized symmetric Gough–Stewart parallel manipulators with dynamic isotropy and singularity-free workspace.png)
Robotica
RoboticaIF0
PREAI
分享收藏
查看更多内容