检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《科学技术与工程》2009年第24期7395-7398,共4页Science Technology and Engineering
摘 要:数据包在网络上传输到目标站点,包长不能超过PMTU值。研究PMTU探测算法的目的是为了尽可能封装大的IP数据包,提高网络资源利用率。分析了数据报文分片机制。探讨了目前主流的PMTU探测算法,如递增法,递减法,分层探测算法的优缺点。并在此基础上提出和实现一种改进的PMTU探测算法,经过对不同站点进行测试,结果表明改进的算法发包数量较少,探测值也更精确。Packets on the network to be transmitted to the target site, the packet length can not exceed the value of PMTU. Study of the Path MTU Discovery Method is designed to encapsulate large IP packet to improve network resource utilization. The mechanic of datagram fragmentation is analyzed. The current main PMTU discovery algorithms, such as increase algorithm, decrease algorithm, and hierarchical algorithm are researched. Based on the above algorithms an improved PMTU discovery algorithm has been proposed and implemented. After testing on various sites, the result indicates that the improved algorithm reduces the number of packets to be send and the detect PMTU value is more accurate.
关 键 词:最大传输单元途径(Path MAXIMUM TRANSMISSION Unit PMTU) 分片 IPV6
分 类 号:TP393.06[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.121