Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
GPS: A General Peer-to-Peer Simulator and its Use for Modeling BitTorrent
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Missing Piece Issue and Upload Strategies in Flashcrowds and P2P-assisted Filesharing
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Improving Traffic Locality in BitTorrent via Biased Neighbor Selection
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal scheduling of peer-to-peer file dissemination
Journal of Scheduling
Analysis of bittorrent-like protocols for on-demand stored media streaming
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bittorrent is an auction: analyzing and improving bittorrent's incentives
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
On the Impact of Greedy Strategies in BitTorrent Networks: The Case of BitTyrant
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
Reducing Source Load in BitTorrent
ICCCN '09 Proceedings of the 2009 Proceedings of 18th International Conference on Computer Communications and Networks
FairTorrent: bringing fairness to peer-to-peer systems
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Modeling seed scheduling strategies in BitTorrent
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Improving QoS in bittorrent-like VoD systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Public and private BitTorrent communities: a measurement study
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
Do incentives build robustness in bit torrent
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Angels in the Cloud: A Peer-Assisted Bulk-Synchronous Content Distribution Service
CLOUD '11 Proceedings of the 2011 IEEE 4th International Conference on Cloud Computing
Convergence of proportional-fair sharing algorithms under general conditions
IEEE Transactions on Wireless Communications
Packet-level traffic measurements from the Sprint IP backbone
IEEE Network: The Magazine of Global Internetworking
BSU: a biased seed unchoking algorithm for p2p systems
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
| Hi-index | 0.00 |
In a content distribution (file sharing) scenario, the initial phase is delicate due to the lack of global knowledge and the dynamics of the overlay. An unwise piece dissemination in this phase can cause delays in reaching steady state, thus increasing file download times. After showing that finding the scheduling strategy for optimal dissemination is computationally hard, even when the offline knowledge of the overlay is given, we devise a new class of scheduling algorithms at the seed (source peer with full content), based on a proportional fair approach, and we implement them on a real file sharing client. In addition to simulation results, we validated on our own file sharing client (BUTorrent) that our solution improves up to 25% the average downloading time of a standard file sharing protocol. Moreover, we give theoretical upper bounds on the improvements that our scheduling strategies may achieve.