Bandwidth allocation in peer-to-peer file sharing networks
By: Albert Creus-Mir, Ramon Casadesus-Masanell, Andres Hervas-Drane
Contributors: Casadesus-Masanell, Ramon; Hervas-Drane, Andres; Harvard Business School. Division of Research
Series: Working paper / Division of Research, Harvard Business School -- 07-068; Working paper (Harvard Business School. Division of Research) -- 07-068
Publisher: Division of Research, Harvard Business School
Published: 2007
Place of publication: Boston
Language: eng
Number of pages: 22
Description: 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.
Notes: "10 April 2007"--Added t.p.

Includes bibliographical references.