部分缓存算法在流媒体内容分发网络中的应用研究

内容分发网络是互联网中解决响应速度、提高服务质量的一种应用技术，而流媒体内容分发网络是将内容分发网络应用于流媒体传输领域。流媒体内容分发网络中的边缘服务器缓存策略是流媒体内容分发网络的核心。本文深入研究了现有各种缓存策略；在流媒体内容分发网络中，提出了一种部分缓存算法。实践证明，这种部分缓存策略能明显提高流媒体内容分发网络的并发性能、命中率和服务质量等性能。     

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

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

一种用于流媒体的附网缓存方案

网络缓存是提高流媒体服务质量的一种有效方法，但现有的代理缓存技术并不能很好地适用于流媒体。基于附网存储技术提出了一种用于流媒体的附网缓存方案。通过将流媒体缓存到作为附网存储设备的缓存服务器上，并由之为后来的用户请求提供服务，可以缩短启动延迟，减轻代理服务器负载和远程网络负载。同时，还讨论了与附网缓存相关的设计问题。     

基于P2P的流媒体代理缓存系统

文章介绍了传统代理缓存系统和P2P流媒体系统在传输流媒体的不足,提出了一种把代理缓存技术和P2P流媒体技术相结合的流媒体服务系统。该系统解决了基于代理缓存的技术的可扩展性问题,消除了仅仅依赖节点自组织的P2P流媒体技术的服务质量不稳定的问题,能够提供可扩展的流服务的传送。     

用户驱动的流媒体动态分段缓存调度策略

在设计分布式流媒体代理缓存结构时,需要注意的两个主要方面是如何节省网络带宽和提高缓存命中率.基于此,提出了一种动态分段的流媒体代理缓存策略(SDD),该策略结合用户访问的趋势,并考虑不同网络用户的带宽和各媒体之间的差异,真正实现了流媒体对象的动态分段缓存.分析表明该缓存策略能普遍地适用于不同网络的大多数用户,不仅能够提高用户的请求命中率,同时还能提高缓存的利用率.     

一种基于质量命中率的流媒体代理缓存布局方法

在网络边缘对流媒体的热点片段进行缓存，是流媒体分发研究领域的一个热点。异构环境下不同种类的接入用户对流媒体的播放质量具有不同的要求。为了使代理缓存最大限度地满足全体用户对收看质量的请求，本文首先提出了质量命中率的定义来衡量代理缓存对提高用户观看质量的贡献，然后提出了一种基于质量命中率的流媒体代理缓存布局方法。仿真结果表明，该布局方法不仅能使全体用户的平均质量命中率最大，而且有效地利用了代理缓存的磁盘空间，显著降低了片段的播放时延。     

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

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

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

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

基于P2P的3G流媒体代理缓存策略

3G时代已经到来,伴随着3G的快速发展,移动流媒体服务的需求迅速增长。由于移动网络带宽远达不到互联网的带宽,流媒体业务的增长将增加网络延迟,影响流媒体的观看质量,因此提出了一种新的基于P2P的3G流媒体缓存代理结构PSPA,配合PSPA设计了代理缓存置换策略SCOP,该设计能有效降低对移动核心网带宽的占用。最后,仿真实验和实验结果分析表明,PSPA体系与代理缓存置换策略SCOP的结合,能有效提高移动流媒体的服务质量,对3G流媒体的应用具有一定的参考价值。     

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

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

Network-aware partial caching for Internet streaming media

The delivery of multimedia over the Internet is affected by adverse network conditions such as high packet loss rate and long delay. This paper aims at mitigating such effects by leveraging client-side caching proxies. We present a novel cache architecture and associated cache management algorithms that turn edge caches into accelerators of streaming media delivery. This architecture allows partial caching of media objects and joint delivery from caches and origin servers. Most importantly, the caching algorithms are both network-aware and stream-aware; they take into account the popularity of streaming media objects, their bit rate requirements, and the available bandwidth between clients and servers. Using Internet bandwidth models derived from proxy cache logs and measured over real Internet paths, we have conducted extensive simulations to evaluate the performance of various cache management algorithms. Our experiments demonstrate that network-aware caching algorithms can significantly reduce startup delay and improve stream quality. Our experiments also show that partial caching is particularly effective when bandwidth variability is not very high.Shudong Jin: Corespondence to This research was supported in part by NSF (awards ANI-9986397, ANI-0095988, ANI-0205294 and EJA-0202067) and by IBM. Part of this work was done while the first author was at IBM Research in 2001.     

一种支持视频VCR操作的共享动态缓存算法

支持VCR操作是流媒体服务的重要功能,现有流媒体服务器中的常见缓存算法均未能充分考虑对VCR操作的支持。在性能良好的SRB算法的基础上,结合补丁技术提出了支持VCR操作的SRC-SV算法。仿真结果表明,SRC-SV算法能够较好支持用户的VCR操作,并能有效地降低服务器开销以及主干网的带宽消耗。     

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.).     

A dynamic caching algorithm based on internal popularity distribution of streaming media

Most proxy caches for streaming videos do not cache the entire video but only a portion of it. This is partly due to the large size of video objects. Another reason is that the popularity of different parts of a video can be different, e.g., the prefix is generally more popular. Therefore, the development of efficient cache mechanisms requires an understanding of the internal popularity characteristics of streaming videos. This paper has two major contributions. Firstly, we analyze two 6-month long traces of RTSP video requests recorded at different streaming video servers of an entertainment video-on-demand provider, and show that the traces provide evidence that the internal popularity of the majority of the most popular videos obeys a k-transformed Zipf-like distribution. Secondly, we propose a caching algorithm which exploits this empirical internal popularity distribution. We find that this algorithm has similar performance compared with fine-grained caching but requires significantly less state information.     

一种基于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.     

基于代理的流媒体动态共享缓存算法研究*

研究了代理服务器在流媒体传输和缓存方面对于网络带宽的消耗以及在缓存过程中内存分配和管理等方面存在的问题;在分析了现有的流媒体代理缓存技术的基础上,提出了基于代理服务器的流媒体动态共享缓存(DSB)算法.分析和实验结果表明,与现有的缓存技术相比,DSB算法能够有效地提高缓冲区的利用率,节省代理服务器的内存资源,节省网络带宽,同时能够为更多的客户端请求提供服务,并且可以有效地缩短请求延时.     

基于流媒体服务的IP网络内容分发系统的设计

IP网络中数据量巨大的流媒体内容使服务器和骨干网络承受的压力越来越大。内容分发系统对保证流媒体QoS起到至关重要的作用。该文通过分析内容分发网络(CDN)和P2P两种新型内容分发技术，提出了多源网状散列式P2P模型和一种改进的内容缓存算法，设计了基于CDN和P2P技术的内容分发系统。系统可同时满足请求多和请求少的情况，提高了流媒体QoS。     

Caching strategies in transcoding-enabled proxy systems for streaming media distribution networks

With the wide availability of high-speed network access, we are experiencing high quality streaming media delivery over the Internet. The emergence of ubiquitous computing enables mobile users to access the Internet with their laptops, PDAs, or even cell phones. When nomadic users connect to the network via wireless links or phone lines, high quality video transfer can be problematic due to long delay or size mismatch between the application display and the screen. Our proposed solution to this problem is to enable network proxies with the transcoding capability, and hence provide different, appropriate video quality to different network environment. The proxies in our transcoding-enabled caching (TeC) system perform transcoding as well as caching for efficient rich media delivery to heterogeneous network users. This design choice allows us to perform content adaptation at the network edges. We propose three different TeC caching strategies. We describe each algorithm and discuss its merits and shortcomings. We also study how the user access pattern affects the performance of TeC caching algorithms and compare them with other approaches. We evaluate TeC performance by conducting two types of simulation. Our first experiment uses synthesized traces while the other uses real traces derived from an enterprise media server logs. The results indicate that compared with the traditional network caches, with marginal transcoding load, TeC improves the cache effectiveness, decreases the user-perceived latency, and reduces the traffic between the proxy and the content origin server.     

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

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