分布式视频点播系统的接入控制研究

Video on Demand(VoD)systems are considered as one of the most valuable services for the next generation broad-bandwidth Internet. To provide high-quality service, the VoD system must employ an admission control module to guarantee QoS, but there are still less research works having been made in this field, especially for distributed VoD systems. In this paper, we mainly focus on distributed admission control for VBR video streams in distributed VoD systems. We firstly discuss different approaches and then two admission control strategies are proposed with experimental comparisons. Our research is also further extended to resource assignment in distributed VoD systems. At the end of this article, we address issues in implementing distributed admission control.     

一种分布式并行服务器模型的性能分析与改进

设计一个分布式并行服务器,必需全面考虑网络层和应用层流量以及响应特性对性能的影响。分布式并行服务器模型（DPS）具有良好的响应特性和较强的服务能力,对它进行了全面的分析,重点研究了网络层流量对模型性能的影响,并且在理论分析和实验测试的基础上,将网络层流量和应用层流量按协议栈分布式处理,提出了改进的DPS模型。改进的DPS模型能够更好的处理网络层流量,有效地改善模型的性能。     

下一代WEB访问模型

本文尝试性地从代数结构的角度观察在新技术广泛应用的条件下Web访问模式的演变,详细探诗了第一代Web的访问模型及其优缺点,并在一定合理假设的前提下提出了第二代Web的访问模型,同时讨论模型的一些有趣性质,为研究IT产业链提供依据,为网络访问模式的深入研究奠定基础。     

分布式多媒体系统中对象表示模型及变换方法研究

在设计一个分布式多媒体系统时，具有挑战性的问题之一是如何在系统的不同层次为各模式设计合适的规格描述模型，并提供不同模型的变换方法的集成与同步策略，在本文中，我们给出了几种多媒体对象的表示模型和变换算法，它们把高层的多媒体对象变换成可以用来支持多媒体对象展示和通信的实用模式，在该模式中能较好地保持多媒体对象的集成与同步特性。     

分布式系统中的名字服务机制

本文介绍公共对象服务规范ＣＯＳＳ中的名字服务机制,并提供一种简单而实用的方法,使得在现有的ＣＯＲＢＡ产品上能够实现基于层次结构的多名字服务器机制。     

几个常见分布式文件系统特征分析和性能对比

近年来随着云计算市场规模不断增长,作为云计算平台基础设施的云存储系统也随之显得越来越重要。数以万计的互联网应用已经运行于云计算环境,同时大量不同的应用也即将从传统运行环境转移到云计算平台。不同的互联网应用的存储需求可能不一样。例如:应用中涉及的单个文件大小,文件数量,IO访问模式,读写比率等,都对底层存储系统提出了不同的要求。这说明在云计算环境中,单个文件系统可能无法满足全部应用的存储需求,本文尝试通过在单一云计算平台中部署多个不同分布式文件系统来优化存储系统的总体性能。为了优化混合式文件系统的性能,首先需要分析不同文件系统的性能特征。本文通过量化方法分析了云计算环境下几个常用的分布式文件系统,这些文件系统分别是ceph,moosefs,glusterfs和hdfs。实验结果显示:即使针对同一文件的相同读写操作,不同分布式文件系统之间的性能也差异显著,当单个文件的大小小于256MB时,moosefs的平均写性能比其它几个文件系统高22.3%;当单个文件大小大于256KB时,glusterfs的平均读性能比其它几个文件系统高21.0%。这些结果为设计和实现一个基于以上几个分布式文件系统的混合式文件系统提供了基础。     

一种P2P环境下的VoD流媒体服务体系

在Internet上提供大规模的VoD服务是一项具有挑战性的工作.提出了一种基于P2P(peer to peer)方法的VoD服务体系PeerVoD,它能够以较小的服务器代价实现大规模的VoD应用.PeerVoD中的每个节点均使用定长的FIFO缓存队列来保存其最近所接收到的数据,以便为后续到达的节点提供服务.它具有如下特点:1) 采用分布式控制协议以支持节点的加入和离开,系统具有良好的可扩展性;2) 服务被中断的节点在进行中断恢复时,考虑了节点对目标节目接收的完整性.仿真实验表明:同等条件下,PeerVoD体系在服务器负载、节点加入时被拒绝的概率、网络资源利用率以及节目完整性等性能指标上,均优于同类体系P2VoD.     

分布式多媒体系统服务质量管理机制的研究*

分布式多媒体系统的发展向服务质量QoS(quality of service)管理机制提出了新的挑战.本文从分析现有网络系统在QoS管理方面的不足出发,引出分布式多媒体系统中有关QoS管理的基本观点,讨论各层QoS参数和QoS管理机制的功能组成,并且给出一个实例,最后得出结论.     

Tree Rerooting in Distributed Garbage Collection: Implementation and Performance Evaluation

We have recently defined a new algorithm for distributed garbage collection based on reference-counting (Luc Moreau, in Proceedings of the Third International Conference of Functional Programming (ICFP'98), Sept. 1998, pp. 204–215; Luc Moreau and J. Duprat, Technical Report RR1999-18, Ecole Normale Supérieure, Lyon, March 1999). At the heart of the algorithm, we find tree rerooting, a mechanism able to reduce third-party dependencies by reorganising diffusion trees. In reality, the algorithm describes a spectrum of algorithms according to the policy used to manage messages. In this paper, we present the implementation of the algorithm and evaluate its performance. We have implemented two policies, which are extremes of the spectrum, respectively using and not using tree rerooting. In addition, two different strategies for managing action queues have been implemented. The conclusions of our experimentations are the following. Tree rerooting offers more parallelism during distributed GC activity; we explain this phenomenon by the length reduction of causality chains in the distributed GC. Grouping messages per destination dramatically reduces the number of messages, but requires a more complex implementation as messages have to be sorted per destination. Speed up of 100% has been observed on some benchmarks.     

Experimental Analysis of Timing Validation Methods for Distributed Real-Time Systems

Scheduling jobs dynamically on processors is likely to achieve better performance in multiprocessor and distributed real-time systems. Exhaustive methods for determining whether all jobs complete by their deadlines, in systems that use modern priority-driven scheduling strategies, are often infeasible or unreliable since the execution time of each job may vary. We previously published research results on finding worst-case bounds and efficient algorithms for validating systems in which independent jobs have arbitrary release times and deadlines, and are scheduled on processors dynamically in a priority-driven manner. An efficient method has been proposed to determine how late the completion times of jobs can be in dynamic systems where the jobs are preemptable and nonmigratable. This paper further presents the performance characteristics of the proposed methods, and shows its soundness by providing extensive simulation results. The worst-case completion times of jobs obtained with the proposed methods are compared with the values by simulations under different workload characteristics. The simulation results show that the proposed algorithm performs considerably well for diverse workloads. Considering the previous work showed the unlikelihood of finding tighter bounds than the one given in the paper, the simulation results indicate that the proposed methods effectively constitute a theoretical basis needed for a comprehensive validation strategy that is capable of dealing with dynamic distributed real-time systems.     

一种分布式视频点播系统模型

视频点播（Video-on-Demand）是现代网络上的一个重要多媒体应用，在传统的集中式视频点播系统中，如何用户数目过多，并可能出现服务器I／O及网络带宽的瓶颈，而采用发布式体系结构的VOD系统可以将负载分布到放置在网络不同位置的各个服务器上，能很好地解决系统瓶问题，本文提出了一种分布式视频点播系统模型，包括系统结构、软件结构、功能定义及实现上的考虑。     

分布式多媒体系统服务质量管理实现支持机制

近年来，分布式多媒体系统中的服务质量QoS(quality of service)管理及其实现支持机制取得了很大进展.本文从接纳控制与资源预约、基于速率的流控、差错控制、调度与同步几个方面出发，讨论QoS管理实现支持机制，并展望今后的研究工作.     

The Double Edge Sword Based Distributed Executor Service

Scalability is one of the most important quality attribute of software-intensive systems, because it maintains an effective performance parallel to the large fluctuating and sometimes unpredictable workload. In order to achieve scalability, thread pool system (TPS) (which is also known as executor service) has been used extensively as a middleware service in software-intensive systems. TPS optimization is a challenging problem that determines the optimal size of thread pool dynamically on runtime. In case of distributed-TPS (DTPS), another issue is the load balancing b/w available set of TPSs running at backend servers. Existing DTPSs are overloaded either due to an inappropriate TPS optimization strategy at backend servers or improper load balancing scheme that cannot quickly recover an overload. Consequently, the performance of software-intensive system is suffered. Thus, in this paper, we propose a new DTPS that follows the collaborative round robin load balancing that has the effect of a double-edge sword. On the one hand, it effectively performs the load balancing (in case of overload situation) among available TPSs by a fast overload recovery procedure that decelerates the load on the overloaded TPSs up to their capacities and shifts the remaining load towards other gracefully running TPSs. And on the other hand, its robust load deceleration technique which is applied to an overloaded TPS sets an appropriate upper bound of thread pool size, because the pool size in each TPS is kept equal to the request rate on it, hence dynamically optimizes TPS. We evaluated the results of the proposed system against state of the art DTPSs by a client-server based simulator and found that our system outperformed by sustaining smaller response times.     

基于时间序列分析的分布式拒绝服务攻击检测

该文分析了分布式拒绝服务(DDoS)攻击的特点,提出了一种基于流连接密度(FCD)时间序列分析的DDoS攻击检测方法,该方法通过拟合FCD时间序列的自适应自回归模型,获得能够在多维空间描述当前流量状态的AAR模型参数向量序列,然后使用经过样本训练的支持向量机(SVM)分类器进行攻击识别;充分考虑了报警的时间间隔及分布情况,提出一种报警可信度评估算法对SVM分类结果进行二次处理,以消除网络流量噪声及分类错误所带来的影响．实验结果显示,该检测方法能够有效检测DDoS攻击,可信度评估算法能够明显减少误报,降低误报率,显著提高检测质量．     

面向方面的分布式实时软件性能分析

性能是横切分布式实时系统的关注点,面向方面技术可以将性能关注点模块化,为性能分析提供了优越的实现条件。该文提出一个面向方面的性能工程框架,利用面向方面扩展的多种视图并结合规格化的参数描述,针对面向方面软件进行性能建模与测量。分析了一个分布式Web应用的例子及其性能瓶颈所在,结果表明该框架是可行有效的。     

A Real-Time Performance Evaluation Model for Distributed Software with Reliability Constrains

In this paper, we propose an approach for the real-time performance analysis of distributed software with reliability constraints, called Athena. The approach is based on the real-time and reliability performance analysis of distributed program. In Athena, two important factors, imperfect nodes and the links reliability, are introduced. The algorithms proposed in Athena generates sub-graphs, counts the reliability of each sub-graph, calculates the transmission time for all the transmission paths of each data file, and computes response time of each data file with reliability constraint. In this way, the real-time performance of distributed software with reliability constrains can be evaluated.This paper is supported by National Science Foundation of China under grant 60273076.     

基于异构分布式系统的实时容错调度算法

目前文献中研究的实时容错调度算法都是基于同构分布式系统，系统中的所有处理机完全相同。该文首先建立了一个基于异构分布式系统实时容错调度模型，异构分布式系统中的各个处理机均不相同。基于该异构分布式系统模型，该文引入了可靠性代价（reliability cost）概念，并提出两种静态实时容错调度算法（RTFTNO和RTFTRC）用于调度周期性实时容错任务。算法RTFTRC在调度任务时，尽量使系统的可靠性代价最小；而算法RTFTNO在调度实时任务时，没有考虑系统的可靠性代价。该文详细讨论了两种调度算法的性能。性能模拟实验分别比较了两个算法的可靠性代价，超时比率和可调度性；并研究了任务的计算时间与可靠性代价的关系以及调度长度阈值与最小处理机个数的关系。实验结果表明，算法RTFTRC的性能优于算法RTFTNO。     

基于GSPN的Web服务组合与性能分析

针对Web服务组合过程缺乏有效的性能评价方法的问题,提出一种利用广义随机Petri网（GSPN）进行组合过程建模的方法,该方法能够表达组合过程,并对组合过程所含的增值业务系统进行多方面的系统性能评价,可实现的评价指标包括系统平均响应时间、单一组件服务的利用率、系统的吞吐率等,将其应用于一个典型的旅行计划场景建模中。仿真实验结果表明,建模后的系统能进行多种性能评价。     

防御分布式拒绝服务攻击的入侵检测模型

本文通过对典型分布式扫描服务（DDoS)攻击的工具Trinoo的攻击特性分析，提出了三层检测DDoS的模型。该模型利用了IP和端口陷阱，特征字符串匹配和流量分析等有效的检测手段，通过三层检测，逐级跟踪，综合分析，从而比较准确地判断Trinoo的入侵，它改进了Snort检测中仅靠特征字符匹配进行判断的方法，从而降低了误报警率，同时该模型中分析和解决问题的思路对于防御其它攻击有着很重要的参考价值。