# An ICN-Based IPFS High-Availability Architecture
## 3 Design Overview
### Enhanced Node Performance Analysis
#### 3.2.2 Distribution Performance Analysis  
The duplicate data delivery problem of the traditional IPFS network is mainly due to the introduction of the Bitswap mechanism. However, although the enhanced node integrates the resolution capability of ENRS and Bitswap, it prioritizes the resolution through ENRS and the resolution through the capability of ENRS. The enhanced node only needs to send one resolution message to ENRS, so it only needs to perform the delivery task once if the success rate of ENRS resolution can be guaranteed.  
Based on the principle of the Bitswap mechanism described above, we found that the duplicate packets generated by the Bitswap mechanism are closely related to the number of peer points on the IPFS nodes. First, we disregard the deletion signaling of Bitswap and consider that one delivery signaling is generated for each resolution signaling. The resolution signaling delivery process of IPFS nodes is first retrieved through Bitswap, and when the Bitswap mechanism fails to retrieve, it is retrieved through the DHT mechanism. Therefore, let \(L_{B}\) be the expectation of the number of duplicate packets generated by the IPFS node through the Bitswap mechanism.  
\[L_{B}=l*P_{B}+(l+1)*P_{B} \tag{17}\]  
Since the enhanced nodes are deployed by deploying IPFS applications on the routing nodes of ICN, the enhanced nodes not only act as logical peer nodes for IPFS applications, but also play the function of routing transmissions in the network. Among them, the ICN routing node supports the separation of the control plane and the data plane, so the enhanced node is able to make different routing decisions by analyzing the data packets passed by different applications. In IPFS networks, it is then possible to reduce the transmission of duplicate packets through information management tables.  
As shown in the red request path in Figure 7, the enhanced node acts as a gateway node for the IPFS client. As the logical peer node of the IPFS application, the number of duplicate packets \(L_{M}\) for the enhanced node is as follows:  
\[L_{M}=P_{E}+L_{B}*(1-P_{E}) \tag{18}\]  
From the above equation, we can see that the higher the \(P_{E}\), the smaller the packet \(L_{M}\) generated by the transmission.  
As shown in Figure 7 for the blue request path, when the enhanced node acts as a routing node, the effect on \(L_{B}\) is as follows:  
\[L_{B}=l*P_{B}*(1-\alpha)+(l+1)*P_{B} \tag{19}\]  
Figure 6: The impact of network scale on the overall resolution performance of the enhanced nodes.  
where \(\alpha\) denotes the ratio of the number of duplicate enhanced nodes that the route passes through to the peers in the list when the IPFS node resolves the request through the Bitswap mechanism. The core mechanism is the information management table maintained by the enhanced nodes to manage the IPFS request signaling data passing through the same enhanced nodes. Packets with the same source and CID over a period of time are intercepted.  
Therefore, it is a challenge to enhance the performance of the IPFS network to select node locations with high influential and high traffic volume as deployment nodes for enhanced nodes in the network. Deploying these nodes in the network as enhanced nodes can maximize the capability of information management tables and effectively improve the data delivery capability of the underlying IPFS network, thus increasing the availability of the IPFS network.