检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]深圳信息职业技术学院可视媒体处理与传输深圳市重点实验室,广东深圳518029 [2]深圳大学计算机与软件学院,广东深圳518060
出 处:《计算机仿真》2011年第12期107-110,248,共5页Computer Simulation
基 金:国家自然科学基金项目(61172165);广东省自然科学基金项目(S2011010000697);广东省高等职业院校珠江学者岗位计划资助项目(2011);深圳市基础研究计划-杰出青年基金项目(JC201005280613A)
摘 要:网络时延是重要的网络性能指标,是网络服务质量测量与分析领域的重要目标之一。在网络拓扑已知且稳定及链路性能时空独立性的假设前提下,给出了网络链路时延估计模型和端时延数据采集方法,提出了一种低复杂度的网络链路时延估计方法。首先应用伪似然估计,然后确定可解的探测单元,通过限制平均采样精度和探测单元链路数的增加来显著降低计算复杂度,解决了计算复杂度过高的链路时延估计求解问题。最后利用基于NS2的仿真研究验证了时延估计方法的有效性和准确性。Network delay is one of the important network performance parameters,and it is one of the important objectives in the study field of network service quality measurement and analysis.Based on the assumptions that network topology structure was known and stable,and the link performance was temporally and spatially independent,the network link delay estimation model and end-to–end delay data acquisition were presented.An approach to network internal link delay estimation with low computation complexity was proposed.Firstly,Pseudo Likelihood Estimation(PLE) was adopted.Secondly,estimation units with definite solution were determined.By means of controlling the increase of average sampling precision and estimation unit links,the computation complexity of link delay estimation was significantly lowered.This approach can solve the problem of high computation complexity of network link delay estimation.Finally simulation study was performed on NS2 platform.The simulation results show that the approach is effective and accurate.
关 键 词:网络链路时延 时延估计模型 伪似然估计 计算复杂度
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.51