检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]广东轻工职业技术学院计算机工程系,广东广州510300 [2]重庆广播电视大学南川分校,重庆408400
出 处:《计算机工程与设计》2008年第1期76-79,共4页Computer Engineering and Design
基 金:广东轻工职业技术学院自然科学基金项目(粤轻自200612-6)
摘 要:针对BryanFord等人深入研究的开洞穿越NAT的技术只适用于ConeNAT不适用于SymmetricNAT的问题,提出了一种UDP端口准随机猜测方法和相应的算法来解决。算法对Symmetric NAT映射端口是随机变化还是等差变化先做判断,然后选择相应的猜测(扫描)方式找出对方端口,使得UDP报文能穿越Symmetric NAT。即通过让通信双方彼此猜出对方NAT映射的UDP端口来实现位于不同NAT设备之后的客户端的点对点通信I。nternet实验验证了该方法和算法的正确性和可行性。A method with it corresponding algorithm for symmetric NAT traversal of UDP through network address translators is brought forward and analyzed. In this method and algorithm, the two techniques called UDP hole punching and guess- pseudorandom are used. The former, adequate for cone NAT only, is documented in RFC 3489 as STUN, and developed more thoroughly by Bryan Ford and his confreres; the latter, put forward by us, according as the change of port mapping of symmetric NAT being of arithmetic progression or stochastic, selects corresponding guess (scanning) way to find out the port of opposite clients which locate behind different symmetric NATs, so that the peer to peer communication can be go on. The feasibility and the correctness of the method and algorithm are verified with a experiment on Internet.
关 键 词:UDP开洞 准随机猜测 锥形网络地址转换 对称网络地址转换 端口映射
分 类 号:TP393.04[自动化与计算机技术—计算机应用技术] TP393.07[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30