检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国科学院计算技术研究所-首都师范大学计算机科学联合研究院,北京100081
出 处:《计算机工程》2005年第10期13-15,21,共4页Computer Engineering
摘 要:近年来的许多研究表明,随着网络带宽的增大,业务量不断增多,网络中的数据流呈现出自相似性,具有很强的长相关特点,这就使得传统的基于短相关的Markov流量分析方法不再适用,该文对渐进自相似流进行了分析,在分析了系统输入固定数量叠加的ON-OFF重尾间隔流排队模型基础之上,提出了随机接入重尾数据流的准入控制算法,并进行了仿真分析。In recent years, lots of research have shown that flows in the network are the characteristic of self-similarity with bandwidth extending and services increasing. The self-similar traffic is long-range dependence. So, the traditional method of analyzing network performance based on Markov short-range dependent flows is not available. In this paper, the performance of asymptotic self-similar traffic has been analyzed. A call admission control (CAC) algorithm of stochastic number accessing heavy tail distribution interval ON-OFF flow has been proposed based on certain number of it. The model has been tested in simulating experiment, and has been proved available.
分 类 号:TP393.03[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.133.141.1