点到多点ABR业务的拥塞控制机制

在异步传递模式（ＡＴＭ）网络中，可用比特速率（ＡＢＲ）业务类型主要面向数据通信服务，ＡＢＲ采用基于速率的拥塞控制机制．在点到多点的通信环境下，ＡＢＲ拥塞控制要解决的一个关键问题是如何将信元接收端的反馈信息进行合并，使得信元发送端以所有叶节点能够支持的速率发送信元．讨论了点到多点环境下ＡＢＲ拥塞控制所面临的主要问题，提出了对合并算法的性能评价准则．分析了现有的几个算法的优缺点，并在此基础上提出了一个改进的算法，从实现的复杂性、响应速度、可扩展性及噪音问题等几方面对这些算法进行了比较．     

Bottlenecked ABR信源对ABR速率算法的影响(英文)

比较研究了一种特殊信源,Ｂｏｔｔｌｅｎｅｃｋｅｄ ＡＢＲ信源在ＡＴＭ 网络中对ＡＢＲ拥塞控制算法性能的影响．Ｂｏｔｔｌｅｎｅｃｋｅｄ ＡＢＲ信源由于某些原因无法做到根据交换网络提供的信息相应改变信元发送速率．由于网络交换节点对此不了解,必然导致对Ｂｏｔｔｌｅｎｅｃｋｅｄ 信源分配的速率过大而浪费网络资源．当Ｂｏｔｔｌｅｎｅｃｋｅｄ 信源不再发生信源拥塞情况时,网络又会因为瞬间增加的速率而发生拥塞．本文对不同的ＡＢＲ拥塞控制算法进行了仿真,并对结果进行了分析     

ATM网络中基于速率的负反馈拥塞控制算法

讨论了异步传输模式（ＡＴＭ）网络中适用于可用比特速率（ＡＢＲ）业务的基于速率的流量控制机制,提出了计算及优化拥塞控制参数的数值计算方法,目的是用最小的缓存达到最大的链路利用率．     

ATM网中固定速率业务的信元时延偏差研究

信元时延偏差（ＣＤＶ）是ＡＴＭ网内引起信元丢失的主要原因之一。文中系统地分析了固定速率业务（ＣＢＲ）的ＣＤＶ的相关特性，包括信元时延特性、复用后信元流的分布特性及ＣＤＶ的影响与监控。采用固定速率业务与独立同分布的背景业务相叠加的ＦＩＦＯ离散排队系统，求出了稳态时ＣＢＲ信元时延、复用后信元流分布的母函数和信元流分布的极限情况，然后以求得的信元流分布为输入，求出了有ＣＤＶ的ＣＢＲ信元流通过漏桶监控机制时的违例信元概率，并以随机业务的泊松分布为例给出了数值计算结果。     

简单计算ABR业务平均ACR的反馈流量控制算法

为了提高异步传输网络中可用比特率 (ABR)业务的二进制反馈流量控制算法的综合性能 ,通过使用计算方法对现有流量控制算法的研究 ,提出了一种新的二进制反馈算法 -简单计算平均信元速率的比例速率控制算法 (SM-PRCA)。在该算法中 ,网络交换节点通过处理后向资源管理(RM)信元 ,向 ABR业务源传输最新的网络拥塞状况指示。当网络发生拥塞后 ,通过考察具体的物理链路拥塞程度和当前虚链路 (VC)的实际发送速率 ,有选择性地设置后向 RM信元中的拥塞指示 (CI)和不允许增加 (NI)字域。该算法通过仿真显示出了明显优于显式前向拥塞指示 (EFCI) ,以及在某些方面优于显式速率的增强比例速率控制算法(EPRCA)算法的性能。     

流量自相似特性对ATM交换机缓存性能的影响

基于在广域网（ＷＡＮ）、局域网（ＬＡＮ）及综合业务为数字网（ＩＳＤＮ）中传输的可变速率业务（ＶＢＲ）等多种通信业务中普遍存在着自相似特性（长相关）,分析了在自相似流量下异步传输模式（ＡＴＭ）交换机的缓存溢出概率的上下界。结果表明,流量的自相似特性对缓存溢出概率有着非常的显著的影响。与利用传统流量模型得到的结果相比,基于相似模型得到的缓存缢出概率随缓存增加下降的速度要缓慢得多。     

一种ABR业务数据流量反馈控制方法

提出了一种新的建立ＡＢＲ业务数据流量反馈控制的方法．如能确定随机变化的可用带宽在两个调节周期间可能的最大变化，利用该算法，可保证ＡＢＲ业务的信元不被丢失，可用带宽也能得到充分利用．     

ATM网络中恒定比特率和可变比特率语音通信

分析了ＡＴＭ（异步转移模式）网络中恒定比特率（ＣＢＲ）和可变比特率（ＶＢＲ）语音通信方式，讨论了ＩＴＵＴ１９９７年新颁布的ＡＴＭ可变比特率业务适配标准ＡＡＬ２，给出了信元装配实例。针对ＶＢＲ业务相对ＣＢＲ业务有较大不同的网络传输时延特性，着重分析了语音信号作为ＶＢＲ业务采用ＡＡＬ２适配标准时，通过ＡＴＭ网络传输时的装配时延问题。     

ATM网络中基于门限的漏桶令牌产生算法

提出了一种离散时间情况下基于门限的ＡＴＭ漏桶算法．令牌产生池中令牌的产生速率随缓存中信元的数量而变化，信元的到达过程符合ＭＭＢＰ分布．数值分析的结果表明，影响信元丢失率的关键因素是信元缓存的体积，使用本文提出的算法，以较小的缓冲区及令牌产生池便能满足服务质量的要求     

基于动态部分缓存共享机制的改进RED算法

为了解决Internet中网络业务流量不断增长而引发的网络拥塞问题,采用部分缓存共享机制对随机早期检测算法进行改进。根据网络节点缓存资源实时使用情况模糊动态调整丢弃阈值,结合采用比例调度算法,提高了网络共享资源的使用效率,保证了不同网络业务的服务质量。仿真试验结果表明,改进RED算法可以提高网络节点的成功转发率,改善关键业务的延迟指标,具有更好的拥塞控制性能。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.     

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS (Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location,because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.