一种基于节的视频服务器允许接纳控制算法

提出了一种基于“服务器节”的支持压缩多媒体流的服务器中CPU、磁盘、网络和内存等资源管理的方法和允许接纳控制算法。“服务器节”概念定义了一组客户视频服务特性,如播放、快进、慢进和暂停等,并且确定了视频服务所需资源的分配参。一个“服务器节”包括视频服务器、磁盘设备、网络设备和允许接纳控制。它不但能优化使用单个资源,对于给定系统支持最大数量的客户端,保证其服务质量（QoS),而且其允许接纳控制算法能根据系统所有资源的状况,在不影响原有的视频服务基础上,确定对客户端新提出的视频服务是否接受。     

基于在线测量的视频服务器接纳控制

实时多媒体系统中,有限的磁盘I/O带宽和缓存空间使得接纳控制显得更为重要。针对传统算法接纳控制方面的不足,论文提出基于在线测量的VBR视频服务器接纳控制算法。通过在线测量系统所剩资源和周期容限的幅度变化来实时调节调度周期的大小,不但简化了接纳过程,节约了系统资源,提高了算法的可实现性,而且也使得系统的所剩资源达到更优的“等量”平衡。结果表明,系统的综合性能指标明显提高。     

连续媒体服务器存储系统中的容错算法

连续媒体服务器(如VOD服务器)要对大量连续媒体数据(如声频、视频)进行管理,按一定速率为用户提供连续的媒体服务。因此,在这样的系统中,作为存储设备的磁盘阵列要具有高可靠性和一定的容错能力。文章提出一种基于奇偶检验的数据重构恢复算法,以保证系统中只有一个盘出现故障时,能使服务器及时重构出故障盘上的数据,并且算法充分利用了媒体流内在特性———回放时数据的连续性,与目前使用的标准故障恢复算法相比,大大减少了磁盘在线故障后数据重构过程的系统开销。最后通过分析、比较证明了算法的有效性。     

视频服务器中变比特率视频流的I/O调度

讨论了视频服务器中变化特率（ＶＢＲ）视频流的Ｉ／Ｏ调度问题．其中重点讨论了Ｉ／Ｏ调度中的接纳控制算法．首先提出了Ｂｉ－ＳＣＡＮ磁盘调度算法,并将其应用到ＶＢＲ视频流的Ｉ／Ｏ调度．接着讨论了两种确定性接纳控制算法．确定性接纳控制能提供确保的服务质量,但系统资源的利用率很低．为此提出了一种基于统计复用的统计接纳控制算法,该算法将ＶＢＲ视频数据复杂的统计特性转化为磁盘提交的数据块数量的统计特性,使问题得     

优化的存储模式-VBR视频安置在MZ磁盘组上

研究了大量视频在磁盘组上的安置和接纳计算方法。基于视频的特性、视频的流行性及磁盘的特性,提出了一个优VBRMZVBRMZ化的存储模式及相应的接纳算法,和其它现存算法相比,结果显示它能支持更多的流数、在作品流行性变化的情况下有更好的适应能力。     

优化的存储模式——VBR视频安置在MS磁盘组上

研究了大量VBR视频在MZ磁盘组上的安置和接纳计算方法，基于视频的VBR特性，视频的流行性及MZ磁盘的特性，提出了一个优化的存储模式及相应的接纳算法，和其它现存算法相比，结果显它能支持更多的流数，在作品流行性变化的情况下更好的适应能力。     

基于H.264的嵌入式视频服务器软件设计

介绍了一种嵌入式视频服务器软件设计与实现.服务器基于μClinux操作系统,采用H.264编码标准,实现了视频输入的实时采集和传输.给出了服务器软件的总体结构、视频存储(多磁盘调度算法)、RTP传输模块的实现和发送缓冲区的结构设计.实验结果表明,系统能够保证视频的传输质量及网络带宽要求,适用于多种监控.     

Axis推出新款CD-ROM服务器

一款新型的 CD-ROM 服务器及其管理软件允许用户从 Intranet 浏览器或桌面系统环境上共享 CD-ROM。Axis 通讯公司用于令牌环网的 AxisStorPoint CD,结合了嵌入式的瘦型服务器体系结构和跨平台的 Web 管理界面,以及基于 RISC 的硬件。该服务器支持 Netware、Windows NT、OS/2、Unix 和 Web 服务器,允许用户从标准的客户端用户界面访问 CD-ROM 信息。Axis 服务器最多可直接连接7个CD-ROM SCSI 驱动器及56个磁盘。起价为999美元。     

基于QoS的多路视频回放

由于PC的速度有限,当视频回放的路数较多时,可能无法同时满足所有路的回放CPU资源要求,这时就需要进行合理的资源分配和调度。在多路回放中,每一路视频流可能对应于一种不同的网络带宽和传输质量,用户对每一路的回放质量、速度要求也会有差别。该文根据用户服务质量(QoS)要求,利用多缓冲区和调度算法对多路视频回放给出了一种优化解决方案。实验运行表明,该文算法的性能优于现有商用多路视频播放器。     

基于博弈论的多服务器多用户视频分析任务卸载算法

在过去的近10年中,人工智能相关的服务和应用大规模出现,它们要求高算力、高带宽和低时延.边缘计算目前被认为是这些应用最适合的计算模式,尤其是视频分析相关应用.研究多服务器多用户异构视频分析任务卸载问题,其中用户选择合适的边缘服务器,并将他们的原始视频数据上传至服务器进行视频分析.为了有效处理众多用户对有限网络资源的竞争和共享,并且能够获得稳定的网络资源分配局面,即每个用户不会单方面地改变自己的任务卸载决策,该多服务器多用户异构视频分析任务卸载问题被建模为一个多玩家的博弈问题.基于最小化整体时延的优化目标,先后研究非分布式视频分析场景和分布式视频分析场景两种情形,分别提出基于博弈论的潜在最优服务器选择算法和视频单元分配算法.通过严格的数学证明,两种情形下提出的算法均可以达到纳什均衡,同时保证较低的整体时延.最后,基于真实数据集的大量实验表明,所提方法比其他现有算法降低了平均26.3%的整体时延.     

Design and Implementation of the Stony Brook Video Server

The system architecture of the Stony Brook Video Server (SBVS), which guarantees end-to-end real-time video playback in a client-server setting, is presented. SBVS employs a real-time network access protocol, RETHER, to use existing Ethernet hardware as the underlying communications media. The video server tightly integrates the bandwidth guarantee mechanisms for network transport and disk I/O. SBVS's stream-by-stream disk scheduling scheme optimizes the effective disk bandwidth without incurring significant scheduling overhead. To demonstrate the feasibility of the proposed architecture, we have implemented a prototype called SBVS-1, which can support five concurrent MPEG-1 video streams on an Intel 486DX2/EISA PC. To our knowledge, this system is the first video server that provides an end-to-end performance guarantee from the server's disks to the each user's display over standard Ethernet. This paper describes the implementation details of integrating network and I/O bandwidth guarantee mechanisms, and the performance measurements that drive and/or validate our design decisions. © 1997 by John Wiley & Sons, Ltd.     

A Design Framework for Multi-Resolution Video Servers

Video can be encoded into multiple-resolution format in nature. A multi-resolution or scalable video stream is a video sequence encoded such that subsets of the full resolution video bit stream can be decoded to recreate lower resolution video streams. Employing scalable video enables a video server to provide multiple resolution services for a variety of clients with different decoding capabilities and network bandwidths connected to the server. The inherent advantages of the multi-resolution video server include: heterogeneous client support, storage efficiency, adaptable service, and interactive operations support.For designing a video server, several issues should be dealt with under a unified framework including data placement/retrieval, buffer management, and admission control schemes for deterministic service guarantee. In this paper, we present a general framework for designing a large-scale multi-resolution video server. First, we propose a general multi-resolution video stream model which can be implemented by various scalable compression techniques. Second, given the proposed stream model, we devise a hybrid data placement scheme to store scalable video data across disks in the server. The scheme exploits both concurrency and parallelism offered by striping data across the disks and achieves the disk load balancing during any resolution video service. Next, the retrieval of multi-resolution video is described. The deterministic access property of the placement scheme permits the retrieval scheduling to be performed on each disk independently and to support interactive operations (e.g. pause, resume, slow playback, fastforward and rewind) simply by reconstructing the input parameters to the scheduler. We also present an efficient admission control algorithm which precisely estimates the actual disk workload for the given resolution services and hence permits the buffer requirement to be much smaller. The proposed schemes are verified through detailed simulation and implementation.     

Dynamic batching policies for an on-demand video server

In a video-on-demand environment, continuous delivery of video streams to the clients is guaranteed by sufficient reserved network and server resources. This leads to a hard limit on the number of streams that a video server can deliver. Multiple client requests for the same video can be served with a single disk I/O stream by sending (multicasting) the same data blocks to multiple clients (with the multicast facility, if present in the system). This is achieved by batching (grouping) requests for the same video that arrive within a short time. We explore the role of customer-waiting time and reneging behavior in selecting the video to be multicast. We show that a first come, first served (FCFS) policy that schedules the video with the longest outstanding request can perform better than the maximum queue length (MQL) policy that chooses the video with the maximum number of outstanding requests. Additionally, multicasting is better exploited by scheduling playback of the most popular videos at predetermined, regular intervals (hence, termed FCFS-). If user reneging can be reduced by guaranteeing that a maximum waiting time will not be exceeded, then performance of FCFS- is further improved by selecting the regular playback intervals as this maximum waiting time. For an empirical workload, we demonstrate a substantial reduction (of the order of 60%) in the required server capacity by batching.     

视频服务器存储子系统的I/O优化

视频服务器存储子系统的I／O性能决定了视频服务器的总体性能。本文提出的一种新的实时磁盘调度算法（LLF－Window)能有效地服务各种编码格式的视频流，并对传统的SCSI总线不均衡调度机制进行了改造，实验结果表明，新的磁盘调度算法和改造后的SCSI总线调度机制有效地改进了视频服务器存储子系统的I／O性能，保证了视频流的连续播放。     

Efficient support for interactive operations in multi-resolution video servers

In this paper, we present a placement algorithm that interleaves multi-resolution video streams on a disk array and enables a video server to efficiently support playback of these streams at different resolution levels. We then combine this placement algorithm with a scalable compression technique to efficiently support interactive scan operations (i.e., fast-forward and rewind). We present an analytical model for evaluating the impact of the scan operations on the performance of disk-arr ay-based servers. Our experiments demonstrate that: (1) employing our placement algorithm substantially reduces seek and rotational latency overhead during playback, and (2) exploiting the characteristics of video streams and human perceptual tolerances enables a server to support interactive scan operations without any additional overhead.     

Design a progressive video caching policy for video proxy servers

Proxy servers have been used to cache web objects to alleviate the load of the web servers and to reduce network congestion on the Internet. In this paper, a central video server is connected to a proxy server via wide area networks (WANs) and the proxy server can reach many clients via local area networks (LANs). We assume a video can be either entirely or partially cached in the proxy to reduce WAN bandwidth consumption. Since the storage space and the sustained disk I/O bandwidth are limited resources in the proxy, how to efficiently utilize these resources to maximize the WAN bandwidth reduction is an important issue. We design a progressive video caching policy in which each video can be cached at several levels corresponding to cached data sizes and required WAN bandwidths. For a video, the proxy server determines to cache a smaller amount of data at a lower level or to gradually accumulate more data to reach a higher level. The proposed progressive caching policy allows the proxy to adjust caching amount for each video based on its resource condition and the user access pattern. We investigate the scenarios in which the access pattern is priorly known or unknown and the effectiveness of the caching policy is evaluated.     

请求下降邻域叠加选取分布式P2P 视频点播调度

为实现对等架构的低成本视频流传输和实时播放要求,提出基于请求下降叠加选 取的分布式P2P 视频点播调度算法。首先,基于叠加技术构建P2P 视频点播的技术指标,充分 考虑输入邻域节点、输出邻域节点和媒体服务器负载3 组优化指标,构建叠加架构和分布式算 法流程;其次,利用请求下降策略对发送节点和服务节点选取进行改进,解决可能出现的带宽 低利用率和无效的视频播放问题;最后,通过BitTorrent 视频点播系统对所提算法的有效性进 行了验证。     

Disk scheduling in video editing systems

Modern video servers support both video-on-demand and nonlinear editing applications. Video-on-demand servers enable the user to view video clips or movies from a video database, while nonlinear editing systems enable the user to manipulate the content of the video database. Applications such as video and news editing systems require that the underlying storage server be able to concurrently record live broadcast information, modify prerecorded data, and broadcast an authored presentation. A multimedia storage server that efficiently supports such a diverse group of activities constitutes the focus of this study. A novel real-time disk scheduling algorithm is presented that treats both read and write requests in a homogeneous manner in order to ensure that their deadlines are met. Due to real-time demands of movie viewing, read requests have to be fulfilled within certain deadlines; otherwise, they are considered lost. Since the data to be written into disk is stored in main memory buffers, write requests can be postponed until critical read requests are processed. However, write requests still have to be processed within reasonable delays and without the possibility of indefinite postponement. This is due to the physical constraint of the limited size of the main memory write buffers. The new algorithm schedules both read and write requests appropriately, to minimize the amount of disk reads that do not meet their presentation deadlines, and to avoid indefinite postponement and large buffer sizes in the case of disk writes. Simulation results demonstrate that the proposed algorithm offers low violations of read deadlines, reduces waiting time for lower priority disk requests, and improves the throughput of the storage server by enhancing the utilization of available disk bandwidth