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

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

流媒体缓存代理单一流映像机制与流预取策略研究

为了解决传统的流媒体服务模式（客户端/服务器）中存在的流媒体服务器负载重、客户端播放抖动频繁等问题,本文详细研究了实现流媒体缓存代理的单一流映像机制,并针对缓存代理端的接收和发送阶段提出了实现这一机制的相关算法.同时在深入研究流预取理论模型的基础上,创新性地提出了基于RTCP包反馈和RTP包网络延迟的流预取策略,从而保证了客户端的播放质量.测试表明单一流映像机制的正确性和流预取策略的高效性.     

基于RTP报文修改的单一流映像机制研究与实现

随着因特网流媒体应用的日益普及和流行，流媒体缓存代理技术逐渐成为近年来研究的热点。本文对实现流媒体缓存代理服务器的核心技术--单一流映像机制进行了理论上的分析和探讨；并结合实际项目研究，提出了RTP协议报文修改算法，通过在流媒体缓存代理服务器端采用该算法，成功实现了单一流映像机制。实际测试结果表明，这种基
于报文修改算法的单一流映像机制十分有效。     

基于补丁算法的流媒体代理缓存的研究与实现

对流媒体代理缓存和流调度技术进行了分析与研究，结合代理缓存和补丁算法的优点，设计与实现了一种基于补丁算法的流媒体代理缓存的高效方法。分析和实验研究表明，该方法能进一步减少对骨干网络带宽资源和原始服务器的磁盘I/O资源的占用，提高用户访问请求的响应速度。     

流媒体代理缓存的研究与实现

研究了流媒体代理缓存的特点和影响流媒体代理缓存效果的因素，分析了衡量流媒体代理性能的指标，设计了流媒体代理缓存管理文件的结构，最后给出了用户请求处理过程。     

流媒体代理缓存技术研究

随着流媒体技术在互联网上的广泛应用，原有用于加速Web内容分发的代理缓存技术也被应用于流媒体内容分发领域。然而，由于流媒体对象的一些独特特点，需要在传统Web缓存技术的基础上提出适用于流媒体对象的缓存技术。本文分析了基于代理缓存的流媒体分发中的关键问题和技术挑战，对现有的各种流媒体缓存方案进行了综述、分类和比较，最后对流媒体代理缓存的未来发展方向进行了展望。     

流内容分送中的媒体后缀动态缓存技术研究

基于带前缀缓存的流调度方案OBP（optimized batch patching）提出了媒体后缀的增量缓存算法IC-BP和预分配缓存算法PA-BP，推导出两种算法下传输单一流媒体对象各自所需的平均骨干带宽、服务器平均使用输出通道数和代理所需最大缓存容量，并分析了以上两种缓存算法的综合传输代价．结果表明，两种缓存算法均有效降低了骨干带宽消耗和服务器负载，传输代价均明显低于带前缀缓存的OBP．而PA-BP克服了IC-BP算法中每次批处理调度时都至少需请求一个批处理长度补丁的缺点．因而具有更低的传输代价，其性能优于IC-BP缓存算法．     

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

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

基于流行度预测的流媒体代理缓存替换算法

针对流行度随时间变化的特性，利用回归分析技术给出了一种流媒体文件的流行度预测算法，并在增加少量存储空间及计算时间消耗的情况下，将该预测算法应用于流媒体代理缓存服务器的缓存替换算法之中，模拟实验表明，该方法能减少缓存的替换次数，提高缓存命中率，性能较优。     

面向多应用环境RAID系统的智能预取和缓存调度

本文分析了RAID系统的多应用环境数据请求的存储模式的特点，提出了能根据应用环境的不同而自动改变预取策略的智能预取算法以及缓存调度算法。实践证明，本算法使得RAID系统的预取和缓存调度摆脱了盲目性，保证了预取策略和缓存调度的最优性。     

SProxy: A Caching Infrastructure to Support Internet Streaming

Many algorithmic efforts have been made to address technical issues in designing a streaming media caching proxy. Typical of those are segment-based caching approaches that efficiently cache large media objects in segments which reduces the startup latency while ensuring continuous streaming. However, few systems have been practically implemented and deployed. The implementation and deployment efforts are hindered by several factors: 1) streaming of media content in complicated data formats is difficult; 2) typical streaming protocols such as RTP often run on UDP; in practice, UDP traffic is likely to be blocked by firewalls at the client side due to security considerations; and 3) coordination between caching discrete object segments and streaming continuous media data is challenging. To address these problems, we have designed and implemented a segment-based streaming media proxy, called SProxy. This proxy system has the following merits. First, SProxy leverages existing Internet infrastructure to address the flash crowd. The content server is now free of the streaming duty while hosting streaming content through a regular Web server. Thus, UDP based streaming traffic from SProxy suffers less dropping and no blocking. Second, SProxy streams and caches media objects in small segments determined by the object popularity, causing very low startup latency, and significantly reducing network traffic. Finally, prefetching techniques are used to pro-actively preload uncached segments that are likely to be used soon, thus providing continuous streaming. SProxy has been extensively tested and we show that it provides high quality streaming delivery in both local area networks and wide area networks (e.g., between Japan and the U.S.).     

网络视频服务的代理缓存策略

流媒体传输已经成为Internet通信中的重要组成部分之一，虽然它可以从代理缓存中受益，但传统的代理缓存策略不能满足媒体对象所特有的特征，必须提出新颖的缓存方法。该文讨论了代理对视频流的缓存，包括前缀、分块和部分视频对象的全部缓存的问题和挑战。同时研究了缓存视频流的代理网络结构，有分布式、层次式和覆盖式，对它们进行了描述和评论，还把缓存和代理网络同组播相结合进行了讨论。     

流媒体对象的缓存管理策略

基于流媒体服务的代理技术是流媒体研究领域中的重要课题.随着流媒体技术在Internet和无线网络环境中的高速发展,对流媒体代理服务器的研究也正在逐步深入.本文主要讨论通过代理技术改善媒体的服务质量,降低媒体的传输延迟以及减轻网络负载.在Internet环境下,对流媒体代理服务器的研究集中于流媒体的访问特性、缓存替换算法,构建和实现一个流媒体代理服务器是对流媒体代理技术研究的基础.     

一种基于Sever和Proxy流媒体流行性的Caching策略

1 概述经过了2000、2001两年的社区宽带网建设的高速发展后,摆在中国ISP们面前的任务是如何在已建成的宽带网上开展增值服务,许多ISP尝试在宽带网上开展流媒体(Streaming Media)服务,如视频点播VOD(Video On-Demand)系统。然而,流媒体对网络带宽和实时性的要求使得流服务器必须能够进行端对端(End-to-End)的拥塞控制和质量调整,由于     

种基于Sever和Proxy流媒体流行性的Caching策略

It is expected that by 2003, continuous media will account for more than 50% of the data available on origin servers. This will provoke a significant change in Internet workload, due to the high bandwidth requirements and the long-lived nature of digital video, streaming server loads and network bandwidths are proving to be major limiting factors. Aiming at the characteristic of broadband network in a residential area, we propose a popularitybased on server-proxy caching strategy for streaming media. According to a streaming media popularity on streaming server and proxy, this strategy caches the content of this streaming media partially or completely, and plays an important role in decreasing server load, reducing the traffic from streaming server to proxy, and improving the startup latency of the client.     

局域网流媒体Caching代理服务器的实现

With the widespread use of streaming media application on the Internet, a significant change in Internet workload will be provoked.Caching is one kind of applied technique relatively for enhancing the scalability of streaming system and reducing the workload of server/network. We have utilized RTP/RTSP protocol, and implemented the prototype of streaming proxy caching based on LAN in visual C-t-t-environment with WINSOCK network interface. This system can play a role in decreasing server load, reducing the traffic from streaming server to proxy, and improving the Start-up latency of the client.     

Fast proxy delivery of multiple streaming sessions in shared running buffers

With the falling price of memory, an increasing number of multimedia servers and proxies are now equipped with a large memory space. Caching media objects in the memory of a proxy helps to reduce the network traffic, the disk I/O bandwidth requirement, and the data delivery latency. The running buffer approach and its alternatives are representative techniques to caching streaming data in the memory. There are two limits in the existing techniques. First, although multiple running buffers for the same media object co-exist in a given processing period, data sharing among multiple buffers is not considered. Second, user access patterns are not insightfully considered in the buffer management. In this paper, we propose two techniques based on shared running buffers in the proxy to address these limits. Considering user access patterns and characteristics of the requested media objects, our techniques adaptively allocate memory buffers to fully utilize the currently buffered data of streaming sessions, with the aim to reduce both the server load and the network traffic. Experimentally comparing with several existing techniques, we show that the proposed techniques achieve significant performance improvement by effectively using the shared running buffers.     

A QoS-Based Joint Scheduling and Caching Algorithm for Multimedia Objects

With the development of the broadband Internet, multimedia services have been widely deployed and contributed to a significant amount of todays Internet traffic. Like normal web objects (e.g., HTML pages and images), media objects can benefit from proxy caching; yet their unique features such as huge size and high bandwidth demand imply that conventional proxy caching strategies have to be substantially revised. Moreover, in the current Internet, clients are highly heterogeneous; it is necessary to differentiate their Quality-of-Service (QoS) requirements in streaming. However, the presence of an intermediate proxy in a streaming system poses great challenges to designers. This paper proposes a novel QoS-based algorithm for media streaming with proxy caching. We employ layered coding and transmission, and jointly consider the problems of caching and scheduling to improve the QoS for the clients. We derive general and effective solutions to the problems and evaluate their performance under various configurations. The results demonstrate that the proposed algorithm can accommodate diverse QoS demands from the clients, and yet satisfy stringent resource limits.