基于H.264 TM5码率控制算法的改进研究

针对H.264 TM5码率控制算法在保持图像序列平滑性和缓冲控制上的不足，同时考虑图像复杂度和缓冲状况，在H.264 TM5的基础上提出了一种改进的帧层码率控制算法。对于图像复杂度比较高的帧，采用较小的量化参数，对于图像复杂度较低的帧，采用较高的量化参数，从而达到稳定图像质量，得到平滑图像序列的目的。同时监视缓冲状况，及时调整量化参数防止缓冲溢出。仿真结果表明：改进后的算法既能获得更平滑的图像序列，也能更好地控制缓冲。     

基于ARC的闪存数据库缓冲区算法

闪存是一种纯电子设备,具备体积小、数据读取速度快、能耗低、抗震性强等优点,被用来部分替代机械硬盘从而提升存储系统的性能.但是,现有的缓冲区置换算法都是针对机械硬盘的物理特性进行设计和优化,因此有必要针对闪存的物理特性重新设计缓冲区置换算法.提出一种新的面向闪存数据库的缓冲区替换算法CF-ARC.算法设计了一种新的页替换机制,即在替换干净页或者脏页的时候考虑其访问频度的大小,优先将访问频度少的干净页替换出缓冲区,使得热页继续留在缓冲区提高命中率,从而获得更好的性能,通过对实验结果的对比分析发现CF-ARC在多数情况下具有比其它置换算法更高的性能.     

GEO通信系统LLC协议设计及性能分析

针对GEO链路延时大、误码率高的特点,提出基于位图的RBM-ARQ可靠传输算法。对GMPRS逻辑链路控制(LLC)层的可靠传输算法进行改进,采用保持更新终端状态的方法,以加强信道损伤的恢复能力。仿真实验结果表明,合理设置重传时间和重传计数可以提高LLC层的吞吐量、减少延迟,与传统的GMPRS LLC层可靠传输算法相比,RBM-ARQ算法能获得更好的传输性能。     

窗口限制系统中基于令牌的Fast-TCP的延时性能分析

给出了在高带宽时延乘积网络中无拥塞丢包的TCP缓冲区的占用量的微分方程,然后针对广域网中窗口大小小于网络带宽时延乘积和无线网络中,由于误码丢包而使窗口尺寸无法达到链路带宽时延乘积(如卫星网)的情况,分析了一种基于令牌的Fast-TCP机制,得出基于令牌的ACK延时机制,不仅能够大大减少缓冲区的占用量结论,而且可获得与TCP在无限缓冲区下的同样的吞吐量.还把这个结论推广到多连接的情况,在以前论文中没有涉及.     

An evaluation of buffer management strategies for relational database systems

In this paper we present a new algorithm, DBMIN, for managing the buffer pool of a relational database management system. DBMIN is based on a new model of relational query behavior, thequery locality set model (QLSM). Like the hot set model, the QLSM has an advantage over the stochastic models due to its ability to predict future reference behavior. However, the QLSM avoids the potential problems of the hot set model by separating the modeling of reference behavior from any particular buffer management algorithm. After introducing the QLSM and describing the DBMIN algorithm, we present a performance evaluation methodology for evaluating buffer management algorithms in a multiuser environment. This methodology employed a hybrid model that combines features of both trace-driven and distribution-driven simulation models. Using this model, the performance of the DBMIN algorithm in a multiuser environment is compared with that of the hot set algorithm and four more traditional buffer replacement algorithms.     

一种适用于DVB Over IP的传输流传送方法

对DVB Over IP应用来说，如何传送用可变比特率（VBR）压缩的MPEG-2传输流格式的视频是一个重要的问题。其中以传统的恒定速率（CBR）方式传送VBR视频时，接收端需要较大的缓存和开始延时时间；而另一种新的采用PCR协助的恒定速率（PCBR）传送方式，则是以较高的传输速率和以牺牲码率的稳定性来减少缓存需求。为了平衡传输速率和接收端缓存需求，在PCBR基础上，提出了一种称为IPCBR的改进的视频流传送方法。通过实验证明，该新方法与传统的CBR传送方式相比，不仅可降低缓存需求，而且与PCBR方式相比，又具有较高的稳定性和带宽利用率，并克服了PCBR丢包率较高的问题。同时由于该算法特别针对DVB Over IP，具有较强的实用性。且有利于Internet TV业务拓展。     

并行视频服务器调度算法研究

从服务器缓冲要求，客户端缓冲要求，系统响应时间三个方面着重分析比较了在服务器推动模型基础上建立的两种调度算法，并发推动调度算法和改进的并发推动调度算法，为我们进行相关的系统设计提供了理论依据．     

An evaluation of buffer management strategies for relational database systems

In this paper we present a new algorithm, DBMIN, for managing the buffer pool of a relational database management system. DBMIN is based on a new model of relational query behavior, thequery locality set model (QLSM). Like the hot set model, the QLSM has an advantage over the stochastic models due to its ability to predict future reference behavior. However, the QLSM avoids the potential problems of the hot set model by separating the modeling of reference behavior from any particular buffer management algorithm. After introducing the QLSM and describing the DBMIN algorithm, we present a performance evaluation methodology for evaluating buffer management algorithms in a multiuser environment. This methodology employed a hybrid model that combines features of both trace-driven and distribution-driven simulation models. Using this model, the performance of the DBMIN algorithm in a multiuser environment is compared with that of the hot set algorithm and four more traditional buffer replacement algorithms.This research was partially supported by the Department of Energy under Contract No. DE-AC02-81ER10920 and the National Science Foundation under grant MCS82-01870.     

P2P文件完整性校验延迟隐藏算法

P2P下载中文件完整性校验会影响下载性能,针对该问题,提出一种校验延迟的隐藏算法。利用文件完整性校验中使用的哈希算法的流式特性和TCP异步接收缓冲区的特点,将大文件块的哈希计算分成多次对较小的子数据块的计算,收到一个子数据块后,就开始计算哈希。由于计算每一个子数据块的哈希的时间开销很小,保证了计算延迟可以被TCP异步接收缓冲区所隐藏,使哈希计算与数据接收几乎可以并行进行,消除其对P2P文件下载性能的影响,提高了下载效率。     

Fast Shadowing Algorithm for Linear Light Sources

This paper presents a fast shadowing algorithm for linear light sources that uses a ray-oriented buffer. Space segmentation by the buffer guarantees that if a point is included in a subspace, all light rays toward the point are also contained in the subspace. Each cell of the buffer stores a list of objects that lie within or intersect the subspace allocated to the cell. Therefore, candidate objects, those that may cast shadows onto a point, are determined by referring to the cell where the point is mapped. In addition, whether each candidate object actually casts shadows or not is tested with the bounding-volume of the shadow space to reduce the number of objects subjected to expensive light clipping. The bounding-volumes are also stored in the buffer. For efficiently generating the ray-oriented buffer, we present the cylindrical scan-conversion algorithm. The algorithm preconverts objects' surfaces to trapezia to decrease the light clipping cost, then connects the trapezia to the buffer cells. Due to the above improvements, our algorithm achieves over 10 times faster shadow generation compared to the conventional methods. Experimental results confirm that our method can generate realistic images with soft shadows in a few minutes.     

基于逐段RED的组播拥塞控制机制研究

提出了一种基于逐段RED的网络层组播拥塞控制机制,并对其有效性进行了数学推证,证明了信息包在不同优先级的转发约束下,STSR拥塞控制模型的缓冲区共享策略发生拥塞的概率小于分用策略,且STSR具有更高的敏感度和更大的网络吞吐量。利用NS-2对STSR拥塞控制进行了模拟,证明了STSR能保证对TCP流的友好,并实现了较粗粒度下的分布式控制。这一结果的取得对于组播拥塞控制的相关研究具有很大的指导意义。     

Hop to Hop的组播拥塞控制

提出了一种基于逐段的网络层组播拥塞控制机制,对其有效性进行了数学推证,证明了信息包在不同优先级的转发约束下,STSR拥塞控制模型的缓冲区共享策略发生拥塞的概率小于分用策略,证明了在组播信息包的优先级高于非组播信息包的前提下,具有组播转发优先的STSR组播拥塞控制模型其缓冲区共享策略,更优于具有同等优先级的组播拥控模型的共享策略,这一结果的取得对于拥塞控制的相关研究具有很大的指导意义。     

Robust load-balanced backbone-based multicast routing in mobile opportunistic networks

Mobile opportunistic network (MON) is an efficient way of communication when there is no persistent connection between nodes. Multicast in MONs can be used to efficiently deliver messages to multiple destination nodes. However, because multiple destination nodes are involved, multicast routing is more complex than unicast and brings a higher communication cost. Backbone-based routing can effectively reduce the network overhead and the complexity of routing scheme. However, the load of backbone nodes is larger than that of regular nodes. If the backbone node’s buffer is exhausted, it will have a significant impact on the performance of the routing scheme. Load balancing can improve the ability of backbone to deal with the change of network load, and backbone maintenance algorithm can provide backbone robustness. In this paper, we propose a robust load-balanced backbone-based multicast routing scheme in MONs. In the backbone construction algorithm, we transform the problem of backbone construction into a multi-objective optimization problem, and propose a multi-objective evolutionary algorithm-based backbone construction algorithm, namely LBMBC-MOEA algorithm. In addition, in order to increase the robustness of the backbone-based routing scheme, we propose a localized multicast backbone maintenance algorithm (MBMA) to deal with the buffer exhaustion of backbone nodes. When a backbone node’s residual buffer is insufficient, MBMA algorithm selects other nodes to replace the backbone node. The results on extensive simulations show that when considering the node buffer size constraints, compared with previous backbone-based multicast routing schemes, our proposed algorithm has better performance, and when the node’s residual buffer is insufficient, MBMA algorithm can significantly improve the performance of the backbone-based multicast routing scheme.     

基于模糊逻辑和路由器辅助的MCC算法

针对端到端组播拥塞控制的局限性,提出一种基于模糊逻辑和路由器辅助的组播拥塞控制算法FLRA-MCC。在FLRA-MCC中,主动路由器实时监测网络状态,利用模糊逻辑计算缓冲区调节因子a,从而自动调节缓冲区大小以缓解拥塞,并且只在发生较重拥塞时,才向源端反馈拥塞信息以通知源端减小发送速率。仿真结果表明,该算法能够保证网络吞吐量的稳定性,较好地吸收突发流,同时以更小的丢包率传输数据。     

Buffer allocation optimization in ATM switching networks using ALOPEX algorithm

We describe the use of a stochastic algorithm, called ALOPEX, which could be implemented in VLSI for optimizing the buffer allocation process in ATM switching networks. We present the results of computer simulations for buffer allocation in ATM switching networks using the ALOPEX algorithm. The algorithm uses a scalar cost function which is a measure of global performance. The ALOPEX works by broadcasting the global cost function to all neural processors in the neural network. Since each neural processor solely depends on the global cost function no interaction is needed between the neural processors and the algorithm is more amenable to massively parallel implementation. The application of the ALOPEX algorithm for the buffer allocation optimization in ATM networks assumes limited buffer capacity. The proposed ALOPEX-based approach takes advantage of the favorable control characteristics of the algorithm such as high adaptability and high speed collective computing power for effective buffer utilization. The proposed model uses complete sharing buffer allocation strategy and enhances its performance for high traffic loads by regulating the buffer allocation process dynamically.     

基于写数据页聚簇的固态硬盘缓冲算法

针对Flash写前需擦除,读写I／O开销不均衡等固有缺陷,研究面向闪存缓冲区管理,对提高基于Flash的固态硬盘（SolidState Disk,SSD）访问性能具有重要理论意义和应用价值．通过分析SSD关键技术及现有缓冲区管理算法,实现了一种适用于SSD的基于写数据页聚簇缓冲算法．文章中详细介绍了该算法关键技术及原理,并通过FlashSim仿真平台实现SSD写缓冲．基于仿真结果与传统缓冲算法性能比对,分析得出该缓冲算法可降低SSD随机写次数和SSD数据存储分散性,并提升SSD响应速度．     

线目标缓冲区生成的矢栅混合算法研究

线目标的缓冲区生成是缓冲区分析的基础和关键。结合栅格算法与矢量算法的优势,提出矢栅混合算法解决线目标的缓冲区生成问题。采用Douglas-Peuker方法对线目标进行重采样以加快缓冲区建立速度,用扫描线方法将线目标矢量数据转化为栅格形式,再采用膨胀原理生成缓冲区,通过扫描缓冲区栅格边界,提取有效矢量数据,进行求交运算,对缓冲区生成中的自相交多边形进行处理。     

非均匀业务流下的片上网络缓冲区分配算法*

针对片上网络的非均匀业务流,提出一种基于模拟退火遗传算法的缓冲区资源分配算法,对系统的有限缓冲区资源的分配问题进行了研究。该算法建立在二维Mesh结构的片上网络通信模型基础上,根据各节点间的业务流特征,估计出节点中各输入通道的负载大小,再根据其负载情况采用模拟退火遗传算法进行缓冲区资源的分配,从而使整个网络的平均延时性能最优。实验中设置了不同的热点位置和热度,结果表明,该算法可以更合理地分配缓冲区资源,有效降低数据包的传输延时。在单热点通信流量下,热度为100%和300%时,可分别降低传输延时32.58% ~ 65.29%和35.54% ~ 70.38%;在双热点通信流量下,可降低传输延时52.02% ~ 70.43%。同时,该算法具有良好的收敛性。     

视频编码中考虑模式选择的位率优化控制

本文在传统位率控制方法的基础上提出一种新算法,即基于宏块的最佳位率控制算法．主要思想是在考虑还宽,比特率和缓冲区大小的同时,考虑不同宏块模式的选择对位率的影响,文中给出了一些相关结果并将其与传统方法所得数据相比较,结果表明在多数位率条件下用本算法得到的ＰＳＮＲ比传统方法要好．     

CSFQ算法分析与改进

核心无状态公平队列调度（CSVQ）算法提供了如同有状态网那样好的公平带宽分配,但它的丢包算法不适用于TCP流。针对TCP流的特点,对CSFQ算法进行如下改进：将缓存队列长度与丢包概率关联起来,用一种类似于RED（random early drop）缓存管理方法解决了缓存频繁溢出导致的一些问题;对TCP流的丢包率进行修正,使用多余带宽来转发TCP包,解决TCP流与UDP流的带宽分配公平性。仿真试验表明,新算法NEW-CSFQ更好地提供数据流公平的频宽共享,对突发流响应较原算法有所提高,且算法复杂度简单,容易在高速核心路由器上实现。