SMBR: A novel NAT traversal mechanism for structured Peer-to-Peer communications

  • Authors:

  • Pinggai Yang; Jun Li; Jun Zhang; Hai Jiang; Yi Sun;Eryk Dutkiewicz

  • Affiliations:

  • Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China;Macquarie University, Sydney, Australia

  • Venue:
  • ISCC '10 Proceedings of the The IEEE symposium on Computers and Communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In recent years, structured P2P communications is being widely used for its features of self-organization as well as good scalability and flexibility. To make sure that every node can participate in such a network whether it is behind a NAT or not, we must solve the NAT traversal problem. However, existing NAT traversal methods all need the support of a centralized server which will destroy the distributive characteristic of structured P2P. In this paper, we propose a distributed NAT traversal mechanism called SMBR (Selective-Message Buddy Relaying) for structured P2P. SMBR has two main advantages. The first one is that it does not need the support of a server and thus can maintain the characteristics of structured P2P. Secondly, SMBR uses different mechanisms for the control messages and data according to their size. For control messages, it uses the method of buddy's relay while for data direct connections can be built with the help of the buddy. Using this mechanism, SMBR can achieve a balance between the traversal time and the buddies' load.