多媒体文件服务器的磁盘带宽分配策略

讨论多媒体文件服务器磁盘I/O带宽的分配策略问题,提出一种根据不同应用请求的负载变化情况对服务器磁盘带宽进行自适应分配的算法。该算法由负载检测模块、带宽管理模块组成,提高了多媒体文件服务器的易管理性,在短暂的过载情况下保持了服务器的稳定性,为更多的软实时请求提供服务。     

多媒体服务器混合磁盘调度策略

基于多媒体服务器的性能要求，提出了一种自适应的混合磁盘调度策略DRT-window．它既能满足实时请求对实时性的要求，根据实时请求的截止期动态选择窗口大小；又能在其松弛度内尽努力(best-effort)地服务非实时请求，从而减少非实时请求的响应时间。DRT-window采用了两级层次调度方案：第一层为不同类型的请求采用各自适合的调度策略；第二层为混合请求调度嚣，混合调度第一层中的不同类型的请求。通过性能比较和理论证明，表明此混合磁盘调度策略能在保证实时请求无抖动执行的同时，尽量地减少非实时请求的响应时间。     

请求速率对集群Web服务器调度的影响

讨论了集群Web服务器的几种常见请求调度策略，针对目前大多数的请求调度策略都是只考虑服务器的内在指标，而忽略了请求速率等输入指标对负载调度的影响，即使考虑了请求速率，也很少考虑请求速率变化突发性对Web服务器的影响。通过分析请求速率对Web服务器的性能影响，可以利用输入指标结合服务器指标来调度请求输入，从而有效地解决服务器间的负载不平衡。     

一种共享存储视频服务器集群的请求调度策略

在VOD服务器集群中,对用户服务请求的合理调度是提高集群整体性能的关键技术之一.本文针对共享存储结构下的服务器机群,在请求调度算法LoadCache-rep基础上进行改进,提出一种基于视频节目点播集中度的调度策略,该策略通过将相近的点播请求调度至相同服务器上以充分利用服务器的缓存机制,同时兼顾均衡各服务器间的负载.并根据实时负载变化对请求进行迁移以消除VCR操作对负载分布的影响.仿真试验表明,该策略能有效提高视频服务器集群的运行性能.     

基于收益驱动请求分类的多目标动态优先请求调度

请求调度通常需要在充分利用现有服务器资源的基础上满足响应时间最小化和系统吞吐量最大化的目标,但对于以盈利为目的的电子商务网站来说,关键还是要提高交易请求和VIP用户发起请求的达成率。针对电子商务网站请求调度的多重目标,首先提出了收益驱动的请求分类多维标准,在此基础上定义了请求优先级和调度优先级的概念,给出了基于请求分类的多目标动态优先调度算法MODP,并引入了基于事前过载判断而非负载测量的调度机制以避免控制延迟,有利于电子商务网站在多变的负载条件下自适应地实现差别服务和QoS保障。仿真实验证明了MODP机制与算法的有效性,将其与传统FCFS调度方法进行对比研究,结果表明:服务器无论在高载还是低载情况下,MODP调度策略在实现收益最大化、平均响应时间最小化的目标方面都具有明显的优势。     

基于随机高级Petri网模型的服务器均衡集群

在均衡集群中请求的分配和选择服务是影响服务器集群性能的关键。本文基于随机高级Petri网(SHLPN)模型提出了动态反馈请求负载分配算法和加权队列选择的综合均衡调度方案。根据集群中各服务器实体的实时负载状况动态分配请求并结合请求权值实施服务,提高了系统的负载均衡能力。     

基于响应延时预测的流媒体集群服务器负载调度策略

随着流媒体应用的指数级增长,提高流媒体服务器的性能越发重要。本文提出一种流媒体集群服务器的负载调度策略。综合运用多级模糊系统和人工神经网络技术,对用户请求响应延时进行模糊预测,并考虑节点服务器的流媒体节目前缀缓存和补丁预取技术,提出基于响应延时阈值和请求流媒体节目在节点服务器的缓存情况的负载调度算法,并对该算法进行仿真验证。     

集群系统中自适应负载反馈平衡策略的研究

当前在集群系统中，负载平衡策略虽然很多，但是为了减少反馈开销，一般策略为采用在前端估计后端负载，所以不能很好地完成负载平衡的任务。针对这一问题，提出了一种自适应负载反馈平衡策略，各个服务器根据自身负载的变化来决定负载反馈的时机，前端根据负载信息和请求率计算出各个服务器的负载权值，最后根据负载权值来调度服务器处理请求，以实现负载平衡。由于采用了自适应的反馈策略，在获得各个服务器负载信息的同时减少了负载反馈的开销，实现了系统的负载均衡。测试结果表明该策略表现出了一定的优势。     

一种Web集群系统的动态分离式调度策略

静态分离式调度策略（SSSP）不能有效地分配服务器资源。动态分离式调度策略（DSSP）对静态请求和动态请求分别以请求的文件和用户会话为单元进行调度。请求分发器监测后端服务器的状态,按资源使用情况将服务器区分为轻载、重载和过载,轻载服务器可以接收新的请求单元,重载服务器不接收新请求单元,但继续为已接收的请求单元服务,过载服务器迁移部分请求单元到轻载服务器。试验结果表明,DSSP的效率明显优于SSSP。     

基于CN-RAID存储系统的集群VOD服务器的CRS调度策略

磁盘I/O是VOD服务器性能的主要瓶颈之一,利用集群中所有分布的磁盘并行服务和合理的调度策略是缓解这一瓶颈的有效途径.针对传统的网络文件系统需要集中文件服务的不足,设计了一种分布式软件网络磁盘阵列存储系统,并提出了一种基于服务器推(push)模式的并发轮循CRS(concurrent round sweep)调度策略,以提高的系统的服务能力.根据这些思想,在Linux内核级设计了一个协作网络RAID驱动器CN-RAID(cooperative net RAID driver)模块,将所有集群中分布的磁盘组成一个全局虚拟磁盘,并进行视频文件的存储和调度管理.模拟测试表明,该系统能够支持大量并发流的请求,并具有良好的扩展性.     

面向智慧矿山管控平台的视频点播技术

针对现有的视频点播技术无法直接在智慧矿山管控平台中直接使用的问题, 基于HTTP的自适应码率流媒体传输协议与FFmpeg开源库设计一种视频点播技术. 该技术包括客户端模块、Web请求处理模块、多媒体处理模块. 该技术中客户端模块通过设定的视频源信息向Web请求处理模块发送视频请求; Web请求处理模块利用请求中的视频源...     

Admission control for media on demand services

Admission control software is used to make accept or deny decisions about incoming service requests to avoid overload. Existing media streaming software includes only limited support for admission control by allowing for predefined static rules. Such rules limit for example the number of requests that are allowed to enter the system during a certain time or define thresholds concerning the utilization level of a single resource such as network bandwidth. In media streaming applications, however, the bottleneck resource (CPU, Disk I/O, network bandwidth, etc.) might change over time depending on the current demand for different types of audio or video files. This paper proposes a model for adaptive admission control in the presence of multiple scarce resources. Opportunity costs for a service request are determined at the moment of an incoming request and compared to the revenue of a request in order to make an accept/deny decision. Opportunity costs are based on resource utilization, service resource requirements, expected future demand for services, and the revenue per accepted service. The model allows rejection of service requests early to reserve capacity required to perform future service requests with higher revenues. We describe a number of experiments to illustrate the benefits of adaptive admission control models over static admission control rules.     

A unified benchmarking and model-based framework for building QoS-aware streaming media services

A number of technology and workload trends motivate us to consider the appropriate resource allocation mechanisms and policies for streaming media services in shared cluster environments. We present MediaGuard – a model-based infrastructure for building streaming media services – that can efficiently determine the fraction of server resources required to support a particular client request over its expected lifetime. The proposed solution is based on a unified cost function that uses a single value to reflect overall resource requirements such as the CPU, disk, memory, and bandwidth necessary to support a particular media stream based on its bit rate and whether it is likely to be served from memory or disk. We design a novel, time-segment-based memory model of a media server to efficiently determine in linear time whether a request will incur memory or disk access when given the history of previous accesses and the behavior of the server's main memory file buffer cache. Using the MediaGuard framework, we design two media services: (1) an efficient and accurate admission control service for streaming media servers that accounts for the impact of the server's main memory file buffer cache, and (2) a shared streaming media hosting service that can efficiently allocate the predefined shares of server resources to the hosted media services, while providing performance isolation and QoS guarantees among the hosted services. Our evaluation shows that, relative to a pessimistic admission control policy that assumes that all content must be served from disk, MediaGuard (as well as services that are built using it) deliver a factor of two improvement in server throughput.     

Constructing a video server with tertiary storage: Practice and experience

Handling a tertiary storage device, such as an optical disk library, in the framework of a disk-based stream service model, requires a sophisticated streaming model for the server, and it should consider the device-specific performance characteristics of tertiary storage. This paper discusses the design and implementation of a video server which uses tertiary storage as a source of media archiving. We have carefully designed the streaming mechanism for a server whose key functionalities include stream scheduling, disk caching and admission control. The stream scheduling model incorporates the tertiary media staging into a disk-based scheduling process, and also enhances the utilization of tertiary device bandwidth. The disk caching mechanism manages the limited capacity of the hard disk efficiently to guarantee the availability of media segments on the hard disk. The admission controller provides an adequate mechanism which decides upon the admission of a new request based on the current resource availability of the server. The proposed system has been implemented on a general-purpose operating system and it is fully operational. The design principles of the server are validated with real experiments, and the performance characteristics are analyzed. The results guide us on how servers with tertiary storage should be deployed effectively in a real environment. RID="*" ID="*" e-mail: hjcha@cs.yonsei.ac.kr     

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.     

本地带宽资源管理系统的设计与实现

通过分析传统的尽最大努力(BE)传输网络在传输视频流时存在的服务性能高度依赖于本地可用带宽资源问题,设计并实现了本地带宽资源管理系统.可有效管理本地网络带宽资源,同时为视频流传输提供有保证转发(AF)服务.测试结果表明,该系统能有效保障视频流的服务质量(QoS).     

一种提高Web服务器性能的方法

首先阐述了Ｗｅｂ服务器性能的定义，然后从Ｗｅｂ服务器性能的几个关键问题入手，从应用负载、服务器软件和服务器硬件３个层面上详细讨论了如何解决这些关键问题．通过对比目前流行的测试工具，选择了合适的应用负载；采用探索式方法优化服务器软件的配置参数，从而减少了测试次数；通过屏蔽各种ＨＴＴＰ请求找出影响性能的瓶颈——对动态请求ＣＡＤ　ＧＥＴ的处理．针对该种请求，调整其在动态请求中所占的比例并分析其对不同大小的文件在响应速度上的影响，最后优化相应的代码．将这一方案应用到曙光３０００超级服务器上并使用ＳＰＥＣｗｅｂ９９作为Ｂｅｎｃｈｍａｒｋ测出实验数据，对比改进前的结果，可以明显看到Ｗｅｂ服务器的性能提高了一倍．     

Efficient journaling writeback schemes for reliable and high-performance storage systems

We propose a efficient writeback scheme that enables guaranteeing throughput in high-performance storage systems. The proposed scheme, called de-fragmented writeback (DFW), reduces positioning time of storage devices in writing workloads, and thus enables fast writeback in storage systems. We consider both of storage media in designing DFW scheme; traditional rotating disk and emerging solid-state disks. First, sorting and filling holes methods are used for rotating disk media for the higher throughput. The scheme converts fragmented data blocks into sequential ones so that it reduces the number of write requests and unnecessary disk-head movements. Second, flash block aware clustering-based writeback scheme is used for solid-state disks considering the characteristics of flash memory. The experimental results show that our schemes guarantee system’s high throughput while guaranteeing data reliability.     

Continuous retrieval of multimedia data using parallelism

Most implementations of workstation-based multimedia information systems cannot support a continuous display of high resolution audio and video data and suffer from frequent disruptions and delays termed hiccups. This is due to the low I/O bandwidth of the current disk technology, the high bandwidth requirement of multimedia objects, and the large size of these objects, which requires them to be almost always disk resident. A parallel multimedia information system and the key technical ideas that enable it to support a real-time display of multimedia objects are described. In this system, a multimedia object across several disk drives is declustered, enabling the system to utilize the aggregate bandwidth of multiple disks to retrieve an object in real-time. Then, the workload of an application is distributed evenly across the disk drives to maximize the processing capability of the system. To support simultaneous display of several multimedia objects for different users, two alternative approaches are described. The first approach multitasks a disk drive among several requests while the second replicates the data and dedicates resources to each individual request. The trade-offs associated with each approach are investigated using a simulation model