Secure Peer To Peer File Sharing Using Torrent Protocol — Complete Documentation & Simulation

Overview & System Context

Secure Peer To Peer File Sharing Using Torrent Protocol: Comprehensive Web-Sourced Technical Investigation Exhaustive Research Dossier · Pure Web-Scraped Content: ~9535 Words · Real Software Screenshots: 3 1. Executive Overview & Technical Background File sharing is the practice of distributing or providing access to digital media, such as computer programs, multimedia (audio, images and video), documents or electronic books. Common methods of storage, transmission and dispersion include removable media, centralized servers on computer networks, Internet-based hyperlinked documents, and the use of distributed peer-to-peer networking. File sharing technologies, such as BitTorrent, are integral to modern media piracy, as well as the sharing of scientific data and other free content.

Files were first exchanged on removable media. Computers were able to access remote files using filesystem mounting, bulletin board systems (1978), Usenet (1979), and FTP servers (1970's). Internet Relay Chat (1988) and Hotline (1997) enabled users to communicate remotely through chat and to exchange files. The mp3 encoding, which was standardized in 1991 and substantially reduced the size of audio files, grew to widespread use in the late 1990s. In 1998, MP3.com and Audiogalaxy were established, the Digital Millennium Copyright Act was unanimously passed, and the first mp3 player devices were launched. In June 1999, Napster was released as an unstructured centralized peer-to-peer system, requiring a central server for indexing and peer discovery. It is generally credited as being the first peer-to-peer file sharing system. In December 1999, Napster was sued by several recording companies and lost in A&M Records, Inc. v. Napster, Inc.. In the case of Napster, it has been ruled that an online service provider could not use the "transitory network transmission" safe harbor in the DMCA if they had control of the network with a server. Gnutella, eDonkey2000, and Freenet were released in 2000, as MP3.com and Napster were facing litigation. Gnutella, released in March, was the first decentralized file-sharing network. In the Gnutella network, all connecting software was considered equal, and therefore the network had no central point of failure.

In July, Freenet was released and became the first anonymity network. In September the eDonkey2000 client and server software was released. In March 2001, Kazaa was released. Its FastTrack network was distributed, though, unlike Gnutella, it assigned more traffic to 'supernodes' to increase routing efficiency. The network was proprietary and encrypted, and the Kazaa team made substantial efforts to keep other clients such as Morpheus off of the FastTrack network. In October 2001, the MPAA and the RIAA filed a lawsuit against the developers of Kazaa, Morpheus and Grokster that would lead to the US Supreme Court's MGM Studios, Inc. v. Grokster, Ltd. decision in 2005. Shortly after its loss in court, Napster was shut down to comply with a court order. This drove users to other P2P applications and file sharing continued its growth. The Audiogalaxy Satellite client grew in popularity, and the LimeWire client and BitTorrent protocol were released. Until its decline in 2004, Kazaa was the most popular file-sharing program despite bundled malware and legal battles in the Netherlands, Australia, and the United States. In 2002, a Tokyo district court ruling shut down File Rogue, and the Recording Industry Association of America (RIAA) filed a lawsuit that effectively shut down Audiogalaxy.

From 2002 through 2003, a number of BitTorrent services were established, including Suprnova.org, isoHunt, TorrentSpy, and The Pirate Bay. In September 2003, the RIAA began filing lawsuits against users of P2P file sharing networks such as Kazaa. As a result of such lawsuits, many universities added file sharing regulations in their school administrative codes (though some students managed to circumvent them during after school hours). Also in 2003, the MPAA started to take action against BitTorrent sites, leading to the shutdown of Torrentse and Sharelive in July 2003. With the shutdown of eDonkey in 2005, eMule became the dominant client of the eDonkey network. In 2006, police raids took down the Razorback2 eDonkey server and temporarily took down The Pirate Bay. "The File Sharing Act was launched by Chairman Towns in 2009, this act prohibited the use of applications that allowed individuals to share federal information amongst one another. On the other hand, only specific file sharing applications were made available to federal computers" (the United States.Congress.House).

In 2009, the Pirate Bay trial ended in a guilty verdict for the primary founders of the tracker. The decision was appealed, leading to a second guilty verdict in November 2010. In October 2010, Limewire was forced to shut down following a court order in Arista Records LLC v. Lime Group LLC but the Gnutella network remains active through open source clients like FrostWire and gtk-gnutella. Furthermore, multi-protocol file-sharing software such as MLDonkey and Shareaza adapted to support all the major file-sharing protocols, so users no longer had to install and configure multiple file-sharing programs. On January 19, 2012, the United States Department of Justice shut down the popular domain of Megaupload (established 2005).

The file sharing site has claimed to have over 50,000,000 people a day. Kim Dotcom (formerly Kim Schmitz) was arrested with three associates in New Zealand on January 20, 2012, and is awaiting extradition. The case involving the downfall of the world's largest and most popular file sharing site was not well received, with hacker group Anonymous bringing down several sites associated with the take-down. In the following days, other file sharing sites began to cease services; FileSonic blocked public downloads on January 22, with Fileserve following suit on January 23. In 2021 a European Citizens' Initiative "Freedom to Share" started collecting signatures in order to get the European Commission to discuss (and eventually make rules) on this subject, which is controversial.

Cloud-based file syncing and sharing services implement automated file transfers by updating files from a dedicated sharing directory on each user's networked devices. Files placed in this folder also are typically accessible through a website and mobile app and can be easily shared with other users for viewing or collaboration. Such services have become popular via consumer-oriented file hosting services such as Dropbox and Google Drive. With the rising need of sharing big files online easily, new open access sharing platforms have appeared, adding even more services to their core business (cloud storage, multi-device synchronization, online collaboration), such as ShareFile, Tresorit, WeTransfer, Smash or Hightail.

Figure 1: What Is BitTorrent File Sharing "File-sharing proponents commonly argue that file-sharing democratizes music consumption by 'levelling the playing field' for new/small artists relative to established/popular artists, by allowing artists to have their work heard by a wider audience, lessening the advantage held by established/popular artists in terms of promotional and other support. My results suggest that the opposite is happening, which is consistent with evidence on file-sharing behaviour." Billboard cautioned that this research looked only at the pre-release period and not continuous file sharing following a release date. "The problem in believing piracy helps sales is deciding where to draw the line between legal and illegal ... Implicit in the study is the fact that both buyers and sellers are required in order for pre-release file sharing to have a positive impact on album sales. Without iTunes, Amazon, and Best Buy, file-sharers would be just file sharers rather than purchasers. If you carry out the 'file-sharing should be legal' argument to its logical conclusion, today's retailers will be tomorrow's file-sharing services that integrate with their respective cloud storage services." File sharing raises copyright issues and has led to many lawsuits. In the United States, some of these lawsuits have even reached the Supreme Court. For example, in MGM v. Grokster, the Supreme Court ruled that the creators of P2P networks can be held liable if their software is marketed as a tool for copyright infringement. On the other hand, not all file sharing is illegal. Content in the public domain can be freely shared. Even works covered by copyright can be shared under certain circumstances. For example, some artists, publishers, and record labels grant the public a license for unlimited distribution of certain works, sometimes with conditions, and they advocate free content and file sharing as a promotional tool.

Comparison of file-sharing applications File-hosting service File sharing news sites Graduated response Love for Sale (Bilal album), an unreleased but infamously pirated album by Bilal Missionary Church of Kopimism Open Music Model Publius (publishing system) Torrent poisoning Trade group efforts against file sharing Warez Peer-to-peer (P2P) computing or networking is a distributed computing or networking architecture in which participants share part of their own resources, such as processing power, storage, or network capacity. These resources are made directly available to other peers without reliance on intermediary entities, and participants act as both resource provider and resource requesters.

Figure 2: What is BitTorrent (BTT) about? – Changelly’s Coin Review In contrast, the traditional client–server model assigns resource provider and requester roles to different participants, with centralized servers acting as providers and clients acting as requesters. While P2P systems had previously been used in many application domains, the architecture was popularized by the Internet file sharing system Napster, originally released in 1999. P2P is used in many protocols such as BitTorrent file sharing over the Internet and in smartphone ad hoc networks and personal networks like Miracast displaying and Bluetooth radio. The concept has inspired new structures and philosophies in many areas of human interaction. In such social contexts, peer-to-peer as a meme refers to the egalitarian social networking that has emerged throughout society, enabled by Internet technologies in general.

While P2P systems had previously been used in many application domains, the concept was popularized by file sharing systems such as the music-sharing application Napster. The peer-to-peer movement allowed millions of Internet users to connect "directly, forming groups and collaborating to become user-created search engines, virtual supercomputers, and filesystems". The basic concept of peer-to-peer computing was envisioned in earlier software systems and networking discussions, reaching back to principles stated in the first Request for Comments, RFC 1. Tim Berners-Lee's vision for the World Wide Web was close to a P2P network in that it assumed each user of the web would be an active editor and contributor, creating and linking content to form an interlinked "web" of links. The early Internet was more open than the present day, where two machines connected to the Internet could send packets to each other without firewalls and other security measures. This contrasts with the broadcasting-like structure of the web as it has developed over the years. As a precursor to the Internet, ARPANET was a successful peer-to-peer network where "every participating node could request and serve content". However, ARPANET was not self-organized, and it could not "provide any means for context or content-based routing beyond 'simple' address-based routing." Therefore, Usenet, a distributed messaging system that is often described as an early peer-to-peer architecture, was established. It was developed in 1979 as a system that enforces a decentralized model of control. The basic model is a client–server model from the user or client perspective that offers a self-organizing approach to newsgroup servers. However, news servers communicate with one another as peers to propagate Usenet news articles over the entire group of network servers. The same consideration applies to SMTP email in the sense that the core email-relaying network of mail transfer agents has a peer-to-peer character, while the periphery of Email clients and their direct connections is strictly a client-server relationship. In May 1999, with millions more people on the Internet, Shawn Fanning introduced the music and file-sharing application called Napster. Napster was the beginning of peer-to-peer networks, as we know them today, where "participating users establish a virtual network, entirely independent from the physical network, without having to obey any administrative authorities or restrictions".

Unstructured peer-to-peer networks do not impose a particular structure on the overlay network by design, but rather are formed by nodes that randomly form connections to each other. (Gnutella, Gossip, and Kazaa are examples of unstructured P2P protocols). Because there is no structure globally imposed upon them, unstructured networks are easy to build and allow for localized optimizations to different regions of the overlay. Also, because the role of all peers in the network is the same, unstructured networks are highly robust in the face of high rates of "churn"—that is, when large numbers of peers are frequently joining and leaving the network. However, the primary limitations of unstructured networks also arise from this lack of structure. In particular, when a peer wants to find a desired piece of data in the network, the search query must be flooded through the network to find as many peers as possible that share the data. Flooding causes a very high amount of signaling traffic in the network, uses more CPU/memory (by requiring every peer to process all search queries), and does not ensure that search queries will always be resolved. Furthermore, since there is no correlation between a peer and the content managed by it, there is no guarantee that flooding will find a peer that has the desired data. Popular content is likely to be available at several peers and any peer searching for it is likely to find the same thing. But if a peer is looking for rare data shared by only a few other peers, then it is highly unlikely that the search will be successful.

In structured peer-to-peer networks the overlay is organized into a specific topology, and the protocol ensures that any node can efficiently search the network for a file/resource, even if the resource is extremely rare. The most common type of structured P2P networks implement a distributed hash table (DHT), in which a variant of consistent hashing is used to assign ownership of each file to a particular peer. This enables peers to search for resources on the network using a hash table: that is, (key, value) pairs are stored in the DHT, and any participating node can efficiently retrieve the value associated with a given key.

Figure 3: BitTorrent Protocol | PPT However, in order to route traffic efficiently through the network, nodes in a structured overlay must maintain lists of neighbors that satisfy specific criteria. This makes them less robust in networks with a high rate of churn (i.e. with large numbers of nodes frequently joining and leaving the network). More recent evaluation of P2P resource discovery solutions under real workloads have pointed out several issues in DHT-based solutions such as high cost of advertising/discovering resources and static and dynamic load imbalance. Notable distributed networks that use DHTs include Tixati, an alternative to BitTorrent's distributed tracker, the Kad network, the Storm botnet, and the YaCy. Some prominent research projects include the Chord project, Kademlia, PAST storage utility, P-Grid, a self-organized and emerging overlay network, and CoopNet content distribution system. DHT-based networks have also been widely utilized for accomplishing efficient resource discovery for grid computing systems, as it aids in resource management and scheduling of applications.

The prevalence of malware varies between different peer-to-peer protocols. Studies analyzing the spread of malware on P2P networks found, for example, that 63% of the answered download requests on the gnutella network contained some form of malware, whereas only 3% of the content on OpenFT contained malware. In both cases, the top three most common types of malware accounted for the large majority of cases (99% in gnutella, and 65% in OpenFT). Another study analyzing traffic on the Kazaa network found that 15% of the 500,000 file sample taken were infected by one or more of the 365 different computer viruses that were tested for. Corrupted data can also be distributed on P2P networks by modifying files that are already being shared on the network. For example, on the FastTrack network, the RIAA managed to introduce faked chunks into downloads and downloaded files (mostly MP3 files). Files infected with the RIAA virus were unusable afterwards and contained malicious code. The RIAA is also known to have uploaded fake music and movies to P2P networks in order to deter illegal file sharing. Consequently, the P2P networks of today have seen an enormous increase of their security and file verification mechanisms. Modern hashing, chunk verification and different encryption methods have made most networks resistant to almost any type of attack, even when major parts of the respective network have been replaced by faked or nonfunctional hosts.

The decentralized nature of P2P networks increases robustness because it removes the single point of failure that can be inherent in a client–server based system. As nodes arrive and demand on the system increases, the total capacity of the system also increases, and the likelihood of failure decreases. If one peer on the network fails to function properly, the whole network is not compromised or damaged. In contrast, in a typical client–server architecture, clients share only their demands with the system, but not their resources. In this case, as more clients join the system, fewer resources are available to serve each client, and if the central server fails, the entire network is taken down.

There are both advantages and disadvantages in P2P networks related to the topic of data backup, recovery, and availability. In a centralized network, the system administrators are the only forces controlling the availability of files being shared. If the administrators decide to no longer distribute a file, they simply have to remove it from their servers, and it will no longer be available to users. Along with leaving the users powerless in deciding what is distributed throughout the community, this makes the entire system vulnerable to threats and requests from the government and other large forces. For example, YouTube has been pressured by the RIAA, MPAA, and entertainment industry to filter out copyrighted content. Although server-client networks are able to monitor and manage content availability, they can have more stability in the availability of the content they choose to host. A client should not have trouble accessing obscure content that is being shared on a stable centralized network. P2P networks, however, are more unreliable in sharing unpopular files because sharing files in a P2P network requires that at least one node in the network has the requested data, and that node must be able to connect to the node requesting the data. This requirement is occasionally hard to meet because users may delete or stop sharing data at any point. In a P2P network, the community of users is entirely responsible for deciding which content is available. Unpopular files eventually disappear and become unavailable as fewer people share them. Popular files, however, are highly and easily distributed. Popular files on a P2P network are more stable and available than files on central networks. In a centralized network, a simple loss of connection between the server and clients can cause a failure, but in P2P networks, the connections between every node must be lost to cause a data-sharing failure. In a centralized system, the administrators are responsible for all data recovery and backups, while in P2P systems, each node requires its backup system. Because of the lack of central authority in P2P networks, forces such as the recording industry, RIAA, MPAA, and the government are unable to delete or stop the sharing of content on P2P systems.

Cooperation among a community of participants is key to the continued success of P2P systems aimed at casual human users; these reach their full potential only when large numbers of nodes contribute resources. But in current practice, P2P networks often contain large numbers of users who utilize resources shared by other nodes, but who do not share anything themselves (often referred to as the "freeloader problem"). Freeloading can have a profound impact on the network and in some cases can cause the community to collapse. In these types of networks "users have natural disincentives to cooperate because cooperation consumes their own resources and may degrade their own performance". Studying the social attributes of P2P networks is challenging due to large populations of turnover, asymmetry of interest and zero-cost identity. A variety of incentive mechanisms have been implemented to encourage or even force nodes to contribute resources. Some researchers have explored the benefits of enabling virtual communities to self-organize and introduce incentives for resource sharing and cooperation, arguing that the social aspect missing from today's P2P systems should be seen both as a goal and a means for self-organized virtual communities to be built and fostered. Ongoing research efforts for designing effective incentive mechanisms in P2P systems, based on principles from game theory, are beginning to take on a more psychological and information-processing direction.

The InterPlanetary File System (IPFS) is a protocol, hypermedia and file sharing peer-to-peer network for sharing data using a distributed hash table to store provider information. By using content addressing, IPFS uniquely identifies each file in a global namespace that connects IPFS hosts, creating a distributed system of file storage and sharing. IPFS allows users to host and receive content in a manner similar to BitTorrent. As opposed to a centrally located server, IPFS is built around a decentralized system of user-operators who hold a portion of the overall data. Any user in the network can serve a file by its content address, and other peers in the network can find and request that content from any node who has it using a distributed hash table (DHT). In contrast to traditional location-based protocols like HTTP and HTTPS, IPFS uses content-based addressing to provide a decentralized alternative for distributing the World Wide Web.

Content-addressed file storage: Each file is uniquely identified based on its content hash, ensuring data integrity and facilitating efficient retrieval. Peer-to-peer architecture: A distributed network of nodes facilitates direct file sharing without the need for centralized servers. Versioned file system: Supports file versioning and allows users to track changes over time. Interoperability with distributed applications: IPFS integrates with decentralized applications (dApps), offering a storage layer for blockchain and Web3 ecosystems. IPFS gateways allow browsers and tools that lack native IPFS support to access IPFS content over HTTP. Users may choose not to install an IPFS client on their device and instead use a public gateway. A list of these gateways is maintained on the IPFS GitHub page.

Filecoin is a cryptocurrency used to implement an IPFS-based cooperative storage cloud, also authored by Protocol Labs. The shadow libraries Anna's Archive and Library Genesis host books via IPFS. The Brave browser added support in 2021, however support for local nodes and the ipfs:// scheme was removed in 2024 due to low usage and lack of support. IPFS is used as a storage layer for some decentralized applications and Web3 projects, including NFT platforms and blockchain-based services, because content addressing and distributed storage can improve data persistence and reduce reliance on single centralized servers.

Content-addressable storage Dat (software) Distributed file system Hyphanet GNUnet I2P ZeroNet Protocol encryption ( PE ), message stream encryption ( MSE ) or protocol header encrypt ( PHE ) [ a ] are related features of some peer-to-peer file-sharing clients , including BitTorrent clients . They attempt to enhance privacy and confidentiality. In addition, they attempt to make traffic harder to identify by third parties including Internet service providers (ISPs). However, encryption will not protect one from DMCA notices from sharing illegal content, as one is still uploading material and the monitoring firms can merely connect to the swarm .

MSE/PE is implemented in BitComet , BitTornado, Deluge , Flashget , KTorrent , libtorrent (used by various BitTorrent clients, including qBittorrent ), Mainline , µTorrent , qBittorrent , rTorrent , Transmission , Tixati and Vuze . PHE was implemented in old versions of BitComet. Similar protocol obfuscation is supported in up-to-date versions of some other (non-BitTorrent) systems including eMule . [ 1 ] As of January 2005, BitTorrent traffic made up more than a third of total residential internet traffic, [ 2 ] although this dropped to less than 20% as of 2009. [ 3 ] Some ISPs deal with this traffic by increasing their capacity whilst others use specialised systems to slow peer-to-peer traffic to cut costs. Obfuscation and encryption make traffic harder to detect and therefore harder to throttle. These systems were designed initially to provide anonymity or confidentiality , but became required in countries where ISPs were granted the power to throttle BitTorrent users and even ban those they believed were guilty of illegal file sharing.

Protocol header encryption (PHE) was conceived by RnySmile and first implemented in BitComet version 0.60 on 8 September 2005. Some software like IPP2P claims BitComet traffic is detectable even with PHE. [ 4 ] PHE is detectable because only part of the stream is encrypted. Since there are no open specifications to this protocol implementation, the only possibility to support it in other clients would have been via reverse engineering .

In late January 2006 the developers of Vuze (then known as Azureus) decided to design and simultaneously implement a new, open protocol obfuscation method, called message stream encryption (MSE). It was included in Azureus CVS snapshot 2307-B29 on 19 January 2006. [ 5 ] This first draft was heavily criticized since it lacked several key features. After negotiations between different BitTorrent developers, a new proposal was written and then implemented into the Azureus and µTorrent betas within days. In µTorrent, the new protocol was called protocol encryption (PE).

2. System Architecture & Core Working Principles The BitComet PHE method used in versions 0.60 to 0.62 is neither published, nor is it compatible with MSE/PE. MSE/PE uses key exchange combined with the infohash of the torrent to establish an RC4 encryption key. The key exchange helps to minimize the risk of passive listeners, and the infohash helps avoid man-in-the-middle attacks . RC4 is chosen for its speed. The first kibibyte (1024 bytes) of the output is discarded to prevent the Fluhrer, Mantin and Shamir attack .

The specification allows the users to choose between encrypting the headers only or the full connection. Encrypting the full connection provides more obfuscation but uses more CPU time. To ensure compatibility with other clients that don't support this specification, users may also choose whether unencrypted incoming or outgoing connections are still allowed.

Supported clients propagate the fact that they have MSE/PE enabled through PEX and DHT . The estimated strength of the encryption corresponds to about 60–80 bits for common symmetrical ciphers. [ 22 ] Cryptographically, this effective key length is quite low, but appropriate in that the protocol was not designed as a secure transport protocol but rather as a fast and efficient obfuscation method. AES was proposed as the encryption method, but not adopted because it consumed too much CPU time. The required Diffie–Hellman keys to achieve a security equal to AES would have been much bigger or require elliptic curve cryptography , making the handshake more expensive in terms of used CPU time.

Analysis of the BitTorrent protocol encryption (a.k.a. MSE) has shown that statistical measurements of packet sizes and packet directions of the first 100 packets in a TCP session can be used to identify the obfuscated protocol with over 96% accuracy. [ 23 ] The Sandvine application uses a different approach to disrupt BitTorrent traffic by making seeding impossible. Sandvine intercepts peer-to-tracker communication to identify peers based on the IP address and port numbers in the peer list returned from the tracker. When Sandvine later sees connections to peers in the intercepted peer lists, it may (according to policy) break these connections by sending counterfeit TCP resets. [ 24 ] Various solutions exist to protect against Sandvine's attack including encrypting both peer-to-tracker and peer-to-peer communication, using Microsoft's Teredo so that TCP connections are tunneled within UDP packets, filtering TCP resets before they reach the TCP layer in the end-host, or switching entirely from a TCP-based transport to a UDP-based transport. Each solution has its trade-offs. Filtering out TCP resets typically requires kernel access, and the participation of the remote peer since Sandvine sends the reset packet to the local and remote peers.

Bram Cohen , the inventor of BitTorrent , opposed adding encryption to the BitTorrent protocol. Cohen stated he was worried that encryption could create incompatibility between clients. He also stressed the point that the majority of ISPs don't block the torrent protocol. In 2006 Cohen wrote "I rather suspect that some developer has gotten rate limited by his ISP, and is more interested in trying to hack around his ISP's limitations than in the performance of the internet as a whole". [ 25 ] Many BitTorrent community users responded strongly against Cohen's accusations. [ 26 ] Cohen later added encrypted connections to his Mainline client [ 27 ] with the ability to receive but not originate them. [ citation needed ] Notably, when µTorrent was purchased by BitTorrent, Inc. and then became the next mainline release, the ability to originate encrypted connections was retained, but it became turned off by default. In an interview in 2007, Cohen stated "The so-called 'encryption' of BitTorrent traffic isn't really encryption, it's obfuscation. It provides no anonymity whatsoever, and only temporarily evades traffic shaping." [ 28 ] Peer-to-peer (P2P) file sharing has evolved significantly since its early adoption in platforms like Napster and Gnutella, offering a decentralized alternative to traditional client-server architectures. Despite their scalability and bandwidth efficiency, P2P systems often face challenges such as network congestion, peer misbehavior, and lack of fairness in data distribution. To address these issues, this research presents a python-based BitTorrent-like file sharing system that implements dynamic peer selection through choking and optimistic unchoking mechanisms, secure handshake protocols, and multithreaded socket communication for efficient and resilient data exchange. The system ensures secure remote deployment using SSH and incorporates a detailed logging mechanism to monitor peer interactions. Experimental results demonstrate improved download speeds, balanced bandwidth allocation, and enhanced fault tolerance. The findings validate the effectiveness of the proposed Framework as a robust and scalable solution for decentralized file sharing.

Introduction & Background Peer-to-peer (P2P) file sharing is a decentralized method of distributing data by having peers share resources like storage and bandwidth. Early systems like Napster and Gnutella laid the foundation but suffered from limitations such as low bandwidth efficiency and poor fault tolerance. Modern P2P systems, especially BitTorrent, offer improved performance by splitting files into pieces and enabling parallel downloads, leveraging tit-for-tat strategies to encourage participation and fairness. Challenges in P2P Systems While advantageous over traditional client-server models in terms of scalability and fault tolerance, P2P systems face challenges: Free-riding behavior Fair bandwidth allocation Malicious nodes High churn rates Lack of centralized integrity and reliability controls BitTorrent & System Inspiration BitTorrent revolutionized P2P sharing with: Piece-wise parallel downloading Tit-for-tat reciprocity Choking and optimistic unchoking to manage peer performance These principles form the core of the proposed system , which is implemented in Python using socket programming and multithreading to simulate decentralized communication. Literature Survey BitTorrent Protocol (Cohen) : Incentive-based strategies that reduce free-riding. Overlay Architectures (Lua et al.) : Structured vs unstructured networks. Churn Management (Rhea et al.) : Stabilization in DHTs. Chord Protocol (Stoica et al.) : Efficient distributed lookup using consistent hashing. P2P Streaming (Xu et al.) : Real-time buffering and scheduling insights. BitTorrent Modeling (Qiu & Srikant) : Effects of peer capacity on performance. Adaptive Choking (Zhang et al.) : Performance-based peer selection.

Economic Models (Li, Guo) : Reputation and virtual incentives. Sybil Attack Mitigation (Levine et al.) : Importance of authentication and trust. Proposed Framework 1. Flow Diagram Overview Peers follow a loop: Handshake → Request → Receive → Check completion → Repeat → Assemble full file. 2. System Design Phases Knowledge Gathering : Deep understanding of BitTorrent protocol behavior. Architecture : Fully decentralized; all peers are equal. Peer Discovery : Via config or broadcast; handshake initiates connection. Chunking and Transfer : Files split into pieces, exchanged with integrity checks. Choking/Unchoking : Top peers are prioritized; one random peer is optimistically unchoked periodically. Logging : Real-time logging of all events for monitoring and debugging. Remote Execution : Peers are deployed on remote machines using SSH to simulate real-world conditions. Fault Tolerance : Resumes interrupted downloads; safe shutdown and cleanup.

Evaluation & Results 1. Download Completion Time vs Peers Performance improves as more peers are optimally unchoked. Dynamic choking strategy leads to faster file completion under load. 2. Bandwidth Utilization High concurrency leads to bandwidth peaks, showing efficient multithreading. Active peers show better performance, especially during optimistic unchoking. 3. Peer Fairness Index (PFI) Measures upload/download balance; value near 1.0 is ideal. Tit-for-tat and optimistic unchoking ensure fairness and deter free-riding. Key Contributions A modular, secure Python-based BitTorrent-like file sharing system. Improved fairness, efficiency, and fault tolerance. Logging and SSH-based deployment for real-world simulation. Focus on scalability and resilience to common P2P attacks.

Peer-to-peer (P2P) file sharing is a decentralized method of distributing data by having peers share resources like storage and bandwidth. Early systems like Napster and Gnutella laid the foundation but suffered from limitations such as low bandwidth efficiency and poor fault tolerance. Modern P2P systems, especially BitTorrent, offer improved performance by splitting files into pieces and enabling parallel downloads, leveraging tit-for-tat strategies to encourage participation and fairness.

While advantageous over traditional client-server models in terms of scalability and fault tolerance, P2P systems face challenges: These principles form the core of the proposed system , which is implemented in Python using socket programming and multithreading to simulate decentralized communication.

Chord Protocol (Stoica et al.) : Efficient distributed lookup using consistent hashing. Choking/Unchoking : Top peers are prioritized; one random peer is optimistically unchoked periodically. Remote Execution : Peers are deployed on remote machines using SSH to simulate real-world conditions. The proposed peer-to-peer (P2P) file sharing system, inspired by the BitTorrent protocol, successfully addresses the fundamental challenges associated with decentralized data distributionnamely fairness, bandwidth optimization, and robustness against peer misbehavior. By leveraging python-based multithreading, socket communication, and dynamic peer selection strategies, the system ensures efficient and reliable transmission of file chunks across a distributed network of peers. The implementation of handshake authentication, piece-wise exchange, and choking/unchoking mechanisms collectively contributes to the system’s stability and equitable resource allocation, validating its relevance as a solution to the scalability and fairness concerns outlined in the initial problem statement. The evaluation metrics, including download completion time, bandwidth utilization, and peer fairness index, confirm that the framework not only meets but exceeds performance expectations in distributed environments. The system maintains high throughput, ensures balanced participation among peers, and provides resilience in the presence of network volatility. Additionally, the real-time logging and monitoring capabilities enable transparent tracking of operations, making the system auditable and maintainable for extended use. These results collectively demonstrate that the framework is not only technically sound but also practical for real-world deployment in large-scale file distribution scenarios. Looking forward, the current system can be further enhanced by integrating advanced encryption protocols such as AES for end-to-end security and blockchain-based trust models to prevent Sybil and spoofing attacks. Additionally, the incorporation of AI-driven peer selection algorithms and bandwidth prediction models could further optimize resource allocation. Expanding the system with a user-friendly graphical interface and mobile support would also improve accessibility and adoption. These future directions aim to evolve the framework into a scalable, intelligent, and secure platform suitable for next-generation decentralized content delivery networks (CDNs) and edge-based data systems.

[1] Cohen, B. (2003). Incentives build robustness in BitTorrent. In Workshop on Economics of Peer-to-Peer Systems. [2] Lua, E. K., Crowcroft, J., Pias, M., Sharma, R., & Lim, S. (2005). A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys & Tutorials, 7(1), 72-93. [3] Rhea, S. C., Geels, D., Roscoe, T., & Kubiatowicz, J. (2004). Handling churn in a DHT. In USENIX Annual Technical Conference. [4] Stoica, I., Morris, R., Karger, D., Kaashoek, M.

F., & Balakrishnan, H. (2001). Chord: A scalable peer-to-peer lookup protocol for internet applications. ACM SIGCOMM Computer Communication Review, 31(4), 149-160. [5] Xu, M., Liu, J., & Liu, J. (2011). A survey of P2P streaming applications. Future Internet, 3(4), 329-366. [6] Qiu, D., & Srikant, R. (2004). Modeling and performance analysis of BitTorrent-like peer-to-peer networks. ACM SIGCOMM Computer Communication Review, 34(4), 367-378. [7] Zhang, H., Xie, Distributed Systems, 25(3), 579-589. [8] Li, X., Li, B., & Lau, W. C. (2005). A BitTorrent-like P2P system with incentive mechanisms. IEEE International Conference on Communications (ICC). [9] Guo, L., Chen, S., & Deng, L. (2006).

Shields, C., & Margolin, N. B. (2006). A survey of solutions to the Sybil attack. ACM Computer Surveys, 38(4), 1-28. Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. BitTorrent is a peer-to-peer (P2P) file-sharing protocol designed by Bram Cohen in 2001. Its key innovation is distributing file-sharing load across multiple users (peers) instead of relying on a single central server. This makes it ideal for sharing large files (e.g., Linux ISOs, video games) because bandwidth costs are decentralized, and download speeds scale with the number of users.

Traditional file sharing (e.g., HTTP/FTP) uses a client-server model: one server hosts the file, and all users download from it. This leads to: The process starts with a .torrent file. When you open it in a BitTorrent client (e.g., qBittorrent, Transmission), the client reads the metadata to learn: The client connects to the tracker(s) listed in the torrent file and sends an announce request . This request includes: The client connects to peers from the trackerâIIs list and begins downloading pieces of the file. To maximize efficiency: Once the client has downloaded all pieces, it becomes a seed and continues uploading to leeches. Seeds keep the swarm aliveâIIwithout them, new peers canâIIt join.

Trackers are critical to BitTorrent, but most users rely on public trackers (e.g., udp://tracker.opentrackr.org:1337 ). Building your own tracker lets you: 3. Software Implementation, Frameworks & Protocols LetâIIs build a basic HTTP tracker in Python using Flask. WeâIIll handle announce requests, store peer data, and return bencoded responses.

Python is beginner-friendly, and Flask simplifies building HTTP servers. For production, you might use Node.js (faster for networking) or C (opentracker), but Python is great for learning. The tracker extracts parameters from the query string. For example: http://localhost:6969/announce?info_hash=%12%34%56 ...&peer_id=-qB4320-abcdef&port=51413&uploaded=0&downloaded=0&left=1000000&event=started BitTorrent uses bencoding to serialize data (tracker responses, torrent files). It supports four types: The bencode Python library handles encoding/decodingâIIno need to implement it from scratch! BitTorrent is more than just a file-sharing toolâIIitâIIs a masterclass in distributed systems. By learning its protocol and building a tracker, youâIIll gain skills in networking, data serialization, and peer coordination. With the resources and steps above, youâIIre ready to dive in and create your own piece of the P2P revolution.

BitTorrent is a peer-to-peer file sharing protocol designed by Bram Cohen. Visit his pages at http://www.bittorrent.com BitTorrent is designed to facilitate file transfers among multiple peers across unreliable networks. The purpose of this specification is to document version 1.0 of the BitTorrent protocol specification in detail. Bram's protocol specification page outlines the protocol in somewhat general terms, and lacks behaviorial detail in some areas. The hope is that this document will become a formal specification, written in clear, unambiguous terms, which can be used as a basis for discussion and implementation in the future.

This document is intended to be maintained and used by the BitTorrent development community. Everyone is invited to contribute to this document, with the understanding that the content here is intended to represent the current protocol, which is already deployed in a number of existing client implementations. This is not the place to suggest feature requests. For that, please go to the mailing list .

This document applies to the first version (i.e. version 1.0) of the BitTorrent protocol specification. Currently, this applies to the torrent file structure, peer wire protocol, and the Tracker HTTP/HTTPS protocol specifications. As newer revisions of each protocol are defined, they should be specified on their own separate pages, not here . In this document, a number of conventions are used in an attempt to present information in a concise and unambiguous fashion.

In order to help others find recent changes that have been made to this document, please fill out the Summary: field when you do a edit. This should contain a brief (i.e. one-line) entry for each major change that you've made to the document. Bencoding is a way to specify and organize data in a terse format. It supports the following types: byte strings, integers, lists, and dictionaries.

Byte strings are encoded as follows: : Note that there is no constant beginning delimiter, and no ending delimiter. Integers are encoded as follows: i e The initial i and trailing e are beginning and ending delimiters.

i -0 e is invalid. All encodings with a leading zero, such as i 03 e , are invalid, other than i 0 e , which of course corresponds to the integer "0". Lists are encoded as follows: l e The initial l and trailing e are beginning and ending delimiters. Lists may contain any bencoded type, including integers, strings, dictionaries, and even lists within other lists.

Dictionaries are encoded as follows: d e The initial d and trailing e are the beginning and ending delimiters. Note that the keys must be bencoded strings. The values may be any bencoded type, including integers, strings, lists, and other dictionaries. Keys must be strings and appear in sorted order (sorted as raw strings, not alphanumerics). The strings should be compared using a binary comparison, not a culture-specific "natural" comparison.

All data in a metainfo file is bencoded. The specification for bencoding is defined above. The content of a metainfo file (the file ending in ".torrent") is a bencoded dictionary, containing the keys listed below. All character string values are UTF-8 encoded. This section contains the field which are common to both mode, "single file" and "multiple file".

For the case of the single-file mode, the info dictionary contains the following structure: For the case of the multi-file mode, the info dictionary contains the following structure: The tracker is an HTTP/HTTPS service which responds to HTTP GET requests. The requests include metrics from clients that help the tracker keep overall statistics about the torrent. The response includes a peer list that helps the client participate in the torrent. The base URL consists of the "announce URL" as defined in the metainfo (.torrent) file. The parameters are then added to this URL, using standard CGI methods (i.e. a '?' after the announce URL, followed by 'param=value' sequences separated by '&').

Note that all binary data in the URL (particularly info_hash and peer_id) must be properly escaped. This means any byte not in the set 0-9, a-z, A-Z, '.', '-', '_' and '~', must be encoded using the "%nn" format, where nn is the hexadecimal value of the byte. (See RFC1738 for details.) For a 20-byte hash of \x12\x34\x56\x78\x9a\xbc\xde\xf1\x23\x45\x67\x89\xab\xcd\xef\x12\x34\x56\x78\x9a, The right encoded form is %124Vx%9A%BC%DE%F1%23Eg%89%AB%CD%EF%124Vx%9A 4. Practical Deployment, Analysis & Case Studies The tracker responds with "text/plain" document consisting of a bencoded dictionary with the following keys: As mentioned above, the list of peers is length 50 by default. If there are fewer peers in the torrent, then the list will be smaller.

Otherwise, the tracker randomly selects peers to include in the response. The tracker may choose to implement a more intelligent mechanism for peer selection when responding to a request. For instance, reporting seeds to other seeders could be avoided. Clients may send a request to the tracker more often than the specified interval, if an event occurs (i.e. stopped or completed) or if the client needs to learn about more peers. However, it is considered bad practice to "hammer" on a tracker to get multiple peers. If a client wants a large peer list in the response, then it should specify the numwant parameter.

Implementer's Note : Even 30 peers is plenty , the official client version 3 in fact only actively forms new connections if it has less than 30 peers and will refuse connections if it has 55. This value is important to performance . When a new piece has completed download, HAVE messages (see below) will need to be sent to most active peers. As a result the cost of broadcast traffic grows in direct proportion to the number of peers. Above 25, new peers are highly unlikely to increase download speed.

UI designers are strongly advised to make this obscure and hard to change as it is very rare to be useful to do so. By convention most trackers support another form of request, which queries the state of a given torrent (or all torrents) that the tracker is managing. This is referred to as the "scrape page" because it automates the otherwise tedious process of "screen scraping" the tracker's stats page.

The scrape URL is also a HTTP GET method, similar to the one described above. However the base URL is different. To derive the scrape URL use the following steps: Begin with the announce URL. Find the last '/' in it. If the text immediately following that '/' isn't 'announce' it will be taken as a sign that that tracker doesn't support the scrape convention. If it does, substitute 'scrape' for 'announce' to find the scrape page.

Note especially that entity unquoting is not to be done. This standard is documented by Bram in the BitTorrent development list archive: http://groups.yahoo.com/group/BitTorrent/message/3275 The scrape URL may be supplemented by the optional parameter info_hash , a 20-byte value as described above. This restricts the tracker's report to that particular torrent. Otherwise stats for all torrents that the tracker is managing are returned.

Software authors are strongly encouraged to use the info_hash parameter when at all possible, to reduce the load and bandwidth of the tracker. You may also specify multiple info_hash parameters to trackers that support it. While this isn't part of the official specifications it has become somewhat a defacto standard - for example: The response of this HTTP GET method is a "text/plain" or sometimes gzip compressed document consisting of a bencoded dictionary, containing the following keys: d5: files d20:....................d8: complete i 5 e10: downloaded i 50 e10: incomplete i 10 eeee Where .................... is the 20 byte info_hash and there are 5 seeders, 10 leechers, and 50 complete downloads.

Below are the response keys are being unofficially used. Since they are unofficial, they are all optional. The peer protocol facilitates the exchange of pieces as described in the ' metainfo file. Note here that the original specification also used the term "piece" when describing the peer protocol, but as a different term than "piece" in the metainfo file. For that reason, the term "block" will be used in this specification to describe the data that is exchanged between peers over the wire.

A client must maintain state information for each connection that it has with a remote peer: Note that this also implies that the client will also need to keep track of whether or not it is interested in the remote peer, and if it has the remote peer choked or unchoked. So, the real list looks something like this: A block is downloaded by the client when the client is interested in a peer, and that peer is not choking the client. A block is uploaded by a client when the client is not choking a peer, and that peer is interested in the client.

It is important for the client to keep its peers informed as to whether or not it is interested in them. This state information should be kept up-to-date with each peer even when the client is choked. This will allow peers to know if the client will begin downloading when it is unchoked (and vice-versa). Unless specified otherwise, all integers in the peer wire protocol are encoded as four byte big-endian values. This includes the length prefix on all messages that come after the handshake.

The peer wire protocol consists of an initial handshake. After that, peers communicate via an exchange of length-prefixed messages. The length-prefix is an integer as described above. The handshake is a required message and must be the first message transmitted by the client. It is (49+len(pstr)) bytes long. In version 1.0 of the BitTorrent protocol, pstrlen = 19, and pstr = "BitTorrent protocol".

The initiator of a connection is expected to transmit their handshake immediately. The recipient may wait for the initiator's handshake, if it is capable of serving multiple torrents simultaneously (torrents are uniquely identified by their info hash). However, the recipient must respond as soon as it sees the info_hash part of the handshake (the peer id will presumably be sent after the recipient sends its own handshake). The tracker's NAT-checking feature does not send the peer_id field of the handshake.

If a client receives a handshake with an info_hash that it is not currently serving, then the client must drop the connection. If the initiator of the connection receives a handshake in which the peer_id does not match the expected peer id, then the initiator is expected to drop the connection. Note that the initiator presumably received the peer information from the tracker, which includes the peer_id that was registered by the peer. The peer_id from the tracker and in the handshake are expected to match.

There are mainly two conventions how to encode client and client version information into the peer_id, Azureus-style and Shadow's-style. 5. Performance Evaluation & Extended Technical Observations Azureus-style uses the following encoding: '-', two characters for client id, four ascii digits for version number, '-', followed by random numbers.

Shadow's style uses the following encoding: one ascii alphanumeric for client identification, up to five characters for version number (padded with '-' if less than five), followed by three characters (commonly '---', but not always the case), followed by random characters. Each character in the version string represents a number from 0 to 63. '0'=0, ..., '9'=9, 'A'=10, ..., 'Z'=35, 'a'=36, ..., 'z'=61, '.'=62, '-'=63.

A full explanation by Shad0w about the encoding style (including information about existing conventions on how the three characters after the version string are used) can be found here . BitComet does something different still. Its peer_id consists of four ASCII characters 'exbc', followed by two bytes x and y, followed by random characters. The version number is x in decimal before the decimal point and y as two decimal digits after the decimal point. BitLord uses the same scheme, but adds 'LORD' after the version bytes. An unofficial patch for BitComet once replaced 'exbc' with 'FUTB'. The encoding for BitComet Peer IDs changed to Azureus-style as of BitComet version 0.59.

XBT Client has its own style too. Its peer_id consists of the three uppercase characters 'XBT' followed by three ASCII digits representing the version number. If the client is a debug build, the seventh byte is the lowercase character 'd', otherwise it is a '-'. Following that is a '-' then random digits, uppercase and lowercase letters. Example: 'XBT054d-' at the beginning would indicate a debug build of version 0.5.4.

Opera 8 previews and Opera 9.x releases use the following peer_id scheme: The first two characters are 'OP' and the next four digits equal the build number. All following characters are random lowercase hexdecimal digits. MLdonkey use the following peer_id scheme: the first characters are '-ML' followed by a dotted version then a '-' followed by randomness. e.g. '-ML2.7.2-kgjjfkd' Bits on Wheels uses the pattern '-BOWxxx-yyyyyyyyyyyy', where y is random (uppercase letters) and x depends on the version. Version 1.0.6 has xxx = A0C.

BitTyrant is an Azureus fork and simply uses 'AZ2500BT' + random bytes as peer ID in its 1.1 version. Note the missing dashes. TorrenTopia version 1.90 pretends to be or is derived from Mainline 3.4.6. Its peer ID starts with '346------'. BitSpirit has several modes for its peer ID. In one mode it reads the ID of its peer and reconnects using the first eight bytes as a basis for its own ID. Its real ID appears to use '\0\3BS' (C notation) as the first four bytes for version 3.x and '\0\2BS' for version 2.x. In all modes the ID may end in 'UDP0'. Since BitSpirit 3.6 the peer ID uses Azureus style with characters 'SP' but without trailing '-' (as FlashGet).

Rufus uses its version as decimal ASCII values for the first two bytes. The third and fourth bytes are 'RS'. What then follows is the nickname of the user and some random bytes. G3 Torrent starts its peer ID with '-G3' and appends up to 9 characters of the nickname of the user. FlashGet uses Azureus style with 'FG' but without the trailing '-'. Version 1.82.1002 still uses the version digits '0180'.

BT Next Evolution is derived from BitTornado but tries to mimic Azureus style. The result is that its peer ID starts with '-NE', continues with a 4 digit version number and then directly goes on with the three characters that describe the type of client in Shad0w's peer ID style. AllPeers takes the sha1 hash of a user dependent string and replaces the first few characters with "AP" + version string + "-".

Qvod starts its id with the four letters "QVOD" and continues with its build number in four decimal digits (currently "0054"). The remaining 12 characters are random uppercase hexdecimal digits. There appears to be a popular modified client in China that replaces the four characters in the beginning with random bytes. SpywareTerminator uses libtorrent to share its signature updates among users. It uses Azureus style with 'CS' and version digits '2500'.

Many clients are using all random numbers or 12 zeroes followed by random numbers (like older versions of Bram's client ). All of the remaining messages in the protocol take the form of . The length prefix is a four byte big-endian value. The message ID is a single decimal byte. The payload is message dependent. The keep-alive message is a message with zero bytes, specified with the length prefix set to zero. There is no message ID and no payload. Peers may close a connection if they receive no messages ( keep-alive or any other message) for a certain period of time, so a keep-alive message must be sent to maintain the connection alive if no command have been sent for a given amount of time. This amount of time is generally two minutes.

The have message is fixed length. The payload is the zero-based index of a piece that has just been successfully downloaded and verified via the hash. Implementer's Note: That is the strict definition, in reality some games may be played. In particular because peers are extremely unlikely to download pieces that they already have, a peer may choose not to advertise having a piece to a peer that already has that piece. At a minimum "HAVE suppression" will result in a 50% reduction in the number of HAVE messages, this translates to around a 25-35% reduction in protocol overhead. At the same time, it may be worthwhile to send a HAVE message to a peer that has that piece already since it will be useful in determining which piece is rare.

A malicious peer might also choose to advertise having pieces that it knows the peer will never download. Due to this attempting to model peers using this information is a bad idea . The bitfield message may only be sent immediately after the handshaking sequence is completed, and before any other messages are sent. It is optional, and need not be sent if a client has no pieces.

The bitfield message is variable length, where X is the length of the bitfield. The payload is a bitfield representing the pieces that have been successfully downloaded. The high bit in the first byte corresponds to piece index 0. Bits that are cleared indicated a missing piece, and set bits indicate a valid and available piece. Spare bits at the end are set to zero. Some clients (Deluge for example) send bitfield with missing pieces even if it has all data. Then it sends rest of pieces as have messages. They are saying this helps against ISP filtering of BitTorrent protocol. It is called lazy bitfield .

Harvested Online Documentation & Reference Sources • https://en.wikipedia.org/wiki/File%20sharing • https://en.wikipedia.org/wiki/Peer-to-peer • https://en.wikipedia.org/wiki/InterPlanetary%20File%20System • https://en.wikipedia.org/wiki/BitTorrent_protocol_encryption • https://www.ijraset.com/research-paper/peer-to-peer-file-sharing-system-using-bittorrent-protocol • https://www.codegenes.net/blog/understanding-the-bittorrent-protocol/ • https://wiki.theory.org/BitTorrentSpecification