期刊文献+

基于端口准随机猜测的UDP穿越SymmetricNAT的方法 被引量:2

Method of symmetric NAT traversal of UDP through NATs based on guess-pseudorandom
在线阅读 下载PDF
导出
摘要 针对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)
关键词 UDP开洞 准随机猜测 锥形网络地址转换 对称网络地址转换 端口映射 UDP hole punching guess-pseudorandom cone NAT symmetric NAT port mapping
作者简介 石硕(1962-),男,重庆人,高级实验师,研究方向为网络通信、人工智能; E-mail:shio@gdqy.edu.cn 林莉(1959-),女,重庆人,高级讲师,研究方向为计算方法; 李久仲(1963-),男,河南商城人,硕士,高级讲师,研究方向为数据库系统优化、数据挖掘; 张蒲生(1957-),男,湖南人,教授,研究方向为网络数据库应用、计算方法。
  • 相关文献

参考文献3

二级参考文献21

  • 1柯金水,王芙蓉,戴彬.基于软交换的NAT/防火墙穿透技术研究[J].天津通信技术,2004(2):34-39. 被引量:2
  • 2何宝宏.浅析NAT的类型[J].电信网技术,2004(8):4-7. 被引量:8
  • 3吴煜卓,童恒庆,刘喜雨.基于UDP协议穿透NAT代理的研究与设计[J].微机发展,2005,15(1):122-124. 被引量:2
  • 4Plaxton CG, Rajaraman R, Richa AW. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 1999,32(3):241-280.
  • 5Hildrum K, Kubiatowicz JD, Rao S, Zhao BY. Distributed object locationin in a dynamic network. Theory of Computing Systems,2004,37:405-440.
  • 6Rowstron A, Druschel P. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proc.of the 18th IFIP/ACM Int'l Conf. on Distributed Systems Platforms (Middleware). 2001. 329-350.
  • 7Rhea S, Geels D, Roscoe T, Kubiatowicz J. Handling churn in a DHT. In: Proc. of the USENIX Annual Technical Conf. 2004.127-140.
  • 8Albert R, Barabasi AL. Statistical mechanics of complex networks. Review of Modern Physics, 2002,74(1):47-97.
  • 9Iamnitchi A, Ripeanu M, Foster I. Locating data in (Small-World?) peer-to-peer scientific collaborations. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems. Cambridge: Springer-Verlag, 2002. 232-241.
  • 10Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Intemet applications. In: Proc. of the ACM SIGCOMM 2001. San Diego, 2001. 149-160.

共引文献13

同被引文献19

引证文献2

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部