Abstract
Peer-to-peer (P2P) file sharing systems are responsible for a significant part of the Internettraffic today. File sharing is perhaps the most popular application among P2P applications. Incomparison with traditional Client/Server file distribution, P2P file sharing has some advantages,namely, scalability, bandwidth and others. In this paper we study the minimum distribution timefor getting the entire file by all of the users in the system, who need this file. This parameter isclosely associated with the mentioned bandwidth. The expression for the minimum distributiontime uses fluid-flow arguments and includes such terms as the file size, the upload rates of theseeds and the upload and download rates of the leechers. Using numerical examples and theexpression for the minimum distribution time, we show the efficiency of P2P file sharing. Weconsider the system behaviour, when there are two types of leechers in the system. These typesdiffer from each other by their upload bandwidths.
Highlights
The classical methods of resource distribution are based on the paradigm Client/Server
Peer-to-peer (P2P) file sharing is an alternative to the classical Client/Server file distribution and allows to amplify the uploading capacity of the receiving users to aid in the process of the file distribution [1]
Today P2P file sharing is an important application in the Internet
Summary
The classical methods of resource distribution are based on the paradigm Client/Server. A set of servers distributes a file to receiving users. The servers and the servers’ bandwidth can be bottlenecks in the process of the file distribution, when the file size and the number of receiving nodes become large. Peer-to-peer (P2P) file sharing is an alternative to the classical Client/Server file distribution and allows to amplify the uploading capacity of the receiving users to aid in the process of the file distribution [1]. In the expression we use terms of the basic parameters of a P2P file sharing system, precisely, the file size, the number of servers, the number of receiving peers, and the upload and download bandwidths of all the peers, who participate.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: RUDN Journal of Mathematics, Information Sciences and Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
