LTP协议数据传输轮次  

Number of round trips in LTP data block transmissions

作　　者：董扬威[1] 林闯[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《清华大学学报（自然科学版）》2015年第11期1216-1220,1228,共6页Journal of Tsinghua University(Science and Technology)

基　　金：国家"九七三"重点基础研究项目(2010CB328105)

摘　　要：Licklider协议(Licklider transmission protocol,LTP)是一种主要应用于空间网络的点到点传输协议,可用于空间网络相邻节点间的数据传输。LTP可靠传输通过返回确认和重传实现。空间网络节点间距离长,多个往返轮次的确认和重传过程造成极大的传输延迟。该文给出了一种传输轮次的形式化分析方法,其结果包含传输轮次的分布函数、期望和方差。另外提供了一种基于上下界的方法,给出了形式非常简洁的结论,其结果包含轮次期望的上下界和近似值。然后通过典型例子的仿真计算和比较验证了相关结论。The Licklider transmission protocol （LTP） is a point-to-point protocol that is mainly used to transmit data between adjacent nodes in space networks. LTP achieves reliability by return acknowledgements and retransmissions. Typical applications have long distances between network nodes which result in large transmission delays. This delay is further multiplied by the acknowledgement and retransmission processes. Thus, the number of round trips （QoRT） needed to successfully transmit an LTP block needs to be investigated. This paper presents an analytical evaluation of the QoRT that gives the distribution function, mean and variance of the QoRT. The results also give more concise upper bounds, lower bounds and approximate means. Simulations verify the theoretical results. Key words： Licklider transmission protocol （LTP） ; delay evaluation number of round trip

关 键 词：Licklider传输协议 延迟分析 传输轮次 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]