Article Preview
TopP2P internet data transfer is a longstanding goal of the research community, and our protocol uses in part some existing ideas.
The performance of P2P protocols largely depends on the characteristics of underlying physical network or query distribution for the efficient query response time and minimum resource consumption (Heo et al., 2021; Shin et al., 2020; Sim et al., 2021; Tushar et al., 2021). Unstructured P2P networks, which do not rely on a global index, have traditionally used flooding methods and random walk schemes to distribute object queries in the network. However, these approaches present disadvantages in terms of network overhead and scalability (Khatibi & Sharifi, 2021).
Meanwhile, structured P2P networks have emerged as an organized alternative to unstructured P2P networks. These networks utilize data structures such as Distributed Hash Tables (DHTs) to organize resources coherently and facilitate efficient searches (Augustine et al., 2022; Yu et al., 2020).
Regarding existing protocols, well-established systems such as GNUTELLA (Gopal et al., 2016), OneSwarm (Isdal et al., 2010), Tor (Feigenbaum et al., 2012) and Bittorrent (Torres-Cruz et al., 2017). continue to play a prominent role in file sharing on the Internet. However, these protocols face persistent challenges in terms of performance and security, such as efficient query management in highly dynamic environments and mitigating security and privacy risks.