摘要
针对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.
出处
《计算机工程与设计》
CSCD
北大核心
2008年第1期76-79,共4页
Computer Engineering and Design
基金
广东轻工职业技术学院自然科学基金项目(粤轻自200612-6)
作者简介
石硕(1962-),男,重庆人,高级实验师,研究方向为网络通信、人工智能; E-mail:shio@gdqy.edu.cn
林莉(1959-),女,重庆人,高级讲师,研究方向为计算方法;
李久仲(1963-),男,河南商城人,硕士,高级讲师,研究方向为数据库系统优化、数据挖掘;
张蒲生(1957-),男,湖南人,教授,研究方向为网络数据库应用、计算方法。