基于批处理补丁的流媒体后缀动态缓存算法

在IP网络上高效传输流式存储型A／V数据是实现诸如VOD等应用的基础。当前一些典型的传输方案考虑了服务器调度策略以降低骨干网带宽消耗和服务器负载，但并未考虑媒体后缀的缓存策略。本文在带前缀的OBP算法基础上提出了流媒体对象后缀的增量式缓存及快速释放算法ICBR，并推导出了采用IC算法所需的骨干网带宽的理论结果。通过针对上述两种算法的仿真实验，本文的结果表明：即使在有限的缓存容量的前提下，采用IC算法和ICBR算法对媒体对象的后缀进行动态缓存可以显著降低骨干网链路上传输的补丁数据量，其骨干网带宽消耗显著优于OBP，从而在保证客户端较小的播放启动延迟的情况下有效降低了流媒体传输中骨干网带宽的消耗和服务器的负载。     

基于后缀动态多缓存协作的流媒体分发技术

在Internet上高效传输流媒体数据是推广诸如视频点播等应用的基础．现有方案仅考虑了采用单代理结构的前缀缓存和服务器调度来降低骨干网带宽消耗和服务器负载．在带前缀缓存的Batch patching基础上提出了后缀的动态缓存算法ICBR，并提出了基于ICBR缓存算法的多缓存协作体系结构及协作算法MCC，仿真结果表明，基于ICBR的多缓存协作显著地降低了获取补丁而导致的骨干网带宽的消耗，提高了客户端QoS同时也降低了服务器负载．     

基于混合模式的流媒体缓存调度算法

介绍了一种结合了CDN和P2P互补优势的流媒体混合内容分发网络(HyCDN)。针对HyCDN不同区域提出了相应的缓存算法,域内用户端综合考虑了流媒体前缀字节的有用性、文件的传输代价及点播热度,在此基础上提出缓存替换算法(Comprehensive Value Cache Replacement Algorithm for P2P, CVCR4P2P);对域间边缘服务器采用 补丁预取与调度算法(Dynamic Scheduling Algorithm for Proxy Caching, DSA4ProxyC),通过基于用户访问情况自适应伸缩缓存的分配方案,使流媒体后缀部分在边缘服务器中缓存的数据段与其流行度成正比。理论分析及实验结果表明,混合流媒体缓存调度策略的实施能有效地降低骨干网络带宽资源消耗,对用户请求到达速率的变化具有良好的适应性。     

基于代理缓存的流媒体动态调度算法研究

该文研究了在Internet环境下通过代理服务器将流媒体从源服务器传输到多个客户端时的骨干网络及服务器带宽消耗问题．在分析了传统多媒体流动态调度算法不足的基础上,提出了基于代理服务器协助的补丁预取与服务调度算法(P^3S^2A)．由代理服务器通过单播连接从源服务器中获取流媒体数据,然后通过组播方式转发给客户端．同时根据当前客户请求到达的分布状况,代理服务器为后续到达的客户请求进行补丁预取及缓存．理论分析及实验结果表明,与传统的动态调度方法相比,该文提出的算法能够在不消耗更多的缓存空间的情况下,更有效地节省骨干网络的带宽资源,特别是在访问请求强度较高的情况下,效果更为突出。     

基于代理缓存的移动流媒体动态调度算法

提出了一种基于代理缓存的移动流媒体动态调度算法DS2AM2PC（Dynamic Scheduling Algorithm for Mobile Streaming Mediabased on Proxy Caching）,采用代理缓存窗口自适应伸缩和分段缓存补丁块方案,在代理缓存中根据具体情况每次缓存相同或者不同大小的段补丁块,同时隔一段时间,根据移动媒体流行度更新一次缓存窗口大小,动态决定其最大缓存大小,实现了移动流媒体对象在代理服务器中缓存的数据量和其流行度成正比的原则.仿真结果表明,对于客户请求到达速率的变化,DS2AM2PC算法比P3S2A（Proxy-assisted Patch Pre-fetching and Service Scheduling Algorithm）算法和OBP（Optimized Batch Patching）＋prefix ＆ patchcaching算法具有更好的适应性,在最大缓存空间相同的情况下,能显著减少通过补丁通道传输的补丁数据,从而降低了服务器和骨干网络带宽的使用,能快速缓存媒体对象到缓存窗口,同时减少了代理服务器的缓存平均占有量.     

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

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

基于可变窗口的流媒体缓存算法研究与实现

缓存管理是影响流媒体服务器性能的关键因素之一。通过对流媒体访问特性的分析,提出并实现了基于可变窗口的流媒体缓存替换算法CABVW。该算法通过动态调整拆分代价和合并代价的阈值,实现了磁盘带宽和缓存的负载平衡。实验结果表明,该算法与传统主流算法相比明显地增加了流媒体服务器的并发用户数量;算法计算复杂度低,也较易于实现。     

一种新的基于代理缓存的流媒体分送策略

提出了一种新的带缓存的补丁调度策略,有效地将代理缓存与服务器调度技术结合起来,采用基于缓存窗口自适应伸缩的缓存分配方案,实现了流媒体对象在代理服务器中缓存的数据段数与其流行度成正比的原则。理论分析及实验结果表明,该策略有效地降低了服务器及骨干网络带宽资源的消耗,对于客户请求到达速率的变化具有非常好的适应性。     

树形网络中的一种有效视频内容分发算法

随着互联网中视频内容比重的迅速增加,视频业务随之也在不断的增加,这些视频业务将占据大量的互联网带宽.如何节约带宽和提高视频服务质量已成为互联网研究中的重要研究课题,而提高视频业务服务质量的两个主要途径是增加网络带宽和增加网络中缓存视频服务器的容量.为了使得视频服务商对增加带宽和增加缓存容量的投入最小化,就要决定网络视频内容在网络服务器中如何放置和分发.在本文中,首先我们基于内容放置和内容传输代价对树形网络中的视频内容放置问题进行数学建模,其次我们根据该数学模型提出一种有效的动态规划算法.该算法不仅可以有效解决了我们提出模型中的整数规划问题,而且其时间复杂度为O(NP).     

多通道并行传输中接收缓存阻塞的缓解方法

针对多通道并行传输中的接收缓存阻塞问题,分析了引起接收缓存阻塞的原因,提出一种改进的缓解接收缓存阻塞的数据包调度方法,综合考虑通道的带宽、时延和丢包率,引入通道质量的评价函数,优化多通道之间的数据包调度,选择质量最好的通道进行传输,减少由于通道特性不同造成的接收端数据包乱序;提出一种改进的数据包重传策略,基于时延和丢包率选择能使数据包最快到达接收端的通道进行重传;提出一种根据通道的带宽-延迟积估算所需接收缓存大小的方法。仿真实验表明,所提出的调度方法和重传策略能够有效地减轻接收缓存阻塞,与CMT-SCTP相比具有更优的性能,所提出的缓存大小的估算方法也能够准确估算所需接收缓存的大小。     

Techniques for increasing the stream capacity of a high-performancemultimedia server

High-performance servers and high-speed networks will form the backbone of the infrastructure required for distributed multimedia information systems. A server for an interactive distributed multimedia system may require thousands of gigabytes of storage space and a high I/O bandwidth. In order to maximize the system utilization, and thus minimize the cost, it is essential that the load be balanced among each of the server's components, viz. the disks, the interconnection network and the scheduler. Many algorithms for maximizing retrieval capacity from the storage system have been proposed in the literature. This paper presents techniques for improving the server capacity by assigning media requests to the nodes of a server so as to balance the load on the interconnection network and the scheduling nodes. Five policies for request assignment-round-robin (RR), minimum link allocation (MLA), minimum contention allocation (MCA), weighted minimum link allocation (WMLA) and weighted minimum contention allocation (WMCA)-are developed. The performance of these policies on a server model developed by the authors (1995) is presented. We also consider the issue of file replication, and develop two schemes for storing the replicas: the parent group-based round-robin placement (PGBRRP) scheme, and the group-wide round-robin placement (GWRRP) scheme. The performance of the request assignment policies in the presence of file replication is presented     

Batching and dynamic allocation techniques for increasing the stream capacity of an on-demand media server

A server for an interactive distributed multimedia system may require thousands of gigabytes of storage space and high I/O bandwidth. In order to maximize system utilization, and thus minimize cost, the load must be balanced among the server's disks, interconnection network and scheduler. Many algorithms for maximizing retrieval capacity from the storage system have been proposed. This paper presents techniques for improving server capacity by assigning media requests to the nodes of a server so as to balance the load on the interconnection network and the scheduling nodes. Five policies for dynamic request assignment are developed. An important factor that affects data retrieval in a high-performance continuous media server is the degree of parallelism of data retrieval. The performance of the dynamic policies on an implementation of a server model developed earlier is presented for two values of the degree of parallelism.     

采用新的流调度策略的视频点播系统研究

客户多播补块流调度策略——CMP(Client Multicast Patching)——是基于代理缓存的有效的视频点播策略，它采用用户参与流调度的方式，某些用户在播放节目的同时，又作为服务器为后续用户多播一部分节目，因此，在不增加用户I／O带宽的前提下，通过利用局域网络丰富的带宽．有效地节省了服务器及主干网络的资源，并对用户请求提供即时服务，该文给出CMP方案的实现算法，并对系统进行仿真及性能分析，结果表明了CMP方案的有效性和可行性。     

Performance study of online batch-based digital signature schemes

A digital signature is an important type of authentication in a public-key (or asymmetric) cryptographic system, and it is widely used in many digital government applications. We, however, note that the performance of an Internet server computing digital signatures online is limited by the high cost of modular arithmetic. One simple way to improve the performance of the server is to reduce the number of computed digital signatures by combining a set of documents into a batch in a smart way and signing each batch only once. This approach could reduce the demand on the CPU but require more network bandwidth of sending extra information to clients.In this paper, we investigate performance of different online digital signature batching schemes. That is, we provide a framework for studying as well as analyzing performance of a variety of such schemes. The results show that substantial computational benefits can be obtained from batching without significant increases in the amount of additional information that needs to be sent to the clients. Furthermore, we explore the potential benefits of considering more sophisticated batching schemes. The proposed analytical framework uses a semi-Markov model of a batch-based digital signature server. Through the emulation and the simulation, the results show the accuracy and effectiveness of our proposed analytic framework.     

流媒体代理缓存和预取方法的研究

代理缓存可以降低用户的启动延迟，减轻网络流量和服务器的负载，且在Web中也已广泛使用。但由于流媒体和非流媒体(文本，图像)有着显著的区别，目前，支持流媒体的代理缓存技术还面临着许多挑战。文中针对流媒体的数据量大和高带宽需求等特性，对支持流媒体的代理缓存和预取方法进行了总结。调研、分类、比较了目前已有的一些缓存算法和预取算法的优缺点，为下一步的研究提供启发和借鉴作用，同时指出将来的研究方向和热点问题。     

Efficient schemes for broadcasting popular videos

We provide a formal framework for studying broadcasting schemes and design a family of schemes for broadcasting popular videos, the greedy disk-conserving broadcasting (GDB) family. We analyze the resource requirements for GDB, i.e., the number of server broadcast channels, the client storage space, and the client I/O bandwidth required by GDB. Our analysis shows that all of our proposed broadcasting schemes are within a small factor of the optimal scheme in terms of the server bandwidth requirement. Furthermore, GDB exhibits a tradeoff between any two of the three resources. We compare our scheme with a recently proposed broadcasting scheme, skyscraper broadcasting (SB). With GDB, we can reduce the client storage space by as much as 50% or the number of server channels by as much as 30% at the cost of a small additional increase in the amount of client I/O bandwidth. If we require the client I/O bandwidth of GDB to be identical to that of SB, GDB needs only 70% of the client storage space required by SB or one less server channel than SB does. In addition, we show that with small client I/O bandwidth, the resource requirements of GDB are close to the minimum achievable by any disk-conserving broadcasting scheme.     

LBBSRT: An efficient SDN load balancing scheme based on server response time

The response time is the most important factor determining user experiences in the service provision model involving server clusters. However, traditional server cluster load balancing scheme are limited by the hardware conditions, and cannot completely exploit the server response times for load balancing. In order to effectively resolve the traditional load balancing schemes, we propose a load balancing scheme based on server response times by using the advantage of SDN flexibility, named LBBSRT. Using the real-time response time of each server measured by the controller for load balancing, we process user requests by obtaining an evenly balanced server loads. Simulation experiments show that our scheme exhibits a better load balancing effect and process requests with a minimum average server response times. In addition, our scheme is easy to implement, and exhibits good scalability and low cost characteristics.     

Run-time optimization of heterogeneous media access in a multimediaserver

Discrete media (DM) data throughput is vital to systems that need to support the heterogeneity and variety of data found in interactive hypermedia and digital library applications. Therefore, a multimedia server's ability in delivering a high DM data throughput without degrading its CM data throughput deserves more attention. In this paper, we address this issue by optimizing the use of disk bandwidth spent on CM service at run-time and redirecting the saved bandwidth to service DM requests. Based on a new cost model of disk access incurred in CM service, we formulate strategies to control the size of each disk read at run time. These strategies improve the efficiency of each disk access and improve the DM data throughput of a multimedia server, without jeopardizing the CM throughput. Through experimental evaluations, the improvements achieved are demonstrated. Furthermore, efficient control of the allocation of disk bandwidth between DM and CM services over a wide range is also demonstrated     

Efficient admission control algorithms for multimedia servers

In this paper, we have proposed efficient admission control algorithms for multimedia storage servers that are providers of variable-bit-rate media streams. The proposed schemes are based on a slicing technique and use aggressive methods for admission control. We have developed two types of admission control schemes: Future-Max (FM) and Interval Estimation (IE). The FM algorithm uses the maximum bandwidth requirement of the future to estimate the bandwidth requirement. The IE algorithm defines a class of admission control schemes that use a combination of the maximum and average bandwidths within each interval to estimate the bandwidth requirement of the interval. The performance evaluations done through simulations show that the server utilization is improved by using the FM and IE algorithms. Furthermore, the quality of service is also improved by using the FM and IE algorithms. Several results depicting the trade-off between the implementation complexity, the desired accuracy, the number of accepted requests, and the quality of service are presented.