ATM网络中漏桶流量控制特性的研究

本文对ＡＴＭ（异步转移模式）网络中话音、数据和图像业务的漏桶流量控制特性进行了研究。计算机模拟结果表明，由于各种业务内在的相关性不同，相应的漏桶流量控制特性有较大的差异。漏桶参数的选择对于各种业务具有不同的公平性，因而应根据业务的特性来设计漏桶参数。     

Efficient Transmission of MPEG-2 Coded Video Traffic over ATM Networks

Video traffic is expected to account for a significant share of the traffic volume in the future asynchronous transfer mode (ATM) networks. MPEG-2 proposed by Moving Picture Expert Group is one of the most promising compression techniques for such applications. One of the critical issues in MPEG-2 is to realize effective variable bit rate (VBR) video transfer thorough ATM networks. The Leaky Bucket (LB) scheme has been widely accepted as the usage parameter control (UPC) mechanism to police the VBR sources. We proposed a new Adaptive Dynamic Leaky Bucket (ADLB) congestion control mechanism, which is based on the LB scheme. Unlike the conventional LB, the leak rate of the ADLB is controlled using delayed feedback information of available bandwidth sent by the network. This scheme allows sources to get varying amounts of bandwidth over time, while reserving a minimum guaranteed bandwidth (MCR) for the entire duration of the connection. At the time of congestion, the leak rate of the ADLB is adjusted according to the feedback indicating the currently available bandwidth to the connection. The simulation results show that the end-to-end cell transfer delay and cell loss of each source has been improved significantly.     

On the capability of the policing function to release an ATM connection

The capability of releasing a connection has been recognized within standardization bodies as a desirable feature for the policing function in ATM networks. In this paper, we investigate how to implement this new scheme. For this purpose, we introduce a simple modification to some well known policing mechanisms, namely the Leaky Bucket, the EWMA, the Jumping and Moving Window. We first draw attention to the fact that all of them suffer from the drawback that they discard useful information which could be used to enforce tighter policing and to shut a connection off when too much excess traffic is submitted to the connection. We then propose a modification to the above mentioned schemes in which the discarded cell information is used, with almost no overhead compared to the usual ones. In the context of the Leaky Bucket, analysis using Bernoulli and On/Off MMBP input processes shows that the modified version has a behavior which differs significantly from its original counterpart. A major difference is that the new mechanism stops serving sources requiring much more resources than negotiated. It also reacts more severely to abuses of smaller magnitude and polices the sources closer to their declared resource utilization. A method is then presented to select the appropriate parameters of the modified Leaky Bucket in order to achieve a faster response time.     

帧中继网络的一种拥塞控制机制

本文介绍一帧中继网络的拥塞控制机制－输入速率控制机制。它采用漏桶算法调节从源节点到网络节点的数据流量。本文着重介绍了该输入速度控制机制的实现并作了性能分析。依据帧中继子网的拓扩结构，进行理论分析和计算机模拟，给出了不同参数下的各项性能曲线。     

一种智能监管方法性能的研究

本文提出了改进的模糊漏桶,用于对ＡＴＭ网络业务进行监管,对ＯＮ／ＯＦＦ业务及ＶＢＲ（ＶａｒａｂｌｅＢｉｔＲａｔｅ）视频ＡＲ（一阶ＡｕｔｏＲｅｇｒｅｓｓｉｖｅ模型）业务的仿真结果表明改进模糊漏桶对业务的监管能力要好于漏桶,即监管违约业务响应快,幅度大,并且合法业务对改进模糊漏桶的计资源要求少。     

基于ON/OFF信源模型的信元丢失分析

ＯＮ／ＯＦＦ信源模型体出在漏桶速率控制策略控制下信源的信元生成特性,通过对单一业务源的信元生成特性演是出了多业务源的信元生成特性模型;以信元丢失为主要研究对象,通过对多业务源复用器排队系统的信元丢失进行了深入的研究得出了一些新的定量结论,这些结论也可用一献计献策中存在存储器溢出概率。     

基于DD-LLMS算法的盲自适应判决反馈均衡器

本文把用于自适应线性滤波器的LLMS算法推广到盲判决反馈均衡器,并应用于短波信道的盲均衡。仿真结果表明这种DD—LLMS盲判决反馈均衡算法具有很好的稳定性、较快的收敛速度和较好的跟踪性能。     

基于改进深度卷积神经网络的纸币识别研究

针对如何提高纸币识别率的问题,该文提出一种改进深度卷积神经网络(DCNN)的纸币识别算法。该算法首先通过融合迁移学习、带泄露整流(Leaky ReLU)函数、批量归一化(BN)和多层次残差单元构造深度卷积层,对输入的不同尺寸纸币进行稳定而快速的特征提取与学习;然后采用改进的多层次空间金字塔池化算法对提取的纸币特征实现固定大小的输出表示;最后通过网络全连接层和softmax层实现纸币图像分类。实验结果表明,该算法在分类性能、泛化能力与稳定性上明显优于常用的纸币分类算法;同时该算法也能够满足纸币清分系统的实时性要求。     

On overload control of parlay application server in next generation network

After analyzing the features of the Parlay application server（AS）, which provides many services with different time constraints in the next generation network（NGN）, a selfadapted overload control algorithm implemented in Parlay AS is proposed. In this algorithm, the service process module in parlay AS uses the earliest deadline first （EDF） serving rule to serve messages, and the overload control mechanism, using the Leaky Bucket algorithm to control message flows, is triggered by estimating the queue waiting time of a newly arriving message. By simulation it shows that this algorithm is a simple, easy-to-use, and available algorithm.     

Evaluating scheduling in integrated‐services networks using a semi‐fluid‐flow model

An integratedservices network carries diverse traffic, which leads to diverse performance objectives. For example, voice and video packets typically have performance objectives based on the fraction of packets that will be delivered within a given delay bound, while data packets often have objectives based on mean delay. Greater loads can be supported in networks in which a voice or video packet is given priority over data packets if and only if the former is in danger of missing its deadline. Algorithms that allow this include CostBased Scheduling, occupancybased algorithms, the Priority Token Bank, and to a lesser extent, the Leaky Bucket. This paper presents an approach to evaluating performance with these algorithms in the realistic case where data arrivals are highly bursty, but voice and video packets are not. Mean queueing delay for data bursts is determined analytically in some important scenarios, and an efficient simulation approach based on the same model is described for cases where analysis is not currently possible. The model is a semifluidflow model in which voice or video packets are assumed to arrive as a continuous fluid flow, whereas data packets arrive in large bursts at discrete instants in time.     

The Multi-level Recovery of Main-memory Real-time Database Systems with ECBH

1　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎｒｅｃｅｎｔ ｙｅａｒｓｒｅａｌ ｔｉｍｅｄａｔａｂａｓｅｓｈａｖｅｏｃｃｕｒｒｅｄｉｎｍａｎｙｉｍｐｏｒｔａｎｔａｐｐｌｉｃａｔｉｏｎｓｉｎｃｌｕｄｉｎｇａｉｒｌｉｎｅｒｅｓｅｒｖａｔｉｏｎ ,ｂａｎｋｉｎｇ ,ａｎｄｓｔｏｃｋｍａｒｋｅｔｓｙｓ ｔｅｍｓ .Ｒｅａｌ ｔｉｍｅｄａｔａｂａｓｅｓｈａｖｅｔｏｄｅａｌｗｉｔｈｍａｎｙｏｆｔｈｅｓａｍｅｉｓｓｕｅｓａｓｇｅｎｅｒａｌ ｐｕｒｐｏｓｅｄａｔａｂａｓｅｓ.Ｆｕｒ ｔｈｅｒｍｏｒｅ,ｑｕｅｒｉｅｓｔｏｔｈｅｄａｔａｂａｓ…     

基于模拟移位寄存器的递归滤波器设计

BBD器件是一种MOS结构的电荷模拟移位寄存器，它可以完成对模拟信号的精确延迟。文章以BBD器件为基础，设计出了基于BBD的递归滤波器电路，并分析了原理和性能特点。     

智能网中的SCP过载控制研究

本文首先对Ｃａｌｌａｇｐ、Ｐｅｒｃｅｎｔ和漏梭算法进行了比较,得出了漏桶算法健壮性强适用于ＳＳＰ限制呼叫的结论。通过对过载控制框架的描述,提出了一种基于动态调整的控制算法用于ＳＣＰ过载控制。最后将算法进行扩展,使其满足不同的公平性条件,并适合在多业务环境各执行。模拟结果表明此算法具有较好的有效好性和公平性。     

漏泄通信系统在地铁中的应用

地铁内信号的覆盖问题始终困扰运营商,目前行之有效的方法是搭建一套漏泄通信系统.此系统首先应用合路平台设备(POI)技术;其次采用漏缆传输方式对地下空间进行信号覆盖;再次通过有线方式将各运营商的信号传送到地铁站内的各自基站,系统信号经POI合路后通过地铁内的漏缆把信号发送出去,从而实现地铁内信号的覆盖.最后将研究成果应用到某运营商地铁线路的网络建设中,为后期地铁无线网络设计提供了思路.     

多运营商高铁隧道移动网络覆盖方案

高铁移动网络覆盖是国内三大通信运营商的一个重点,而高铁隧道内移动网络覆盖更是运营商的一大难点痛点。文章根据我国中部省份某高铁线路覆盖规划实例,采用“设备+POI+泄漏电缆”模式,即三家运营商信号源设备通过同一POI(point of interface,多系统接入平台)接入,信号输出到泄漏电缆进行隧道覆盖,隧道口场坪站安装宽频切换天线对隧道外进行延伸覆盖,通过链路预算合理布置各运营商主设备信号源,从而实现隧道到室外的无缝覆盖。最后,根据已有成熟网络覆盖解决方案,对未来5G高铁隧道移动网络覆盖方案进行了探讨。     

ATM网络双速漏桶监管算法

本文提出一种ＡＴＭ网络监管新算法———双速漏桶算法。对它的性能进行理论分析和计算机模拟，并探讨其硬件实现的可能性和复杂性。结果表明：在硬件复杂性基本不增加情况下，双速漏桶监管法比单速漏桶算法在监管选择性、信元丢失率及信元等待时间等性能方面有较大改善。     

三轴离子束抛光系统驻留时间算法

在光学离子束抛光工艺中,驻留时间求解是一个关键问题。多数驻留时间求解算法要求离子束在工件表面的材料去除速率在加工过程中保持不变。然而,离子束在工件表面的材料去除速率与离子束入射角度有关。为此,在加工曲面工件时,通常采用精密五轴联动运动平台对离子源的运动及姿态进行实时控制,使得在加工曲面工件时离子束相对工件表面的入射角度始终保持不变,从而保证去除函数在整个离子束抛光过程中保持不变。提出了一种基于仿真加工的迭代驻留时间求解算法,在求解驻留时间的过程中考虑到入射角度带来的去除速率变化,从而使得在离子束抛光系统中只需采用三轴运动控制平台对离子源的运动进行控制,而不再需要对离子源的姿态进行实时控制。入射角度与去除速率曲线可以事先通过实验测得。与五轴运动平台相比,三轴平台更稳定、经济且易于控制。仿真结果表明,算法在三轴离子束抛光系统中具有较好的适用性。     

Rayleigh wave suppression in reflection acoustic microscopy

Leaky Rayleigh waves, generated by an acoustic lens, may give rise to image artifacts in the reflection acoustic microscope. A new acoustic lens:transducer to suppress the Rayleigh wave excitation is proposed and demonstrated in experiments at 4 MHz.