City Research Online

Abstract

We present a model of bandwidth allocation in a stylized peer-to-peer file sharing network with s peers (sharers) who share files and download from each other and f peers (freeriders) who download from sharers but do not contribute files. Assuming that upload bandwidth is scarcer than download bandwidth and efficient allocation, we compute the expected bandwidth obtained by each peer. We show that (i) while the exact formula is complex, s/(s + f) is a good approximation and (ii) sharers (freeriders) obtain bandwidth larger (smaller) than s/(s + f). The paper constitutes a first step towards a general analytical foundation for scarce resource allocation in peer-to-peer file sharing networks.

Publication Type:	Article
Additional Information:	© 2008, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/
Publisher Keywords:	Peer-to-peer; Network formation; Resource allocation; Congestion
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments:	Bayes Business School > Management
SWORD Depositor:	Symplectic Administrator

Export

Downloads