Peer-to-peer communication across network address translators

被引:0
作者
Ford, B [1 ]
Srisuresh, P [1 ]
Kegel, D [1 ]
机构
[1] MIT, Cambridge, MA 02139 USA
来源
USENIX ASSOCIATION PROCEEDINGS OF THE GENERAL TRACK: 2005 UNENIX ANNUAL TECHNICAL CONFERENCE | 2005年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Network Address Translation (NAT) causes well-known difficulties for peer-to-peer (P2P) communication, since the peers involved may not be reachable at any globally valid IP address. Several NAT traversal techniques are known, but their documentation is slim, and data about their robustness or relative merits is slimmer. This paper documents and analyzes one of the simplest but most robust and practical NAT traversal techniques, commonly known as hole punching. Hole punching is moderately well-understood for UDP communication, but we show how it can be reliably used to set up peer-to-peer TCP streams as well. After gathering data on the reliability of this technique on a wide variety of deployed NATs, we find that about 82% of the NATs tested support hole punching for UDP, and about 64% support hole punching for TCP streams. As NAT vendors become increasingly conscious of the needs of important P2P applications such as Voice over IP and online gaming protocols, support for hole punching is likely to increase in the future.
引用
收藏
页码:179 / 192
页数:14
相关论文
共 26 条
[1]  
[Anonymous], 1981, RFC 793
[2]  
BIGGADIKE A, 2005, ACM SIGCOMM AS WORKS
[3]  
CLARK D, 2003, ACM SIGCOMM FDNA WOR
[4]  
Deering S., 1998, INTERNET PROTOCOL VE
[5]  
FORD B, 2003, 2 WORKSH HOT TOP NET
[6]  
FORD B, 2003, MITLCSTR926
[7]  
FRANCIS P, 2002, ACM SIGCOMM AUG
[8]  
GUHA S, 2004, SIGCOMM 2004 WORKSH
[9]  
GUHA S, SIMPLE TRAVERSAL UDP
[10]  
HOLDREGE M, 2001, 3027 RFC