自适应流媒体传输方案研究及其应用

提出了一种自适应流媒体传输方案，根据网络状况调整视频数据的发送速率和视频流的码率，以保证视频数据顺利及时的传输到客户端，使客户端能够顺利进行高质量的媒体播放。该方案涵盖了码率整形、拥塞控制和视频质量自适应等功能模块及其相互关系，各功能模块可以依据应用需求选择算法加以具体实现，从而提高了方案的可扩展性和灵活性。所以该方案不依赖于具体的视频编码标准和网络协议，适用范围较广。文中还基于实际流媒体服务器给出了该方案的一个实际应用，点播测试实验汪明该方案是有效的。     

基于MPEG-4的流媒体服务器端缓冲区管理

服务器端缓冲技术是流媒体系统中常用的一种应用控制技术，能够平滑网络抖动，减少数据丢失，提高客户端视频播放质量。该文的缓冲区管理增加了码率控制的功能，控制策略能进一步提高视频质量，特别适合于系统资源有限、带宽窄或强实时性的视频流式传输。     

Media Streams Scheduling for Synchronization in Distributed Multimedia Systems

In this paper, we consider the problem of multimedia synchronization based on scheduling the transmission of multimedia documents in a networked environment. Assuming channels with different bandwidth and delay characteristics are established between the multimedia server and the client, we formulate the scheduling problem to ensure interstream and intrastream synchronization as a parallel processor scheduling problem. Since the heterogeneous parallel processor scheduling problem is NP-hard, we propose two heuristic algorithms with time complexity ofO(n log n+nm), wherenis the number of data units to be scheduled andmthe number of channels available. We also develop an enumerative algorithm to obtain the exact solutions. Extensive computational simulations reveal that the heuristics consistently obtain near-optimal solutions. From the simulation results, we also identify special structures of multimedia documents along with characteristics of the available channels which affect the relative performance of the algorithms.     

基于数据概要描述的分布式数据流聚类模型与算法

数据流挖掘可有效解决大容量流式数据的知识发现问题,并已得到广泛研究.数据流的一个典型的例子是传感器采集的流式数据.然而,随着传感器网络的应用普及,这些流式数据在很多情况下是分布式采集和管理的,这就必然导致分布式地挖掘数据流的需求.分布式数据流挖掘的最大障碍是由分布式而导致的挖掘质量或者效率问题.为适应分布式数据流的聚类挖掘,探讨了分布式数据流的挖掘模型,并且基于该模型设计了对应的概要数据结构和关键的挖掘算法,给出了算法的理论评估或者实验验证.实验说明,提出的模型和算法可以有效地减少数据通信代价,并且能保证较高的全局模式的聚类质量.     

Distributed Streams Algorithms for Sliding Windows

Massive data sets often arise as physically distributed, parallel data streams, and it is important to estimate various aggregates and statistics on the union of these streams. This paper presents algorithms for estimating aggregate functions over a “sliding window” of the N most recent data items in one or more streams. Our results include: 1. For a single stream,we present the first ε-approximation scheme for the number of 1’s in a sliding window that is optimal in both worst case time and space. We also present the first ε-approximation scheme for the sum of integers in [0..R] in a sliding window that is optimal in both worst case time and space (assuming R is at most polynomial in N). Both algorithms are deterministic and use only logarithmic memory words. 2. In contrast, we show that any deterministic algorithm that estimates, to within a small constant relative error, the number of 1’s (or the sum of integers) in a sliding window on the union of distributed streams requires Ω(N) space. 3. We present the first (randomized) (ε, δ)-approximation scheme for the number of 1’s in a sliding window on the union of distributed streams that uses only logarithmic memory words. We also present the first (ε, δ)-approximation scheme for the number of distinct values in a sliding window on distributed streams that uses only logarithmic memory words. Our results are obtained using a novel family of synopsis data structures called waves.     

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

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

An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms

We perform an extensive experimental evaluation of very simple, distributed, randomized algorithms for (Δ + 1) and so-called Brooks–Vizing vertex colorings, i.e., colorings using considerably fewer than Δ colors (here Δ denotes the maximum degree of the graph). We consider variants of algorithms known from the literature, boosting them with a distributed independent set computation. Our study clearly determines the relative performance of the algorithms with respect to the number of communication rounds and the number of colors. The results are confirmed by all the experiments and instance families. The empirical evidence shows that some algorithms use very few rounds and are rather effective, thus being amenable to be used in practice.     

An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms

We perform an extensive experimental evaluation of very simple, distributed, randomized algorithms for ( + 1) and so-called Brooks–Vizing vertex colorings, i.e., colorings using considerably fewer than colors (here denotes the maximum degree of the graph). We consider variants of algorithms known from the literature, boosting them with a distributed independent set computation. Our study clearly determines the relative performance of the algorithms with respect to the number of communication rounds and the number of colors. The results are confirmed by all the experiments and instance families. The empirical evidence shows that some algorithms use very few rounds and are rather effective, thus being amenable to be used in practice.     

流媒体通信传输算法研究

流媒体技术应用越来越广泛,但数据传输中的延迟、抖动,影响了媒体流播放质量。如何提供保证性能的流媒体服务成为推广流媒体技术的关键。提出了最小延迟算法,可以提供高的信道利用率及高的目的端缓冲区数据吞吐量,提高媒体流播放质量。还提出了最小聚类延迟算法作为改进,进一步优化媒体流整体播放性能。上述两种算法在流媒体技术中有一定的应用推广价值。     

流媒体技术及其文件格式

为了全面、深刻地理解流媒体技术,以达到进一步提高流服务器工作效率的目的,该文就流媒体文件格式展开深入研究。在剖析常用流媒体系统和文件格式的基础上,笔者结合在研发新的流媒体系统过程中积累的经验,论证了流媒体文件格式在流媒体系统中占有重要地位,设计合理的文件格式是提高流媒体服务器工作效率最直接和最有效的办法。最后该文对已有流媒体文件格式对流服务器性能的影响进行了分析,提出了一种新的流媒体文件格式框架。实践表明,使用该文建议的流媒体文件格式可以大幅度提高流媒体服务器的工作效率。     

基于流媒体的虚拟地理环境研究

通过将流媒体技术和虚拟地理环境相结合,解决了协同角色不能真实可视化,交流信息延迟等问题。该文根据流媒体技术的原理,设计了基于流媒体的虚拟地理环境系统结构与功能模块,并以虚拟地理研讨室为例建立了原型试验系统,实现了视频音频的本地播放和网络传输功能。研究表明,将流媒体技术与虚拟地理环境相结合,可以有效地增强虚拟地理环境中协同工作者之间交流,提高地理认知能力。     

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

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

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

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

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

局域网流媒体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.     

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

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

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

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

Algorithms for validating E-tickets in mobile computing environment

E-tickets issued online can be used by different vendors to provide services such as discount coupons for E-shopping, or an entrance for a football game. One major issue associated with E-tickets is the problem of validation, which becomes more severe in a mobile environment due to mobility of a mobile host (MH) and frequent failure/disconnection of validation servers known as mobile support stations (MSSs). Some additional problems include the identification of duplicate submissions of an E-ticket by a MH. Thus, this paper proposes two protocols using the Flat and Hierarchical schemes for E-ticket processing and validation in a mobile environment that guarantee at least and at most once property (each E-ticket is validated at least and at most once). The protocols have been validated and compared through complexity analysis and experiments.     

流媒体代理缓存技术研究

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

多数据流上的连续分布式Top-k监测

近年来,分布式系统中的数据流监测是一个十分活跃的领域。研究了如何实现通用并且高效的分布式top-k监测,即在分布的多数据流中根据用户给定的排序函数连续监测最大的k个值。在实际应用中,用户给定的排序函数可能是任意的排序函数,然而,目前的分布式top-k监测技术只支持加法作为排序函数。提出了一种通用的支持任意的连续的严格单调的聚集函数的分布式top-k监测算法GMR。GMR的通讯代价和k无关。通过真实世界数据和模拟数据验证了GMR的效率。实验表明,GMR的网络通讯量比同类方法低一个数量级以上。