共查询到20条相似文献,搜索用时 156 毫秒
1.
改进型分层抽样技术及性能研究 总被引:2,自引:2,他引:0
报文抽样技术是高速网络流量测量和管理中使用的一项关键技术。本文通过引进分层特征、层数L、分层边界、各层样本量分配、层内抽样策略5个分层抽样参数,并对其进行重新配置和简单理论探讨,实现对分层抽样技术的改进。同时文章使用简单线性估计推断原始流数据,并借助于Φ偏差检验方法,对改进的分层抽样技术和其它抽样技术在测量网络报文长度分布方面进行准确性性能比较。结果表明,改进的分层抽样技术在测量报文长度分布方面的准确性性能远高于其它抽样方式,提高了测量的精度。 相似文献
2.
3.
4.
往返时延(RTT)是网络测量中的一个重要测度,是刻画网络性能的重要指标。传统的RTT测量都是基于报文的,需要专门的主动或被动测量平台的支持。提出一种新的 RT T 估计方法,仅使用现有路由器设备提供的流记录,不需要额外的网络测量设施。通过对 TCP 块状流传输特性的分析,分别建立了当套接字缓冲区长度与带宽延迟积BDP相对较小、较大和相近这3种情况下的RTT估计模型。实验结果表明,这些模型都能很好地完成RTT估计。同时,由于在估计当中只使用了流持续时间和总报文两个变量,因此,该方法同样适用于以抽样流记录为输入的环境,能够有效地应用于现有的大规模主干网环境的网络检测与管理。 相似文献
5.
随机分组抽样是网络管理和测量中最常见的抽样方法。已有的研究大都集中在此抽样方法下基于总体的流大小分布估计算法,但一些网络应用更关心总体流量中某个子群体的流大小分布。本文将总体的网络流划分成子群体S和子群体的补集-S,提出了一种在随机分组抽样下运用TCP协议信息的由S与S-共同组成流大小的联合分布的估计算法。实验证明,该算法能够较好地还原子群体及其在总体下的流大小分布的特征;另一方面,通过运用样本流中TCP协议信息,提高了子群体流大小分布估计算法的准确性。 相似文献
6.
TCP与UDP网络流量对比分析研究* 总被引:12,自引:1,他引:11
网络带宽不断增长,越来越多的音/视频、在线游戏等应用成为网络空间的主体。基于实时性考虑,这些新兴应用协议多选择UDP作为其底层的传输协议,使得UDP流量呈上升趋势,而以往的流量测量工作一般基于TCP进行,忽略了UDP协议。对国内某骨干网流量进行了连续12 h的在线测量,在传输层和应用层分别对TCP和UDP及其应用层协议的流的总数、长度分布、持续时间分布、流的速度分布等进行了详尽的分析,并对TCP和UDP的应用层协议流的大小、长短、快慢作了详细的分类。为网络流的分类技术、网络行为发现、网络设计等提供了数据支持。 相似文献
7.
针对高速链路中流量测量缺乏可扩展性的问题,提出一种在线挖掘频繁流的算法。通过采用“滑动窗口”机制,构造流抽样函数,自适应地设置抽样门限的方法,实现流大小的无偏估计。基于实际的互联网数据进行仿真实验,结果表明,该算法在保证准确性的同时,具有自适应性和资源可控性。 相似文献
8.
9.
基于中粒度质量可伸缩(medium grain scalable, MGS)编码在可伸缩编码(scalable video coding, SVC)应用中的广泛性,在分析了MGS编码结构特点和问题的基础上,利用DCT系数分布特性提出MGS片层数据重要性的估计方法实现对MGS编码各片层重要性的估计。在此重要性估计方法的前提基础上,将之应用于指导可伸缩编码中的码流提取和容错编码。实验测试结果表明,MGS片层数据重要性估计方法的准确性和应用有效性,保障了视频码流质量,提高了码流提取效率。 相似文献
10.
主要研究了基于CR(capture-recapture)模型业务流估计算法CARE的过程和模型,分析了区分水平值、估计次数和数据列表长度对CARE业务流估计结果的影响,提出一种改进CARE业务流估计算法。新算法修改了CARE算法的估计过程,通过递归逐渐得到稳定的估计结果。实验分别采用计算机模拟数据和美国应用网络研究国家实验室NLANR的被动测量和分析工作组(PMA)的数据来对两种算法进行比较分析。结果表明改进的CARE算法业务流估计更准确。改进的CARE算法可以应用于网络中间设备实现业务流数目的估计,保证公平的带宽分配,具有很广泛的应用前景。 相似文献
11.
In much of the literature the extreme distribution has been used to model first-person shooter (FPS) game packet length distributions. In this paper we show that a skewed mixture distribution, the Ex-Gaussian, is also suitable for modelling the packet payload lengths for two-player games of seven popular FPS games in the server-to-client direction. Also there is a plausible physical justification for the choice of a mixture distribution as a suitable model. The Ex-Gaussian distribution has properties that can be exploited to synthesise the server-to-client packet payload length distributions for larger numbers of players using measurements taken from game trials with a small number of players. We have also outlined a computationally simple technique that can be used to synthesise FPS game server-to-client packet payload length distributions for N-players from measurements from two-player games. This technique is useful for building realistic traffic models for FPS game traffic that can be used in simulation studies. 相似文献
12.
With the rapid growth of link speed, obtaining detailed traffic statistics becomes much more difficult. In order to reduce the resource consumption of measurement systems, more and more passive traffic measurement employs sampling at the packet level. Packet sampling has become an attractive and scalable method to measure flow data on high-speed links. However, knowing the length distributions of traffic flows passing through a network link is very useful for network operation and management. In this paper, we consider the problem of estimating flow length distributions based on sampled flow data. This paper introduces two algorithms for estimating flow length distributions, fitting estimation and factoring estimation. The fitting estimation uses piecewise Pareto distribution to fit the original traffic for a small sampling period. The factoring estimation is used for a large sampling period. It first factorizes the large sampling period into a product of some smaller integer factors, then iteratively invokes fitting estimation or other algorithms such as ${\textit{EM}}$ in the arranged order of the factors. Evaluations of the proposed algorithms on large Internet traces obtained from several sources demonstrate that they have high measurement accuracy with low computation overhead. The algorithms allow us to recover the complete flow length distributions. 相似文献
13.
In the light of multi-continued fraction theories, we make a classification and counting for multi-strict continued fractions, which are corresponding to multi-sequences of multiplicity m and length n. Based on the above counting, we develop an iterative formula for computing fast the linear complexity distribution of multi-sequences. As an application, we obtain the linear complexity distributions and expectations of multi-sequences of any given length n and multiplicity m less than 12 by a personal computer. But only results of m=3 and 4 are given in this paper. 相似文献
14.
A separation method of transmission delays and data packet dropouts from a lumped input delay in the stability problem of networked control systems 下载免费PDF全文
This paper proposes a separation method of a transmission delay and data packet dropouts from a lumped input delay in the stability problem of a networked control system, where both the transmission delay and the data packet dropouts are involved. By modeling data packet dropouts as sampling processes and the transmission delay as a state delay, the networked control system is represented as a sampled‐data system with aperiodic sampling and a state delay. In order to separate the state delay and the sampling, the sampled‐data system is transformed into a new system with an integral operator, where the sampling is embedded into the integral operator. By investigating the integral operator's gain and passivity, a novel Lyapunov functional is constructed to address the stability problem. The obtained stability results are dependent on both the data packet dropouts and the time delay. A numerical example is provided to demonstrate that the stability results are less conservative than some existing ones. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
15.
维护每个报文的流记录需要占用大量测量资源.目前已有多种抽样技术估计网络流统计信息,然而精确地估计出流数统计信息是目前的研究难点.提出了Integral和Iteration 两种基于报文抽样样本估计网络流数的算法.Integral算法只需使用抽样流长为1的流数信息就可以近似推导出未抽样的流数.Iteration算法通过建立迭代函数估计未抽样流数,然后根据未抽样流数和已抽样的流数推断出原始流量的流数.采用CERNET(China education andresearch network)骨干网络链路数据将这两种算法与EM(expectation maximization)算法进行对比,表明Iteration算法具有较好的精度和性能. 相似文献
16.
研究一类带有网络传输时滞和丢包的双率采样系统的网络化H∞控制问题. 假设对象状态变量被分成两个分向量, 同一分向量的状态变量由同一类传感器以相同周期采样, 且两类传感器的采样频率不同. 采样后的分向量分别通过非理想网络传输到控制器端. 考虑到双率采样、网络传输时滞和丢包现象, 引入同步观测器来估计对象状态并设计基于估计状态的控制器来镇定双率采样系统. 基于这个思路, 将双率采样的网络化控制系统建模为带有两个时变时滞的连续系统. 利用Lyapunov-Krasovskii泛函方法, 以矩阵不等式形式给出该系统的稳定性判据和控制器设计方法. 最后, 通过数值例子验证所提方法的有效性. 相似文献
17.
18.
提出了一种改进型FAMA(floor acquisition multiple access)协议,用节点竞争失败次数(无效RTS)对信道争用情况进行估计,动态调整FAMA协议中的报文序列长度,实现移动节点公平接入,并保障较好的网络吞吐率。 相似文献
19.
吕昭李韬 《计算机工程与科学》2014,36(5):860-865
随着软件定义网络、OpenFlow等技术的兴起,传统的基于5元组的报文分类技术已不能满足OpenFlow基于多元组的细粒度流量控制需求。因此,以分析已有的报文分类算法为基础,采用分而治之的思想,针对OpenFlow报文分类的精确匹配需求,设计实现了一种基于Hash的计数型链表Bloom Filter算法--OF_CBF算法。针对OpenFlow报文分类的通配匹配需求,借鉴正则表达式匹配算法思想,设计实现了基于有限自动机的报文匹配算法--OF_FSMP算法。对两种算法进行分析验证,并初步对两种算法进行了性能分析。 相似文献