检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中山大学电子与通信工程系,广东广州510275
出 处:《通信学报》2007年第9期104-111,118,共9页Journal on Communications
基 金:国家自然科学基金资助项目(90304011);广东省自然科学基金资助项目(04009747);高等教育博士计划基金资助项目(20040558043);教育部留学回国人员科研启动基金资助项目~~
摘 要:提出了一种测量和估计网络端到端单向排队时延的新方法。与消除时钟偏差和时钟频差的现有方法相比,新方法完全不需要测量端之间的时钟同步。探测分组之间的发送和到达时间间隔在两端分别测量,然后利用傅立叶域-时间域的迭代重构算法估计端到端单向排队时延的分布特性。仿真和分析结果表明新方法具有很好的实时性、准确性和顽健性。A novel approach was put forward to measure and estimate end-to-end one-way queuing delay in the network. In contrast to existing methods that were based on some assumptions to remove clock offset and skew during their measurements, clock synchronization was not required in the novel approach. Intra-gaps between the two packets in each probe pair were separately measured at both ends, and the distribution of end-to-end one-way queuing delay was then estimated by exploiting a Fourier-to-time reconstruction algorithm. The approach's performance in real-time convergence, estimation preciseness, and robustness were verified by the simulation analysis.
关 键 词:端到端测量 单向排队时延 时钟同步 时延分布重构
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38