adam/ipfs-blog
1
0
Fork 0
mirror of https://github.com/ipfs/ipfs-blog.git synced 2026-08-11 19:33:03 +02:00
Code Issues Packages Projects Releases Wiki Activity

src/_blog: Replace computer with node

Browse Source
This commit is contained in:
Max Inden
2022-02-09 19:07:00 +01:00
parent fcc629e1a8
commit 11042b14ac
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/_blog/libp2p-hole-punching.md
+1 -1
View File
@@ -92,7 +92,7 @@ Here is a sequence diagram of the whole process. Don't worry, we will go into ea
### 1.1 Determine whether one is dialable (AutoNAT)
In step 1 of phase 1 a computer determines whether it is dialable, in other words it determines whether computers outside of its own network can connect to it. The main protocol involved here is the [libp2p *AutoNAT* protocol](https://github.com/libp2p/specs/blob/master/autonat/README.md). (Worth drawing the connection to the corresponding ICE protocol [STUN](https://datatracker.ietf.org/doc/html/rfc5389) here.)
In step 1 of phase 1 a node determines whether it is dialable, in other words it determines whether computers outside of its own network can connect to it. The main protocol involved here is the [libp2p *AutoNAT* protocol](https://github.com/libp2p/specs/blob/master/autonat/README.md). (Worth drawing the connection to the corresponding ICE protocol [STUN](https://datatracker.ietf.org/doc/html/rfc5389) here.)
In our case computer *B* from above determines whether it is dialable. It does so with the help of random public nodes, e.g. bootnodes of its peer-to-peer network.