Can anyone explain how
UDP hole punching works in a simple way? I know how
PAT works, but can't get a clear idea about
UDP hole punching.
Details vary but basically it goes something like.
- The two peers both open a UDP socket bound to a random local port
- The two peers both contact a server on the internet. This server responds and tells them what IP and port their packet was received from. Since the server is on the Internet the IP/port seen by the server is the external IP and port
- The two peers exchange information about the external IPs and ports through some mechanism.
- The two peers start trying to send UDP traffic to each other.
- Hopefully the external IP and port used by the NAT for the traffic to the server are the same as the external IP and port used for the traffic sent towards the other peer. So once both peers have sent packets out through their NATs the incoming packets match the mappings and peer to peer communication is established.
This strategy will work reliablly with full cone, restricted cone or restricted port cone NATs. It will work most of the time with port-preservative symmetric NATs. It will not work with randomising symmetric NATs.
From testing, when you send a UDP to a server it will respond back with the port you used, the thing is when you try to contact the other peer the port you use will be different based on your NAT, making the whole chit chat with the middle server to find what your external port was to accomplish communication with a third node pointless.