北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2014, Vol. 37 ›› Issue (s1): 97-103.doi: 10.13190/j.jbupt.2014.s1.019

• 研究报告 • 上一篇    下一篇

IP网络中端到端时延估计方法

王睿1, 肖丽媛1, 曹苏苏2, 王正1, 王海宁1   

  1. 1. 中央编办事业发展中心, 北京 100028;
    2. 中国民用航空局空中交通管理局, 北京 100022
  • 收稿日期:2013-10-28 出版日期:2014-06-28 发布日期:2014-06-28
  • 作者简介:王 睿(1979- ),男,工程师,E-mail:wangrui@conac.cn.
  • 基金资助:

    国家科技支撑计划项目(2012BAH16B00);国家自然科学青年科学基金项目(61003239,61102057)

End-to-End Delay Estimation Method in IP Networks

WANG Rui1, XIAO Li-yuan1, CAO Su-su2, WANG Zheng1, WANG Hai-ning1   

  1. 1. Service Development Center of the State Commission for Public Sector Reform, Beijing 100028, China;
    2. Air Traffic Management Bureau of Civil Aviation Administration of China, Beijing 100022, China
  • Received:2013-10-28 Online:2014-06-28 Published:2014-06-28
  • Supported by:
     

摘要:

提出了一种新的估计端到端时延的方法——往返规划算法,它是基于已有的线性规划算法,同时对相对两个方向上的时延进行测量,把不同分组在相对方向上的时延之和看作为同一个分组的“往返时延”以消除通信双方时钟时间差对端到端时延的影响,当相对方向上经历最小时延的分组在不同时刻发送时,这个“往返时延”还受到双方时钟频率差的影响,算法采用了调整其中任一分组发送时刻的方法消除此影响,并与线性规划算法以及Paxson算法作了性能比较,理论及实验结果均表明在不增加复杂度的前提下往返规划算法估计出的端到端时延更加准确.

关键词: 端到端时延, 往返时延, 时间差, 频率差

Abstract:

A named round-trip programming algorithm for estimating end-to-end delay was proposed based on the known linear programming algorithm in which the forward and backward delays are simultaneously measured. It regards the sum of forward and backward delays of different packets as one packet's "round-trip delay" in order to eliminate the influence of offset on end-to-end measurements. And if the packets in two directions, which experience least end-to-end delays, are sent at different time, this "round-trip delay" would be affected by skew. The algorithm adjusts one packet's sending time to another to avoid the effect of skew. Furthermore, the mentioned algorithm is compared with linear programming and Paxson's algorithm. Analysis and simulation prove that the algorithm is of better performance without increasing complexity.

Key words: end-to-end delay, round-trip delay, offset, skew

中图分类号: