5 research outputs found
Recommended from our members
Bandwidth allocation in peer-to-peer file sharing networks
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
Bandwidth Allocation in Peer-to-Peer File Sharing Networks
We present a model of bandwidth allocation in a stylized peer-to-peer
file sharing network. Given an arbitrary population of peers composed of
sharers and freeriders, where all peers interconnect to maximize their
allocated bandwidth, we derive the expected band- width obtained by
sharers and freeriders. We show that sharers are always better off than
freeriders and that the difference decreases as the size of the network
grows. This paper constitutes a first step towards providing a general
analytical foundation for resource allocation in peer-to-peer networks
Curs de c脿lcul completament integrat a Atenea
Exemple de curs completament integrat a Atenea.
Materials interactius, flux de treball, comunicaci贸 amb l鈥檃lumnat, avaluaci贸 autom脿tica, gesti贸 de notes, cursos en obertPeer Reviewe
Curs de c脿lcul completament integrat a Atenea
Exemple de curs completament integrat a Atenea.
Materials interactius, flux de treball, comunicaci贸 amb l鈥檃lumnat, avaluaci贸 autom脿tica, gesti贸 de notes, cursos en obertPeer Reviewe
Bandwidth Allocation in Peer-to-Peer File Sharing Networks
We present a model of bandwidth allocation in a stylized peer-to-peer file sharing network. Given an arbitrary population of peers composed of sharers and freeriders, where all peers interconnect to maximize their allocated bandwidth, we derive the expected bandwidth obtained by sharers and freeriders. We show that sharers are always better off than freeriders and that the di庐erence decreases as the size of the network grows. This paper constitutes a first step towards providing a general analytical foundation for resource allocation in peer-to-peer networks.Peer-to-Peer, Network formation, Resource allocation, Congestion