US 8,224,985 B2Grant
Peer-to-peer communication traversing symmetric network address translators
Issue Date:2012-07-17
•40 Claims
•4 Drawing Sheets
Abstract
Disclosed are systems and methods for peer-to-peer communication over a network between a first node behind a first network address translator (NAT) and a second node behind a second NAT, despite the first NAT and the second NAT intervening between the first and second nodes. The first NAT is a Symmetric NAT. A port prediction is performed wherein the first node constructs a list of predicted transport addresses on the first NAT. A message containing the list of predicted transport addresses is sent from the first node to the second node. A connectivity check is performed with the second node using the predicted transport addresses.
Metadata
Assignee
- Sony Computer Entertainment Inc.
Inventor
- Yutaka Takeda
Application Information
Application Number:US 11/243,853
Filing Date:2005-10-04
Priority Date:2005-10-04
Art Unit:2493
Classifications
IPC:
G06F15/16G06F15/173G06F15/177
Patent Drawings (4 sheets)
Description
Field of the Invention
[0001] Embodiments of this invention are related to computer networks and more specifically to peer-to-peer communications across symmetric network address translators on computer networks.
Background of the Invention
[0002] Use of a router that has a NAT (Network Address Translation) feature has been intervening in accessing from the external network to the internal network which is evidently a problem for peer-to-peer applications such as voice communication over the Internet (known as VoIP) and/or online gaming, etc. NAT is an Internet standard that enables a local area network (LAN) to use of one set of private IP addresses for internal traffic and a second set of global IP addresses for external traffic. A node that has NAT capability is often referred as “NAT box”.
[0003] A NAT (literally) translates network (IP) address between the two networks. Network Address Port Translation (NAPT) translates not only IP address but also port numbers of a transport layer protocol. Although NAT/NAPT has its good properties, there is a significant side effect. If the translation is dynamically performed, nodes in the external network have no way to know the IP address (and the port number) on the NAT ahead of time to reach a node in the internal network. Unfortunately, this is the most common behavior of NAT in the residential and SOHO routers deployed in the current market.
[0004] NAPT (hereinafter, called “NAT” unless stated otherwise) is the most common NAT in today's residential routers. In a NAT, an IP address is used to identify an end node, or a host. There may be more than one application running on the same node. Typically, each application has a unique port number allocated to the same IP address. That is, in order to identify an application, both an IP address and a port number must be specified. The set of IP address and a port number is often called “transport address” which is typically denoted as <ip-address>:<port>.
[0005] The notion of “port” is important to understand NAT behavior. A NAT allows two or more IP nodes behind the NAT to share a single global IP address, by translating the port numbers. When an application on a node sends a packet to a server on the public network, the NAT allocates a public transport address, having an external IP address and an external port number that is associated with the source transport address. This association created by NAT is known as “NAT Binding”. When another application on a different node behind the NAT sends a packet to the same server the NAT creates another binding with the same external IP address but with another port number. For the server, those packets look like they originated from the same node but from different port numbers. The server then simply sends responses back to those external transport addresses on the NAT. Since the NAT already has bindings for packets received from the server these packets can be correctly forwarded to the associated local nodes. A problem occurs when a node behind the NAT wants to be accessed from anyone from the public network. A NAT binding cannot be created by packets from the pubic network. The NAT can forward the inbound packets only if an associated binding already exists.
[0006] To address this problem, many routers have a Port Forwarding feature which allows a user to manually configure the routing table in the router. As opposed to NAT binding, a specified external transport address on the NAT is static so that any inbound packets arrived on the external transport address are forwarded to the specified local node on the private network. Unfortunately, such manual configuration requires users to have sufficient knowledge of TCP/IP protocol and NAT. Users also need to know the transport addresses of the applications running on the local nodes to configure the port forwarding tables. Since port forwarding is not a standardized feature, each router has a different configuration menu some of which might not be able to meet requirements from an application. To application vendors, the cost for customer support for those users who are experiencing trouble with configuration for various NATs would be very significant.
[0007] Network Address Translators (NATs), while providing many benefits, also come with many drawbacks. The most troublesome of those drawbacks is the fact that they break many existing IP applications, and make it difficult to deploy new ones. Although guidelines have been developed that describe how to build “NAT friendly” protocols, many protocols simply cannot be constructed according to those guidelines. Examples of such protocols include almost all peer-to-peer protocols, such as multimedia communications, file sharing and games.
[0008] NAT is not a concern if a session is initiated from the internal network to the external network. In client-server system such as Web (HTTP) services or E-mail (SMTP/POP3) system, a client typically initiates a connection to a server, and NAT works well with this client-server model and the deployment of NAT has been very successful.
[0009] As the Internet population and its available bandwidth grow the demand for sending and receiving large amount data directly between peers over the Internet has gotten more. As opposed to the client-server model, connecting peer-to-peer solves issues with bandwidth scalability, data propagation delay and a cost for central servers. Well-known applications of this peer-to-peer model today are VoIP and file sharing systems, etc. The peer-to-peer solution is very attractive. It has, however, significant issues with connectivity between the peers through NAT.
[0010] It has been observed that NAT treatment of User Datagram Protocol (UDP) varies among implementations. Four treatments commonly observed in implementations are, Full Cone, Restricted Cone, Port Restricted Cone and Symmetric. A full cone NAT is one where all requests from the same internal IP address and port are mapped to the same external IP address and port. Furthermore, any external host can send a packet to the internal host, by sending a packet to the mapped external address. In a restricted cone NAT all requests from the same internal IP address and port are mapped to the same external IP address and port. Unlike a full cone NAT, an external host (with IP address X) can send a packet to the internal host only if the internal host had previously sent a packet to IP address X. A port restricted cone NAT is like a restricted cone NAT, but the restriction includes port numbers. Specifically, an external host can send a packet, with source IP address X and source port P, to the internal host only if the internal host had previously sent a packet to IP address X and port P.
[0011] In a symmetric NAT all requests from the same internal IP address and port, to a specific destination IP address and port, are mapped to the same external IP address and port. If the same host sends a packet with the same source address and port, but to a different destination, a different mapping is used. Furthermore, only the external host that receives a packet can send a UDP packet back to the internal host.
[0012] One prior art NAT traversal solution has been developed based on UPnP (Universal Plug and Play), a technical specification that enables communications among home appliances such as PC, AudioNideo devices, phones and etc., proposed by Microsoft in 1999 and supported by more than 20 companies including Intel, 3Com, AT&T, Dell Computer, etc. UPnP provides NAT traversal solution that allows a node behind a UPnP compliant NAT to discover the presence of the NAT and to add and delete external port mapping on the NAT. It is an automatic port forwarding configuration, so to speak. Many residential routers support UPnP today, however, not all of them do. Some UPnP compliant routers have UPnP mode turned off by default. Users may be prompted to turn on the UPnP mode manually, but this essentially falls into the same issue with the port forwarding.
[0013] UDP hole punching is another popular and effective NAT traversal technique that works well with most of the residential routers' NAT types. As illustrated in FIG. 1 , this technique literally, it creates “a UDP hole” (or NAT binding) by sending a UDP packet 1 from a local node 2 behind a NAT 3 to the public network 4. In this example, the local node 2 has an IP address 192.168.0.2 and the UDP packet 1 is sent from local port 5060. The NAT 4 creates a binding which maps the local transport address of the local node 2 to a public transport address having a different IP address and port number. Once the NAT binding (UDP hole) is created, an allocated external port 5 can be used to receive packets 6 from anyone on the public network 4, e.g., a remote node 7, and get them forwarded to the local node 1 that created the binding initially.
[0014] Unfortunately, it is known that some NATs, e.g., Port restricted-cone or Symmetric NATs, forward the inbound packets received on the external port 5 only if the packets are sent from the same transport address (combination of IP address and port number) to which the initial hole punching packet was sent. Moreover, following issues needs to be solved to make use of UDP hole punching: (1) how can the external port number be obtained? (2) How the NAT behavior can be ascertained? (3) Will the same external port number allocated when the local node send a packet to the remote node?
[0015] To address these issues a protocol known as Simple Traversal of UDP through NAT (STUN) has been developed. STUN is a lightweight protocol proposed by Internet Engineering Task Force (IETF) that allows an IP enabled node to discover the presence and types of NAT that the node is behind. STUN works with most of NATs and does not depend on any special behavior of the NAT. The STUN server acts like a mirror held up to a node so that the node can see how its local transport address gets mapped to a public transport address.
[0016] In the example depicted in FIG. 2 STUN is of a client-server model, treating a NAT 10 as a black-box located between a client and server. A STUN client 11 at local transport address e.g., 192.168.0.2:5060 sends a binding request packet 12 to a STUN server 13 located on the public network 14 at transport address 67.2.2.2:3748. The NAT 10 allocates a public transport address of e.g., 67.1.2.3:6000 to the request packet 12. Then the STUN server 13 generates a response packet 15 that contains the source transport address (67.1.2.3:6000 in this example) of the request packet 12 in its payload so that the client 11 can tell if a NAT is present in the path by comparing the source transport address with its local transport address. The STUN client 11 also finds out the type of the NAT 10 through the communication with the STUN server 13. Additional details of the STUN protocol can be obtained from RFC 3489, by J. Rosenberg et al., “STUN—Simple Traversal of User Datagram Protocol (UDP) Through Network Address Translators (NATs)”, which is incorporated herein by reference. The STUN protocol defines the four types of NAT behavior (Full Cone, Restricted Cone, Port Restricted Cone and Symmetric) as described above.
[0017] It is important to note that the STUN protocol alone does not support a complete NAT traversal mechanism. It just helps to get necessary information about a target NAT observed by STUN server and client. A typical NAT traversal scenario with STUN and UDP hole punching is performed as follows:
-
- [0018] 1. A local node A sends a binding request packet to STUN server.
- [0019] 2. Node A receives response packet with MAPPED-ADDRESS from the STUN server.
- [0020] 3. Node A sends a connection request to Node B with the MAPPED-ADDRESS via a proxy server. (e.g., a SIP proxy server).
- [0021] 4. Node B sends a response back to Node A with Node B's transport address to Node A via the proxy server.
- [0022] 5. Node A sends a UDP hole punching packet to Node B.
- [0023] 6. Node B starts sending packets directly to the MAPPED-ADDRESS.
- [0024] 7. The packets from Node B successfully get forward to Node A by the NAT.
[0025] As described above, Node A and Node B need to exchange signals with their routable transport addresses through an intermediary (proxy) server prior to peer-to-peer connection establishment. SIP (Session Initiation Protocol) is a standardized signaling protocol, widely used for Voice over IP applications. Details of SIP are set forth in RFC 3261, which is incorporated herein by reference.
[0026] In the general NAT traversal mechanism described above, it is assumed that the MAPPED-ADDRESS obtained by using STUN can be used by Node B to reach Node A. This, however, is NOT true if the NAT is Symmetric. Since a Symmetric NAT allocates a different external port number if the destination address is different, the MAPPED-ADDRESS is not useful for Node B. Traversing a Symmetric NAT has generally been regarded as extremely difficult if not impossible.
[0027] The current practice to overcome the Symmetric NAT case is to utilize a relay server such as Traversal Using Relay NAT (TURN). TURN is a server-client protocol that allows a natted node to allocate an external transport address on a TURN server located in the public network. TURN server behaves just like a network address port translation (NAPT) box shared by many natted nodes, and relays traffic received on the allocated external port to a TURN client behind a NAT box. TURN can support any type of NAT behavior because traffic made to a TURN server is of a client-server model. However, it is clear that TURN has a significant scalability issue because all the traffic has to go through the central server.
[0028] Therefore, although several NAT traversal techniques have been developed, however, none of them have adequately solved the issue of traversal of a Symmetric NAT without a help from a relay server. Issues of NAT traversal are described in considerable detail in US Patent Application Publication 2004/0139228 entitled “Peer-to-peer (P2P) connection despite network address translators (NATs) at both ends”, which is incorporated herein by reference. Prior art solutions for traversal of the Symmetric NAT case involve highly complex operations.
[0029] One attempt Symmetric NAT traversal is based on port prediction. As shown in FIG. 3 , node A is behind a Symmetric NAT. Recall that a Symmetric NAT allocates a different port each time it sends a packet. An initial packet from node A may be sent to node C through port 6001. Node B can respond to node A through port 6001. However, node A's communication with node B may be through port 6002. Subsequent packets sent from node B to port 6001 will be discarded since the NAT binding on port 6001 does not recognize node B. Port prediction takes advantage of the behavior of a Symmetric NAT in assigning ports. Typically, the Symmetric NAT increments the port number in subsequent bindings by an amount delta-P. In the above example, delta-P is equal to 1. Thus if node A can discover whether it is behind a Symmetric NAT, e.g., using STUN, and determine the value of delta-P it can send this information to node B. When node B next attempts to contact with node A, it sends a packet to a new transport address with the previous IP address and a port number equal to the previous port number incremented by delta-P.
[0030] Unfortunately, port prediction appears to be a “brittle” technique (as it is prediction based) and subject to failure in certain circumstances. Port prediction as described above also requires node A to send node B information regarding the type of the NAT and the value of delta-P. Port prediction techniques are known to those skilled in the art, e.g., as described in greater detail by Yutaka Takeda in “Symmetric NAT Traversal using STUN, <draft-takeda-symmetric-nat-traversal-00.txt>” a copy of which can be accessed on the Internet at http://www.ietf.org/proceedings/03nov/I-D/draft-takeda-symmetric-nat-traversal-00.txt, and which is incorporated herein by reference.
[0031] Another attempted solution to the problem of Symmetric NAT traversal is known as ICE (Interactive Connectivity Establishment). ICE is a very efficient and promising technology but it is also a relatively new methodology. ICE causes a node known as an initiation to send a transport address to another node referred to as a responder and asks the responder to send communication to an IPv6 address. ICE makes the fundamental assumption that clients (node s) exist in a network of segmented connectivity. This segmentation is the result of a number of addressing realms in which a client can simultaneously be connected. The term “realms” is used here in the broadest sense. A realm is defined purely by connectivity. Two clients are in the same realm if, when they exchange the addresses each has in that realm, they are able to send packets to each other. This includes IPv6 and IPv4 realms, which actually use different address spaces, in addition to private networks connected to the public Internet through NAT. The key assumption in ICE is that a client cannot know, a priori, which address realms it shares with any peer it may wish to communicate with. Therefore, in order to communicate, the client has to try connecting to addresses in all of the realms.
[0032] The basic flow of operation for ICE is shown in FIG. 4 . Before an initiator I establishes a session, it obtains at step 21 as many IP address and port combinations in as many address realms as it can from one or more NAT discover servers N (e.g., STUN or TURN servers). These addresses all represent potential points at which the initiator I can receive a specific media stream. Any protocol that provides a client with an IP address and port on which it can receive traffic can be used. These include STUN, TURN, RSIP, and even a VPN. The client may also use any local interface addresses. For example, a dual-stack v4/v6 client will obtain both a v6 and a v4 address/port. Unfortunately, if the initiator communicates with a peer that doesn't support ICE, only one address can be provided to that peer. As such, the initiator I will need to choose one default address, which will be used by non-ICE clients. This may be a TURN derived transport address, as it is most likely to work with unknown non-ICE peers.
[0033] In the example depicted in FIG. 4 , the initiator I then runs a STUN server on each the local transport addresses it has obtained. These include ones that will be advertised directly through ICE, and so-called associated local transport addresses, which are not directly advertised; rather, the transport address derived from them is advertised. The initiator I will need to be able to demultiplex STUN messages and media messages received on that IP address and port, and process them appropriately. All of these addresses are placed into the initiate message, and they are ordered in terms of preference. Preference is a matter of local policy, but typically, the highest priority is given to IPv6 addresses, the next highest priorities are given to local addresses, and STUN-derived address and transport addresses learned from a TURN server (i.e., TURN derived transport addresses) and the lowest priority to relay server addresses.
[0034] At step 22, the initiator I sends an initiate message to the responder R. Standard signaling protocol specific mechanisms may be used to enable the signaling messages to traverse any intervening NATs between the initiator I and the responder R. At step 23, the responder R follows a similar process as the initiator followed; it obtains addresses from the NAT discovery servers N it places all of them into an accept message at step 24. Once the responder R receives the initiate message, it has a set of potential addresses it can use to communicate with the initiator I. The initiator I may be running a STUN server at each address. At step 25, the responder R performs connectivity checks, e.g., by sending a STUN request to each address, in parallel. When the initiator I receives these, it sends a STUN response as indicated at step 26. If the responder R receives the STUN response, it knows that it can reach its peer at that address. It can then begin to send media to that address at step 27. As additional STUN responses arrive, the responder R will learn about additional transport addresses which work. If one of those has a higher priority than the one currently in use, it starts sending media to that one instead. No additional control messages (i.e., SIP signaling) occur for this change.
[0035] The STUN messages described above happen while the accept message is being sent to the intitiator I. Once the intitiator I receives the accept message, it too will have a set of potential addresses with which it can communicate to the responder. The initiator I follows exactly the same STUN check process described above at step 27 and can begin sending media at step 28 to the responder R once it receives a STUN response. Furthermore, when a either the initiator I or responder R receives a STUN request, it takes note of the source IP address and port of that request and compares that transport address to the existing set of potential addresses. If the transport address is not amongst the set of potential addresses, it gets added as another potential address. The incoming STUN message provides the client with enough context to associate that transport address with priority, just as if it had been sent in an initiate or accept message. As such, the client (initiator or responder) begins sending STUN messages to it as well, and if those succeed, the address can be used if it has a higher priority.
[0036] Those of skill in the art will be familiar with the ICE protocol and various ways of implementing it. For example, ICE is described in detail by J. Rosenberg in “Interactive Connectivity Establishment (ICE): A Methodology for Network Address Translator (NAT) Traversal for Multimedia Session Establishment Protocols” a copy of which can be downloaded from the internet at http://tools.ietforg/wg/mmusic/draft-ietf-mmusic-ice/draft-ietf-mmusic-ice-03.txt, and which is incorporated herein by reference.
[0037] Although ICE is a recognized and implemented methodology, there is currently no way for ICE to send information about NAT type to facilitate the prior art port prediction (e.g., as set forth in US 2004/0139228). One would have to add another field for the methodology to handle this information and implement port prediction. This would add extra processes to both ends, and also exposing NAT types to other nodes could become a security concern. Moreover, adding a new field may break compatibility with existing systems that support standard ICE.
[0038] Thus, there is a need in the art, for an improved method for peer-to-peer communication traversing symmetric network address translators and a system for implementing such a method.
Summary of the Invention
[0039] To overcome the above disadvantages, embodiments of the invention are directed to systems and methods for peer-to-peer communication over a network between a first node behind a first network address translator (NAT) and a second node behind a second NAT, despite the first NAT and the second NAT intervening between the first and second nodes. The first NAT is a Symmetric NAT. A port prediction is performed wherein the first node constructs a list of predicted transport addresses on the first NAT. A message containing the list of predicted transport addresses is sent from the first node to the second node. A connectivity check is performed with the second node using the predicted transport addresses.
Brief Description of the Drawings
[0040] The teachings of the present invention can be readily understood by considering the following detailed description in conjunction with the accompanying drawings, in which:
[0041] FIG. 1 is a schematic diagram illustrating UDP hole punching on a network according to the prior art.
[0042] FIG. 2 is a schematic diagram illustrating the STUN protocol according to the prior art.
[0043] FIG. 3 is a schematic diagram illustrating port prediction according to the prior art.
[0044] FIG. 4 is a flow diagram illustrating the basic flow of operation for an Interactive Connectivity Establishment (ICE) methodology according to the prior art.
[0045] FIG. 5 is a schematic diagram illustrating a system NAT traversal between two nodes according to an embodiment of the present invention.
[0046] FIG. 6 is a flow diagram illustrating a method of NAT traversal between two nodes according to an embodiment of the present invention.
Description of the Specific Embodiments
[0047] Although the following detailed description contains many specific details for the purposes of illustration, anyone of ordinary skill in the art will appreciate that many variations and alterations to the following details are within the scope of the invention. Accordingly, the exemplary embodiments of the invention described below are set forth without any loss of generality to, and without imposing limitations upon, the claimed invention.
Terminology
[0048] As used herein, the following terms have the meanings shown in Table I below.
[0049]
Acronyms
| TABLE I | |
|---|---|
| natted node | A node behind a NAT. |
| client-server | A network architecture model where all clients connect to a |
| central server. (ex. Web (HTTP) service, etc.) | |
| peer-to-peer | A network architecture that does not depend on a central |
| server. Each client (peer) directly connects to other peers. | |
| (ex. DHT, VoIP, file sharing system, etc.) | |
| transport | A set of IP address and port number. |
| address | |
| Voice over | A technology enabling routing of conversations over the |
| IP (VoIP) | Internet or any other IP network. |
Acronyms
[0050] As used herein, the following acronyms have the meanings shown in Table II below.
[0051]
| TABLE II | ||
|---|---|---|
| DHT | Distributed Hash Table (ex. Chord) | |
| HTTP | Hyper Text Transfer Protocol | |
| IETF | Internet Engineering Task Force | |
| LAN | Local Area Network | |
| NAT | Network Address Translator (RFC 3022) | |
| NAPT | Network Address Port Translation (RFC 3022) | |
| SIP | Session Initiation Protocol (RFC 3261) | |
| SSP | Session Setup Protocol | |
| SOHO | Small Office and Home Office | |
| STUN | Simply Traversal UDP through NAT | |
| TURN | Traversal Using Relay NAT | |
| VoIP | Voice over IP | |
[0052] Embodiments of the invention address issues with Symmetric NAT traversal, while improving on security issues associated with the prior art and greatly simplifying the overall operation for traversing Symmetric NAT. In embodiments of the present invention, nodes behind NATs exchange transport address information instead of information about the NATs. Exchanging transport addresses instead of NAT information conforms well to ICE (Interactive Connectivity Exchange) methodology, and considerably improves overall NAT traversal operations. Embodiments of the present invention derive to combine in novelty the two methodologies, ICE and analytical port prediction methods, such as those described in the Internet Engineering Task Force (IETF) draft entitled “Symmetric NAT Traversal using STUN”, which is incorporated herein by reference.
[0053] The embodiment illustrated below with FIG. 5 and FIG. 6 pertains to a peer-to-peer UDP session establishment using SIP (Session Initiation Protocol; RFC 3261) protocol. The invention, however, is applicable to any other signaling protocols that allow a peer to send and receive signals to another peer via a proxy server on the pubic network prior to a peer-to-peer direct connection establishment. Such signaling protocols may include but are not limited to H.323, MGCP, HTTP, XMPP, etc.
[0054] As shown in FIG. 5 , a first node 102 resides in a first private network NW1 that is physically connected to a public network PNW (e.g., the internet) via a first NAT 103. Similarly, second node 104 resides in a second private network NW2 and is able to access the same public network via a second NAT 105. The private networks NW1 and NW2 may each include other nodes and other NATs in addition to the first and second nodes 102, 104 and the first and second NATs 103, 105. Other private networks may also be connected to the public network PNW. The pubic network PNW includes an SIP proxy server 100, and a STUN server 101. The first node 102 has a private IP address that is valid only in the first private network NW1 behind the first NAT 103. The first node 102 has a globally unique and routable IP address, and the first NAT 103 performs IP address and port translation between the public network and the private network. Similarly, the second node 104 has a private IP address that is valid only in the second private network NW2 behind the second NAT 105. The second node 104 has a globally unique and routable IP address, and the second NAT 105 performs IP address and port translation between pubic network and the private network.
[0055] The nodes 102, 104 can be, e.g., server hosts such as audio/video (A/V) chat, multimedia streaming devices, file sharing nodes, online gaming modules etc. Each node 102, 104 may be a general purpose computer that becomes a special purpose computer when running instructions, such as instructions for implementing the steps of the method of FIG. 6 . By way of example, the nodes 102 and 104 may be SIP user agents and able to send and receive messages each other through a SIP proxy server 100. The nodes 102 and 104 are also STUN clients. Thus, the first node 102 is able to discover the presence and types of NAT in the path between the first node 102 and the STUN server 101 by a communication with the STUN server 101 using STUN protocol. The second node 104 is similarly able to discover the presence and types of NAT between the second node 104 and the STUN server 101.
[0056] A method of NAT traversal according to embodiments of the present invention may be understood by simultaneously referring to the block diagram of FIG. 5 and flow diagram of FIG. 6 . According to an embodiment of the present invention, initially, each node 102, 104 performs NAT discovery using STUN protocol as shown in steps 202, 204 of FIG. 6 . The first node 102 discovers that it is behind the first NAT 103 and its type is Symmetric. The second node 104 discovers that it is also behind the second NAT 105 and its type is, e.g., Port restricted-cone. Then, both nodes 102, 104 register themselves to the SIP proxy server 100 to join a network at steps 206, 208. This establishes signaling paths 116, 117 to the SIP proxy server 100 so that the SIP proxy server 100 can forward messages to the registered nodes 102, 104 through the paths 116, 117.
[0057] By way of example, the first node 102 now wishes to establish a peer-to-peer connection to the second node 104. The first node 102 allocates a local port 107 for the new peer-to-peer session. Then the first node 102 obtains an external port 112 by sending a binding request 118 from the local port 107 to the STUN server 101. Since the first node 102 knows that the first NAT 103 is present and is of type Symmetric, it performs port prediction at step 210 and constructs a list of transport addresses 107, 112, 113 and 114, and puts the list into a new INVITE message. Note that unlike prior art port prediction methods the first node 102 sends no information about the first NAT 103 and it is the first node 102 not the second node 104 that performs the port prediction. In addition, sending INVITE messages containing transport addresses is perfectly compatible with the existing ICE methodology.
[0058] At step 212, the first node 102 sends the INVITE message from a local port 106 with the list of transport addresses to a SIP proxy server 100 through the already established path 116. The SIP proxy server 100 finds in the message that the final destination is the second node 104 and forwards the INVITE message through the already establish path 117, and port 111 and finally the message reaches the second node 104 on local port 108. On reception of the INVITE, the second node 104 allocates a local port 109 for the future peer-to-peer session, and then the second node 104 obtains an external port 115 by sending a binding request 119 from the local port 109 to the STUN server 101.
[0059] Since the second node 104 knows that the second NAT 105 is not Symmetric, it puts the local port 109 and the external port 115 in a new provisional response message and sends it back to the first node 102 at step 214 via the SIP proxy server 100 through the same path 117, 116. The transmission of the provisional response terminates the transport exchange phase and starts connectivity check phase. Both nodes 102 and 104 start sending STUN packets from their local ports 107, 109 to check connectivity to the transport addresses obtained from the other node at steps 216, 218. When the first node 102 sends a STUN packet 120, the first NAT 103 allocates a new external port 113, and then the packet 120 reaches the external port 115 on the second NAT 105. The first few packets could be discarded at the external port 115 because the second NAT 105 is a port restricted cone NAT and the second node 104 might not yet have sent a packet from the local port 109 to the external port 113 on the first NAT 103. The second node 104 also sends STUN packets 121, 122, 123 to the obtained transport addresses 112, 113 and 114. The packet 121 reached at the port 112 is discarded because the first NAT 103 is a Symmetric NAT and the port 112 is exclusively allocated for the session to the STUN server 101. The STUN packet 123 reached at 114 is also discarded because there is no such external port allocated by the first NAT 103. The STUN packet 122 reached at 113 is forwarded by the first NAT 103 to the local port 107. The first node 102 then sends a response to the second node 104 and the second node 104 finds it has connectivity to the port 113 on the reception of the response. The STUN packet sent from the local port 107 on the first node 102 to the external port 115 on the second NAT 105 is eventually received at the local port 109 of second node 104. The second node 104 then sends a response back to the first node 102.
[0060] Upon reception of the response message, at step 220 the first node 102 sends an UPDATE message to the second node 104 via the SIP proxy server 100 to tell the second node 104 that the first node 102 found connectivity to the external port 115. This triggers the second node 104 to send a final response message to the first node 102 at step 222 to finalize the connection establishment process.
[0061] Instead of putting a NAT type in the message and having the second node 104 to make a prediction, the first node 102 makes a prediction and puts the predicted external ports 113, 114 along with the external port 112 obtained from STUN server 101, in the new INVITE message. Thus, the first node 102 provides no information about the first NAT 103 to the second node 104. Such use of ICE method completely eliminates complicated NAT combination logic for “break-out” packets as done in the prior art (US 2004/0139228). Instead, embodiments of the present invention can achieve the same result by performing a connectivity check that is essentially equivalent to the “break-out packet”. Thus, embodiments of the invention allow a system that already uses ICE methodology to add Symmetric NAT traversal capability by simply adding the predicted transport addresses to the connectivity check list.
[0062] As described above, the first node 102, i.e., the node attempting to initiate communication with the second node 104 performs a port prediction and puts the predicted ports in the INVITE message. There are a number of techniques of performing the port prediction. For example, port prediction may be implemented using a port allocation rule discovery process using the following test. The first node 102 sends a STUN binding request to the STUN server 101 without any flags set in the CHANGE-REQUEST attribute and without the RESPONSE-ADDRESS attribute. This causes the STUN server 101 to send responses back to the address and port that the request came from. This test is applied to different combinations of IP addresses and ports in order to figure out the port allocation characteristics of the NAT 103. The STUN server 101 uses two different IP addresses, Ca and Da and two different ports CP and DP as shown in Table III below.
[0063]
| TABLE III | |||
|---|---|---|---|
| DESTINATTION | |||
| IP ADDRESS | PORT | ||
| TRY-1 | DA | DP | |
| TRY-2 | DA | CP | |
| TRY-3 | CA | DP | |
| TRY-4 | CA | CP | |
[0064] As can be seen from Table III, the test is performed four times (e.g., from TRY-1 to TRY-4) per local port in this example. All the tests must be done from the same local port. The first node 102 obtains four mapped addresses from the responses. These four mapped addresses are analyzed to determine the port allocation rule and delta-P value and to evaluation consistency. To look for consistency, the process can be performed multiple times, preferably using a different local port that does not have a NAT binding associated with it. The port allocation rule can be determined by looking at the port numbers obtained from the mapped addresses. If all port numbers are incremented for successive destinations having different port numbers, the port allocation rule is said to be “port sensitive”. If the port increment size from successive destinations having the same IP address (e.g., from TRY-1 to TRY-2 and from TRY-3 to TRY-4) is always zero, but the incremental size from successive destinations having different IP addresses (e.g., TRY-2 to TRY-3) is not zero, the port allocation rule is said to be “address sensitive”. If all port numbers of the obtained mapped addresses are the same, the NAT 103 is a ‘Cone NAT’.
[0065] The delta-P value may be determined as follows. For address sensitive allocation, the delta-P value is equal to a port increment size between successive tries for which the destination port is different, e.g., for TRY-2 and TRY-3. The process may be repeated from another local port as shown in Table IV. In this example, TRY-1 through TRY-4 are as in TABLE III and TRY-5-TRY 8 continue the pattern destination IP addresses and port numbers of Table III.
[0066]
| TABLE IV | ||
|---|---|---|
| TRY | MAPPED ADDRESS | Delta-P |
| 1 | 67.105.12.10:49152 | |
| 2 | 67.105.12.10:49152 | 0 |
| 3 | 67.105.12.10:49154 | 2 |
| 4 | 67.105.12.10:49154 | 0 |
| 5 | 67.105.12.10:49156 | 2 |
| 6 | 67.105.12.10:49156 | 0 |
| 7 | 67.105.12.10:49158 | 2 |
| 8 | 67.105.12.10:49158 | 0 |
[0067] Note that from Table IV it can be seen that where the destination IP address is the same for successive tries, the port numbers in the corresponding mapped addresses are the same. From this it can be determined that the port allocation rule is “address sensitive”. Furthermore it can be seen that the value of delta-P is equal to the port increment between TRY-2 and TRY-3 and is also equal to the port increment sizes between TRY-4 and TRY-5 and between TRY-6 and TRY-7.
[0068] For port sensitive allocation, the value of delta-P is the difference between adjoining port numbers of mapped addresses obtained from testing TRY-[N+1] and TRY-[N]. In situations where the first node 102 cannot find consistency in the port increment size for delta p determination, the application include an algorithm to determine the delta p value based on statistical observation, or to decide to give up obtaining a valid delta p.
[0069] If the second NAT 105 is not symmetric, it is sufficient to perform port prediction, e.g., as part of the NAT discovery step 202 for the first node 102. In the case where the second NAT 105 is also a Symmetric NAT, the second node 104 may perform similar port prediction as part of its NAT discovery phase 204.
[0070] While the above is a complete description of the preferred embodiment of the present invention, it is possible to use various alternatives, modifications and equivalents. Therefore, the scope of the present invention should be determined not with reference to the above description but should, instead, be determined with reference to the appended claims, along with their full scope of equivalents. Any feature described herein, whether preferred or not, may be combined with any other feature described herein, whether preferred or not. In the claims that follow, the indefinite article “A”, or “An” refers to a quantity of one or more of the item following the article, except where expressly stated otherwise. The appended claims are not to be interpreted as including means-plus-function limitations, unless such a limitation is explicitly recited in a given claim using the phrase “means for.”
Claims
What is claimed is:
1. A method for peer-to-peer connection over a network between a first node behind a first network address translator (NAT) and a second node behind a second NAT, despite the first NAT and the second NAT intervening between the first and second nodes, wherein the first NAT is a Symmetric NAT, the method comprising the steps of:
performing a port prediction on the first NAT with the first node wherein the first node uses a port allocation rule discovery process to determine port allocation characteristics of the first NAT and constructs a list of predicted transport addresses on the first NAT according to the determined port allocation characteristics;
sending an INVITE message containing the list of predicted transport addresses from the first node to the second node, wherein the INVITE message does not contain a NAT type or NAT behavior information for the first NAT; and
performing a connectivity check using the predicted transport addresses by sending one or more STUN packets from the first node to one or more transport addresses provided by the second node in a provisional response to the INVITE message and receiving a STUN packet response from the second node at the first node, wherein the STUN packet response includes a transport address of an external port on the second NAT through which one of the STUN packets sent from the first node reached the second node.
2. The method of claim 1 wherein the second NAT is not a Symmetric NAT.
3. The method of claim 1, wherein the second NAT is a Symmetric NAT.
4. The method of claim 3, further comprising the step of performing a port prediction wherein the second node constructs a list of predicted transport addresses on the second NAT.
5. The method of claim 1, further comprising performing a NAT discovery before performing the port prediction, wherein during the NAT discovery the first node determines a type of the first NAT and the second node determines a type of the second NAT.
6. The method of claim 5 wherein performing NAT discovery includes the use of a STUN server.
7. The method of claim 1 wherein performing the connectivity check includes receiving STUN packets from the second node at the one or more transport addresses provided by the first node in the INVITE message.
8. The method of claim 7 wherein performing the connectivity check further includes sending a STUN packet response from the first node to the second node, wherein the STUN packet response includes a transport address of an external port on the first NAT through which one of the STUN packets sent from the second node reached the first node.
9. The method of claim 1 wherein the first and second nodes participate in an online game.
10. The method of claim 1, further comprising the step of exchanging data between the first and second nodes over one or more connection paths established by the connectivity check.
11. The method of claim 10 wherein exchanging the data is part of an online game.
12. The method of claim 10 wherein exchanging the data is part of an online chat session.
13. The method of claim 10 wherein the data is audio-visual (A/V) data.
14. The method of claim 1, wherein performing the port prediction includes the use of an Interactive Connectivity Establishment (ICE) methodology to construct the list of predicted transport addresses.
15. The method of claim 1 wherein the first node sends the INVITE message to the second node via a proxy server on a pubic network.
16. A first node operable for peer-to-peer connection over a network from behind a first network address translator (NAT) with a second node behind a second NAT, wherein the first NAT is a Symmetric NAT, wherein the first node includes a general purpose computer programmed with instructions for performing peer-to-peer communication over a network, the instructions including:
an instruction for performing a port prediction on the first NAT with the first node wherein the first node uses a port allocation rule discovery process to determine port allocation characteristics of the first NAT and constructs a list of predicted transport addresses on the first NAT according to the determined port allocation characteristics;
an instruction for sending an INVITE message with the list of predicted transport addresses to the second node, wherein the INVITE message does not contain a NAT type or NAT behavior information for the first NAT; and
an instruction for checking for connectivity with the second node by sending one or more STUN packets from the first node to one or more transport addresses provided by the second node in a provisional response to the INVITE message and receiving a STUN packet response from the second node at the first node, wherein the STUN packet response includes a transport address of an external port on the second NAT through which one of the STUN packets sent from the first node reached the second node.
17. The first node of claim 16 wherein the first node is configured to send one or more STUN packets from the first node to one or more transport addresses provided by the second node in a provisional response to the INVITE message.
18. The first node of claim 16 wherein the first node is an online gaming module.
19. The first node of claim 16 wherein the first node is an A/V chat device, IP video camera, multimedia streaming device, or file sharing node.
20. The first node of claim 16 wherein the first node is a server host.
21. The first node of claim 16 wherein the first node is configured to send and receive signals to another peer via a proxy server on a pubic network prior to a peer-to-peer direct connection establishment with the second node.
22. A system for peer-to-peer connection, comprising
a first node behind a first network address translator (NAT);
a second node behind a second NAT, wherein the first and second nodes respectively include first and second general purpose computers programmed with instructions for performing peer-to-peer communication over a network, the instructions including:
an instruction for performing a port prediction on the first NAT with the first node wherein the first node uses a port allocation rule discovery process to determine port allocation characteristics of the first NAT and constructs a list of predicted transport addresses on the first NAT according to the determined port allocation characteristics;
an instruction for sending an INVITE message with the list of predicted transport addresses from the first node to the second node, wherein the INVITE message does not contain a NAT type or NAT behavior information for the first NAT; and
an instruction for performing a connectivity check with the second node using the predicted transport addresses by sending one or more STUN packets from the first node to one or more transport addresses provided by the second node in a provisional response to the INVITE message and receiving a STUN packet response from the second node at the first node, wherein the STUN packet response includes a transport address of an external port on the second NAT through which one of the STUN packets sent from the first node reached the second node.
23. The system of claim 22 wherein the instructions further include an instruction for performing a connectivity check with the first node.
24. The system of claim 22 wherein the instruction for performing port prediction does not configure external port mapping of the first NAT.
25. A method for peer-to-peer connection over a network between a first node behind a first network address translator (NAT) and a second node behind a second NAT, despite the first NAT and the second NAT intervening between the first and second nodes, wherein the first NAT is a Symmetric NAT, the method comprising the steps of:
performing a port prediction on the first NAT with the first node wherein the first node uses a port allocation rule discovery process to determine port allocation characteristics of the first NAT and constructs a list of predicted transport addresses on the first NAT according to the determined port allocation characteristics;
sending an INVITE message containing the list of predicted transport addresses from the first node to the second node, wherein the INVITE message does not contain a NAT type or NAT behavior information for the first NAT; and
performing a connectivity check using the predicted transport addresses by receiving STUN packets from the second node at the one or more transport addresses provided by the first node in the INVITE message and sending a STUN packet response from the first node to the second node, wherein the STUN packet response includes a transport address of an external port on the first NAT through which one of the STUN packets sent from the second node reached the first node.
26. The method of claim 25 wherein the second NAT is not a Symmetric NAT.
27. The method of claim 25, wherein the second NAT is a Symmetric NAT.
28. The method of claim 27, further comprising the step of performing a port prediction wherein the second node constructs a list of predicted transport addresses on the second NAT.
29. The method of claim 25, further comprising performing a NAT discovery before performing the port prediction, wherein during the NAT discovery the first node determines a type of the first NAT and the second node determines a type of the second NAT.
30. The method of claim 29 wherein performing NAT discovery includes the use of a STUN server.
31. The method of claim 25 wherein performing the connectivity check includes receiving STUN packets from the second node at the one or more transport addresses provided by the first node in the INVITE message.
32. The method of claim 31 wherein performing the connectivity check further includes sending a STUN packet response from the first node to the second node, wherein the STUN packet response includes a transport address of an external port on the first NAT through which one of the STUN packets sent from the second node reached the first node.
33. The method of claim 25 wherein the first and second nodes participate in an online game.
34. The method of claim 25, further comprising the step of exchanging data between the first and second nodes over one or more connection paths established by the connectivity check.
35. The method of claim 34 wherein exchanging the data is part of an online game.
36. The method of claim 34 wherein exchanging the data is part of an online chat session.
37. The method of claim 34 wherein the data is audio-visual (A/V) data.
38. The method of claim 25, wherein performing the port prediction includes the use of an Interactive Connectivity Establishment (ICE) methodology to construct the list of predicted transport addresses.
39. The method of claim 25 wherein the first node sends the INVITE message to the second node via a proxy server on a public network.
40. A first node operable for peer-to-peer connection over a network from behind a first network address translator (NAT) with a second node behind a second NAT, wherein the first NAT is a Symmetric NAT, wherein the first node includes a general purpose computer programmed with instructions for performing peer-to-peer communication over a network, the instructions including:
an instruction for performing a port prediction on the first NAT with the first node wherein the first node uses a port allocation rule discovery process to determine port allocation characteristics of the first NAT and constructs a list of predicted transport addresses on the first NAT according to the determined port allocation characteristics;
an instruction for sending an INVITE message with the list of predicted transport addresses to the second node, wherein the INVITE message does not contain a NAT type or NAT behavior information for the first NAT; and
an instruction for checking for connectivity with the second node by receiving STUN packets from the second node at the one or more transport addresses provided by the first node in the INVITE message and sending a STUN packet response from the first node to the second node, wherein the STUN packet response includes a transport address of an external port on the first NAT through which one of the STUN packets sent from the second node reached the first node.
Patent Citations (250)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4764928(A) | 1988-08-01 | Akerberg | Applicant |
| US4787051(A) | 1988-11-01 | Olson | Applicant |
| US4843568(A) | 1989-06-01 | Krueger | Applicant |
| US5128671(A) | 1992-07-01 | Thomas, Jr. | Applicant |
| US5528265(A) | 1996-06-01 | Harrison | Applicant |
| US5544325(A) | 1996-08-01 | Denny et al. | Applicant |
| US5596720(A) | 1997-01-01 | Hamada et al. | Applicant |
| US5630184(A) | 1997-05-01 | Roper et al. | Applicant |
| US5636216(A) | 1997-06-01 | Fox et al. | Applicant |
| US5701427(A) | 1997-12-01 | Lathrop | Applicant |
| US5768382(A) | 1998-06-01 | Schneier et al. | Applicant |
| US5768531(A) | 1998-06-01 | Lin | Applicant |
| US5793763(A) | 1998-08-01 | Mayes et al. | Applicant |
| US5809016(A) | 1998-09-01 | Kreitzer et al. | Applicant |
| US5812531(A) | 1998-09-01 | Cheung et al. | Applicant |
| US5835726(A) | 1998-11-01 | Shwed et al. | Applicant |
| US5856972(A) | 1999-01-01 | Riley et al. | Applicant |
| US5898679(A) | 1999-04-01 | Brederveld et al. | Applicant |
| US5956485(A) | 1999-09-01 | Perlman | Applicant |
| US6012096(A) | 2000-01-01 | Link et al. | Applicant |
| US6058431(A) | 2000-05-01 | Srisuresh et al. | Applicant |
| US6128623(A) | 2000-10-01 | Mattis et al. | Applicant |
| US6128624(A) | 2000-10-01 | Papierniak et al. | Applicant |
| US6128627(A) | 2000-10-01 | Mattis et al. | Applicant |
| US6128664(A) | 2000-10-01 | Yanagidate et al. | Applicant |
| US6151584(A) | 2000-11-01 | Papierniak et al. | Applicant |
| US6151601(A) | 2000-11-01 | Papierniak et al. | Applicant |
| US6152824(A) | 2000-11-01 | Rothschild et al. | Applicant |
| US6157368(A) | 2000-12-01 | Fager | Applicant |
| US6208649(B1) | 2001-03-01 | Kloth | Applicant |
| US6209003(B1) | 2001-03-01 | Mattis et al. | Applicant |
| US6212565(B1) | 2001-04-01 | Gupta | Applicant |
| US6212633(B1) | 2001-04-01 | Levy et al. | Applicant |
| US6289358(B1) | 2001-09-01 | Mattis et al. | Applicant |
| US6292880(B1) | 2001-09-01 | Mattis et al. | Applicant |
| US6327630(B1) | 2001-12-01 | Carroll et al. | Applicant |
| US6333931(B1) | 2001-12-01 | LaPier et al. | Applicant |
| US6349210(B1) | 2002-02-01 | Li | Applicant |
| US6353891(B1) | 2002-03-01 | Borella et al. | Applicant |
| US6375572(B1) | 2002-04-01 | Masuyama | Applicant |
| US6389462(B1) | 2002-05-01 | Cohen et al. | Applicant |
| US6393488(B1) | 2002-05-01 | Araujo | Applicant |
| US6405104(B1) | 2002-06-01 | Dougherty | Applicant |
| US6421347(B1) | 2002-07-01 | Borgstahl et al. | Applicant |
| US6487583(B1) | 2002-11-01 | Harvey et al. | Applicant |
| US6487600(B1) | 2002-11-01 | Lynch | Applicant |
| US6535511(B1) | 2003-03-01 | Rao | Applicant |
| US6549786(B2) | 2003-04-01 | Cheung et al. | Applicant |
| US6553515(B1) | 2003-04-01 | Gross et al. | Applicant |
| US6581108(B1) | 2003-06-01 | Denison et al. | Applicant |
| US6590865(B1) | 2003-07-01 | Ibaraki et al. | Applicant |
| US6616531(B1) | 2003-09-01 | Mullins | Applicant |
| US6618757(B1) | 2003-09-01 | Babbitt et al. | Applicant |
| US6636898(B1) | 2003-10-01 | Ludovici et al. | Applicant |
| US6640241(B1) | 2003-10-01 | Ozzie et al. | Applicant |
| US6641481(B1) | 2003-11-01 | Mai et al. | Applicant |
| US6661799(B1) | 2003-12-01 | Molitor | Examiner |
| US6667972(B1) | 2003-12-01 | Foltan et al. | Applicant |
| US6668283(B1) | 2003-12-01 | Sitaraman et al. | Applicant |
| US6701344(B1) | 2004-03-01 | Holt et al. | Applicant |
| US6704574(B2) | 2004-03-01 | Lin | Applicant |
| US6712697(B2) | 2004-03-01 | Acres | Applicant |
| US6772219(B1) | 2004-08-01 | Shobatake | Applicant |
| US6779017(B1) | 2004-08-01 | Lamberton et al. | Applicant |
| US6779035(B1) | 2004-08-01 | Gbadegesin | Applicant |
| US6789126(B1) | 2004-09-01 | Saulpaugh et al. | Applicant |
| US6799255(B1) | 2004-09-01 | Blumenau et al. | Applicant |
| US6807575(B1) | 2004-10-01 | Emaru et al. | Applicant |
| US6816703(B1) | 2004-11-01 | Wood et al. | Applicant |
| US6829634(B1) | 2004-12-01 | Holt et al. | Applicant |
| US6848997(B1) | 2005-02-01 | Hashimoto et al. | Applicant |
| US6891801(B1) | 2005-05-01 | Herzog | Applicant |
| US6899628(B2) | 2005-05-01 | Leen et al. | Applicant |
| US6920501(B2) | 2005-07-01 | Chu et al. | Applicant |
| US6978294(B1) | 2005-12-01 | Adams et al. | Applicant |
| US7016942(B1) | 2006-03-01 | Odom | Applicant |
| US7017138(B2) | 2006-03-01 | Zirojevic et al. | Applicant |
| US7035911(B2) | 2006-04-01 | Lowery et al. | Applicant |
| US7043641(B1) | 2006-05-01 | Martinek et al. | Applicant |
| US7065579(B2) | 2006-06-01 | Traversat et al. | Applicant |
| US7082316(B2) | 2006-07-01 | Eiden et al. | Applicant |
| US7096006(B2) | 2006-08-01 | Lai et al. | Applicant |
| US7107348(B2) | 2006-09-01 | Shimada et al. | Applicant |
| US7120429(B2) | 2006-10-01 | Minear et al. | Applicant |
| US7123608(B1) | 2006-10-01 | Scott et al. | Applicant |
| US7127613(B2) | 2006-10-01 | Pabla et al. | Applicant |
| US7130921(B2) | 2006-10-01 | Goodman et al. | Applicant |
| US7133368(B2) | 2006-11-01 | Zhang et al. | Applicant |
| US7134961(B2) | 2006-11-01 | Hora | Applicant |
| US7155515(B1) | 2006-12-01 | Brown et al. | Applicant |
| US7155518(B2) | 2006-12-01 | Forslow | Applicant |
| US7168089(B2) | 2007-01-01 | Nguyen et al. | Applicant |
| US7174382(B2) | 2007-02-01 | Ramanathan et al. | Applicant |
| US7177950(B2) | 2007-02-01 | Narayan et al. | Applicant |
| US7177951(B1) | 2007-02-01 | Dykeman et al. | Applicant |
| US7194654(B2) | 2007-03-01 | Wray et al. | Applicant |
| US7197565(B2) | 2007-03-01 | Abdelaziz et al. | Applicant |
| US7203841(B2) | 2007-04-01 | Jackson et al. | Applicant |
| US7216359(B2) | 2007-05-01 | Katz et al. | Applicant |
| US7240093(B1) | 2007-07-01 | Danieli et al. | Applicant |
| US7243141(B2) | 2007-07-01 | Harris | Applicant |
| US7254709(B1) | 2007-08-01 | Richard | Applicant |
| US7263070(B1) | 2007-08-01 | Delker et al. | Applicant |
| US7272636(B2) | 2007-09-01 | Pabla | Applicant |
| US7321928(B2) | 2008-01-01 | Feltin et al. | Applicant |
| US7340500(B2) | 2008-03-01 | Traversat et al. | Applicant |
| US7346015(B2) | 2008-03-01 | Shipman | Applicant |
| US7392375(B2) | 2008-06-01 | Bartram et al. | Applicant |
| US7398388(B2) | 2008-07-01 | Xu et al. | Applicant |
| US7407434(B2) | 2008-08-01 | Thomas et al. | Applicant |
| US7429215(B2) | 2008-09-01 | Rozkin et al. | Applicant |
| US7451490(B2) | 2008-11-01 | Pirich et al. | Applicant |
| US7457279(B1) | 2008-11-01 | Scott et al. | Applicant |
| US7533172(B2) | 2009-05-01 | Traversat et al. | Applicant |
| US7738468(B2) | 2010-06-01 | Standridge et al. | Examiner |
| US7803052(B2) | 2010-09-01 | Multerer et al. | Applicant |
| US2001/0005368(A1) | 2001-06-01 | Rune | Applicant |
| US2001/0017856(A1) | 2001-08-01 | Asokan et al. | Applicant |
| US2001/0021188(A1) | 2001-09-01 | Fujimori et al. | Applicant |
| US2001/0044339(A1) | 2001-11-01 | Cordero et al. | Applicant |
| US2001/0046213(A1) | 2001-11-01 | Sakoda | Applicant |
| US2002/0002074(A1) | 2002-01-01 | White et al. | Applicant |
| US2002/0006114(A1) | 2002-01-01 | Bjelland et al. | Applicant |
| US2002/0013838(A1) | 2002-01-01 | Kushida et al. | Applicant |
| US2002/0016826(A1) | 2002-02-01 | Johansson et al. | Applicant |
| US2002/0035604(A1) | 2002-03-01 | Cohen et al. | Applicant |
| US2002/0055989(A1) | 2002-05-01 | Stringer-Calvert et al. | Applicant |
| US2002/0075844(A1) | 2002-06-01 | Hagen | Applicant |
| US2002/0085097(A1) | 2002-07-01 | Colmenarez et al. | Applicant |
| US2002/0097732(A1) | 2002-07-01 | Worster et al. | Applicant |
| US2002/0107786(A1) | 2002-08-01 | Lehmann-Haupt et al. | Applicant |
| US2002/0107935(A1) | 2002-08-01 | Lowery et al. | Applicant |
| US2002/0119821(A1) | 2002-08-01 | Sen et al. | Applicant |
| US2002/0138471(A1) | 2002-09-01 | Dutta et al. | Applicant |
| US2002/0143855(A1) | 2002-10-01 | Traversat et al. | Applicant |
| US2002/0147810(A1) | 2002-10-01 | Traversat et al. | Applicant |
| US2002/0161821(A1) | 2002-10-01 | Narayan et al. | Applicant |
| US2002/0183004(A1) | 2002-12-01 | Fulton et al. | Applicant |
| US2002/0184310(A1) | 2002-12-01 | Traversat et al. | Applicant |
| US2002/0184311(A1) | 2002-12-01 | Traversat et al. | Applicant |
| US2003/0027634(A1) | 2003-02-01 | Matthews, III | Applicant |
| US2003/0028585(A1) | 2003-02-01 | Yeager et al. | Applicant |
| US2003/0045359(A1) | 2003-03-01 | Leen et al. | Applicant |
| US2003/0046292(A1) | 2003-03-01 | Subramanian et al. | Applicant |
| US2003/0051052(A1) | 2003-03-01 | Shteyn et al. | Applicant |
| US2003/0055892(A1) | 2003-03-01 | Huitema et al. | Applicant |
| US2003/0055978(A1) | 2003-03-01 | Collins | Applicant |
| US2003/0079003(A1) | 2003-04-01 | Burr | Applicant |
| US2003/0084282(A1) | 2003-05-01 | Taruguchi | Applicant |
| US2003/0097408(A1) | 2003-05-01 | Kageyama et al. | Applicant |
| US2003/0104829(A1) | 2003-06-01 | Alzoubi et al. | Applicant |
| US2003/0115258(A1) | 2003-06-01 | Baumeister et al. | Applicant |
| US2003/0126229(A1) | 2003-07-01 | Kantor et al. | Applicant |
| US2003/0126245(A1) | 2003-07-01 | Feltin et al. | Applicant |
| US2003/0135625(A1) | 2003-07-01 | Fontes et al. | Applicant |
| US2003/0152034(A1) | 2003-08-01 | Zhang et al. | Applicant |
| US2003/0158961(A1) | 2003-08-01 | Nomura et al. | Applicant |
| US2003/0162556(A1) | 2003-08-01 | Libes | Applicant |
| US2003/0177187(A1) | 2003-09-01 | Levine et al. | Applicant |
| US2003/0182421(A1) | 2003-09-01 | Faybishenko et al. | Applicant |
| US2003/0182428(A1) | 2003-09-01 | Li et al. | Applicant |
| US2003/0191828(A1) | 2003-10-01 | Ramanathan et al. | Applicant |
| US2003/0217096(A1) | 2003-11-01 | McKelvie et al. | Applicant |
| US2003/0217135(A1) | 2003-11-01 | Chatani et al. | Applicant |
| US2003/0227939(A1) | 2003-12-01 | Yukie et al. | Applicant |
| US2003/0229779(A1) | 2003-12-01 | Morais et al. | Applicant |
| US2003/0229789(A1) | 2003-12-01 | Morais et al. | Applicant |
| US2003/0233281(A1) | 2003-12-01 | Takeuchi et al. | Applicant |
| US2004/0007618(A1) | 2004-01-01 | Oram et al. | Applicant |
| US2004/0015548(A1) | 2004-01-01 | Lee | Applicant |
| US2004/0018839(A1) | 2004-01-01 | Andric et al. | Applicant |
| US2004/0024879(A1) | 2004-02-01 | Dingman et al. | Examiner |
| US2004/0063497(A1) | 2004-04-01 | Gould | Applicant |
| US2004/0085947(A1) | 2004-05-01 | Ekberg et al. | Applicant |
| US2004/0087369(A1) | 2004-05-01 | Tanaka | Applicant |
| US2004/0088369(A1) | 2004-05-01 | Yeager et al. | Applicant |
| US2004/0103179(A1) | 2004-05-01 | Damm et al. | Applicant |
| US2004/0110563(A1) | 2004-06-01 | Tanaka | Applicant |
| US2004/0133631(A1) | 2004-07-01 | Hagen et al. | Applicant |
| US2004/0139228(A1) | 2004-07-01 | Takeda et al. | Examiner |
| US2004/0162871(A1) | 2004-08-01 | Pabla et al. | Applicant |
| US2004/0181463(A1) | 2004-09-01 | Goldthwaite et al. | Applicant |
| US2004/0207880(A1) | 2004-10-01 | Thakur | Applicant |
| US2004/0212589(A1) | 2004-10-01 | Hall et al. | Applicant |
| US2004/0236863(A1) | 2004-11-01 | Shen et al. | Applicant |
| US2004/0236945(A1) | 2004-11-01 | Risan et al. | Applicant |
| US2004/0243665(A1) | 2004-12-01 | Markki et al. | Applicant |
| US2004/0249891(A1) | 2004-12-01 | Khartabil et al. | Applicant |
| US2004/0254977(A1) | 2004-12-01 | Zhang | Applicant |
| US2004/0267876(A1) | 2004-12-01 | Kakivaya et al. | Applicant |
| US2005/0007964(A1) | 2005-01-01 | Falco et al. | Applicant |
| US2005/0015626(A1) | 2005-01-01 | Chasin | Applicant |
| US2005/0020354(A1) | 2005-01-01 | Nguyen et al. | Applicant |
| US2005/0026698(A1) | 2005-02-01 | Pirich et al. | Applicant |
| US2005/0063409(A1) | 2005-03-01 | Oommen | Applicant |
| US2005/0064939(A1) | 2005-03-01 | McSheffrey et al. | Applicant |
| US2005/0065632(A1) | 2005-03-01 | Douglis et al. | Applicant |
| US2005/0080858(A1) | 2005-04-01 | Pessach | Applicant |
| US2005/0086287(A1) | 2005-04-01 | Datta | Applicant |
| US2005/0086288(A1) | 2005-04-01 | Datta et al. | Applicant |
| US2005/0086329(A1) | 2005-04-01 | Datta et al. | Applicant |
| US2005/0086350(A1) | 2005-04-01 | Mai | Applicant |
| US2005/0086369(A1) | 2005-04-01 | Mai et al. | Applicant |
| US2005/0105526(A1) | 2005-05-01 | Stiemerling et al. | Examiner |
| US2005/0141522(A1) | 2005-06-01 | Kadar et al. | Applicant |
| US2005/0149481(A1) | 2005-07-01 | Hesselink et al. | Applicant |
| US2005/0221858(A1) | 2005-10-01 | Hoddie | Applicant |
| US2005/0250487(A1) | 2005-11-01 | Miwa | Applicant |
| US2005/0251577(A1) | 2005-11-01 | Guo et al. | Applicant |
| US2005/0259637(A1) | 2005-11-01 | Chu et al. | Examiner |
| US2006/0063587(A1) | 2006-03-01 | Manzo | Applicant |
| US2006/0067920(A1) | 2006-03-01 | Jensen | Applicant |
| US2006/0068702(A1) | 2006-03-01 | Miwa | Applicant |
| US2006/0075127(A1) | 2006-04-01 | Juncker et al. | Examiner |
| US2006/0084504(A1) | 2006-04-01 | Chan et al. | Applicant |
| US2006/0111979(A1) | 2006-05-01 | Chu | Applicant |
| US2006/0209822(A1) | 2006-09-01 | Hamamoto | Applicant |
| US2006/0218624(A1) | 2006-09-01 | Ravikumar et al. | Applicant |
| US2006/0288103(A1) | 2006-12-01 | Gobara et al. | Applicant |
| US2007/0058792(A1) | 2007-03-01 | Chaudhari et al. | Applicant |
| US2007/0061460(A1) | 2007-03-01 | Khan et al. | Applicant |
| US2007/0077981(A1) | 2007-04-01 | Hungate et al. | Applicant |
| US2007/0150552(A1) | 2007-06-01 | Harris et al. | Applicant |
| US2007/0165629(A1) | 2007-07-01 | Chaturvedi et al. | Applicant |
| US2007/0191109(A1) | 2007-08-01 | Crowder et al. | Applicant |
| US2007/0198418(A1) | 2007-08-01 | MacDonald et al. | Applicant |
| US2007/0208748(A1) | 2007-09-01 | Li | Applicant |
| US2007/0213124(A1) | 2007-09-01 | Walker et al. | Applicant |
| US2007/0217436(A1) | 2007-09-01 | Markley et al. | Applicant |
| US2007/0237153(A1) | 2007-10-01 | Slaughter et al. | Applicant |
| US2009/0077245(A1) | 2009-03-01 | Smelyansky et al. | Applicant |
| US2009/0111532(A1) | 2009-04-01 | Salokannel et al. | Applicant |
| US2009/0138610(A1) | 2009-05-01 | Gobara et al. | Applicant |
| US2009/0228593(A1) | 2009-09-01 | Takeda | Applicant |
| US2009/0240821(A1) | 2009-09-01 | Juncker et al. | Applicant |
| EP913965 | 1999-05-01 | Applicant | |
| EP1107508 | 2001-06-01 | Applicant | |
| EP1374959 | 2003-05-01 | Applicant | |
| JP200153901 | 2001-02-01 | Applicant | |
| JP200210321 | 2002-01-01 | Applicant | |
| JP2004135778 | 2004-05-01 | Applicant | |
| WO99/35799 | 1999-07-01 | Applicant | |
| WO1/97485 | 2001-12-01 | Applicant | |
| WO2/03217 | 2002-01-01 | Applicant | |
| WO2/11366 | 2002-02-01 | Applicant | |
| WO2/23822 | 2002-03-01 | Applicant | |
| WO3/069495 | 2003-08-01 | Applicant | |
| WO2004/038541(A2) | 2004-05-01 | Applicant | |
| WO2004/063843 | 2004-07-01 | Applicant | |
| WO2005/088466 | 2005-09-01 | Applicant |
Non-Patent Literature (48)
- J. Rosenberg, Interactive Connectivity Establishment (ICE) : A Methodology for Network Address Translator (NAT) Traversal for Multimedia Session Establishment Protocols, Jul. 19, 2004, retrieved from http://tools.ietf.org/id/draft-ietf-mmusic-ice-02.txt).Examiner
- Guha et al., NUTSS: A SIP-based Approach to UDP and TCP Network Connectivity, Aug. 30, 2004, Retrieved from http://www.mpi-sws.org/˜francis/fdna02-guha1.pdf, pp. 1-6.Examiner
- J. Rosenberg, “Simple Traversal of UDP Through Network Address Translators (NAT)”, BEHAVE Internet-Draft, Jul. 17, 2005.Applicant
- J. Rosenberg, “Interactive Connectivity Establishment (ICE): A Methodology for Network Address Translator (NAT) Traversal for Offer/Answer Protocols”, MMUSIC Internet-Draft, Jul. 17, 2005.Applicant
- F. Audet, “NAT Behavioral Requirements for Unicast UDP”, BEHAVE Internet Draft, Jul. 15, 2005.Applicant
- J. Rosenberg, “Interactive Connectivity Establishment (ICE): A Methodology for Network Address Translator (NAT) Traversal for Multimedia Session Establishment Protocols”, MMUSIC Internet-Draft, Oct. 25, 2004.Applicant
- J. Rosenberg, Traversal Using Relay NAT (TURN), MIDCOM Internet-Draft, Oct. 20, 2003.Applicant
- Y. Takuda, “Symmetric NAT Traversal using STUN”, Internet Engineering Task Force, Jun. 2003.Applicant
- J. Rosenberg, “STUN—Simple Traversal of User Datagram Protocols (UDP) Through Network Address Translators (NATs)”, Network Working Group, Mar. 2003.Applicant
- J. Rosenberg, “Interactive Connectivity Establishment (ICE): A Methodology for Network Address Translator (NAT) Traversal for Offer/Answer Protocols”, MMUSIC Internet-Draft, Jan. 16, 2007.Applicant
- International application No. PCT/US2006/038285, “The International Search Report and the Written Opinion of the International Searching Authority”.Applicant
- Arno Wacker et al—“A NAT Traversal Mechanism for Peer-to Peer Networks”—Eighth International Conference on Peer-to Peer Computing (P2P'08), 2008. IEEE. pp. 81-83.Applicant
- Jim Dowling et al.—“Improving ICE Service Selection in a P2P System using the Gradient Topology”—First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 07) , 2007, IEEE, pp. 285-288.Applicant
- European Search Report dated Jan. 28, 2010 issued for European patent application No. 99252219.2.Applicant
- Office Action dated Mar. 24, 2010 issued for U.S. Appl. No. 12/235,409.Applicant
- Office Action dated Jun. 4, 2009 issued for U.S. Appl. No. 10/215,899.Applicant
- Office Action dated Nov. 7, 2008 issued for U.S. Appl. No. 10/215,899.Applicant
- Office Action dated Mar. 13, 2008 issued for U.S. Appl. No. 10/215,899.Applicant
- Office Action dated Sep. 11, 2007 issued for U.S. Appl. No. 10/215,899.Applicant
- Office Action dated Mar. 22, 2007 issued for U.S. Appl. No. 10/215,899.Applicant
- Office Action dated Aug. 12, 2005 issued for U.S. Appl. No. 10/215,899.Applicant
- NAT and Network Games, p. 1-5, entitled: Just the FAOs, Ma'am, http://www.u.arizona.edu/˜trw/games/nat.htm, Oct. 23, 2002.Applicant
- BroadbandReports.com, How to hookup our console to the net—section all, pp. 1 to 22, http://www.dslreports.com/fag/onlinegaming/all.Applicant
- Do I use NAT?, pp. 1 to 3, http://www.u.arizona.edu/˜trw/games/nat or not.php, Oct. 23, 2002.Applicant
- Home Toys Article, HAI Omni Solution, UPnP NAT Traversal FAQ, pp. 1 to 4 http://hometoys.com/htinews/aug01/articles/microsoft/upnp.htm, Nov. 11, 2002.Applicant
- InternetGatewayDevice: I Device Template Version 1.01, Copyright 1999-2001 Microsoft Corporation, 16 pgs.Applicant
- STUN—Simple Traversal of UDP Thrugh NATs, J. Rosenberg et al. pp. 1-29, Copyright the Internet Society.Applicant
- Traversal Using Relay NAT (TURN), Rosenberg, Weinberger, Huitema, Mahy, Nov. 14, 2001, pp. 1 to 17.Applicant
- http://www2.simplex.com/ip.shtml.Applicant
- http://www.dslreports.com/ip.Applicant
- Network Address Translators. Microsoft Corporation Jan. 2001, http://msdn.microsoft.com/library/default.asp?irl=/library/en-us/dnplay/html/nats2-msdn.asp.Applicant
- Nat and Peer-to-Peer networking, Dan Kegel. Copyright 1999 http://alumnus.caltech.edu/-dank/peer-nat.html.Applicant
- Office Action dated May 5, 2009 issued for U.S. Appl. No. 11/708,988.Applicant
- Final Office Action dated Oct. 29, 2009 issued for U.S. Appl. No. 11/708,988.Applicant
- Office Action dated Feb. 22, 2010 issued for U.S. Appl. No. 11/708,988.Applicant
- Notice of Allowance and Fee(s) Due dated Oct. 28, 2009 for U.S. Appl. No. 10/215,899.Applicant
- Office Action issued by the European Patent Office (EPO) on Feb. 17, 2010 for European patent application No. 09022219.2.Applicant
- Office Action issued by the USPTO on Apr. 15, 2010 for U.S. Appl. No. 12/235,438.Applicant
- PCT International Search Report dated Sep. 28, 2009 for international application No. PCT/US2009/034913.Applicant
- Final Office Action dated Jul. 19, 2010 issued for U.S. Appl. No. 12/235,409.Applicant
- Final Office Action dated Aug. 31, 2010 issued for U.S. Appl. No. 12/235,438.Applicant
- Notice of Allowance and Fees Due dated Jul. 22, 2010 issued for U.S. Appl. No. 12/043,080.Applicant
- The International Search Report of the Written Opinion of the International Searching Authority dated Nov. 6, 2009 for the international application No. PCT/US2009/057192.Applicant
- Steven Hessing; “Peer to Peer Messaging Protocol (PPMP)” Internet Draft, Apr. 2002, pp. 1-57, XP015001173.Applicant
- Song Siang et al: “FloodTrial : an efficient file search technique in unstructured peeito-peer systems” GLOBECOM 2003, vol. 5, Dec. 1, 2003, pp. 2891-2895, XP010678188.Applicant
- Dutkiewicz E Ed—Institute of Electrical and Electronics Engineers: “Impact of transmit range on throughput performance in mobile ad hoc networks” ICC 2001. 2001 IEEE International Conference on Communications, Conference Record. Helsinky, Finland, Jun. 11-14, 2001, IEEE International Conference on Communications, New York, NY IEEE, US, vol. VOL. 1 of 10, Jun. 11, 2001, pp. 2933-2937, XP 010553662 ISBN: 0-7803-7097-1.Applicant
- Kim Y Ed—Association for Computing Machinery: “Simple and Fault-Tolerant Key Agreement by Dynamic Collaborative Groups”, Proceedings of the 7m ACM Conference on Computer and Communications Security. CS 2000. Athens, Greece, Nov. 1-4, 2000, ACM Conference on Computer and Communications Security, New Your, NY: ACM, US, vol. Conf. 3, Nov. 1, 2000, pp. 1 38, XP 002951317 ISBN: 1-58113-2034.Applicant
- Baughman et al., Cheat-proof playout for centralized and distributed online games, INFOCOM2001, Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE Publication Date.: 2226 Apr. 2001, on pp. 104-113, vol. 1.Applicant