检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吕绍和[1] 殷建平[1] 蔡志平[1] 赵文涛[1]
出 处:《哈尔滨工业大学学报》2008年第1期118-122,共5页Journal of Harbin Institute of Technology
基 金:国家自然科学基金资助项目(60373023)
摘 要:针对网络路径可用带宽的精确测量问题,结合报文对与自拥塞原则提出了一种路径可用带宽测量新方法COPP(Chirp of Packet Paris),其基本思想是以一组发送速率不断增大的报文对序列为探测报文,通过发现所有转换带宽并根据相应转换点所受干扰程度赋予转换带宽不同的权重,加权平均的结果即为测量结果.分析并给出了报文对是否为转换点的判断规则及对不同类型转换点赋予不同权重的加权过程,讨论了不同阈值对测量的影响.在多种背景流条件下与其他方法的比较表明:COPP以较低开销得到了较高精度的测量结果.For estimating the available bandwidth along a network path, a novel active probing methodology COPP ( chirp of packet paris) is presented combining serf-induced congested principle with packet pair technique. After a sequence of packet pairs with gradually reduced intra-pair spacing was transmitted, COPP process would discover all turning bandwidth. Then every bandwidth was bound with a distinct weight according of the degree of interference of the underlying turning point and its neighbors to yield the final estimate by weighted adding up all turning bandwidth. Based on analysis of inter-packet spacing and one-way delay of single packet in a packet pair, the decision rules for determining whether a packet pair is turning point were shown. We also described the weighting process to obtain different weights for different kinds of turning point and discussed the effect of different thresholds on estimation. Simulation results in several cross traffic conditions indicate that COPP provides accurate estimation with relatively fewer overhead compared to other estimating tools.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.104