## Efficient file dissemination using peerto-peer technology (2004)

Citations: | 17 - 1 self |

### BibTeX

@MISC{Mundinger04efficientfile,

author = {Jochen Mundinger and Richard Weber},

title = {Efficient file dissemination using peerto-peer technology},

year = {2004}

}

### Years of Citing Articles

### OpenURL

### Abstract

We consider a problem which is partially motivated by the BitTorrent protocol. Suppose that a large file is initially available only at some server and we desire to disseminate it amongst N end users in the least possible time. We suppose that the file is divided in M parts of equal size and that an end user may download a part from either the server or one of the peers who has previously downloaded it. Given constraints on the rates at which the server and peers can upload to one another, we seek a strategy that minimizes the time until all peers have downloaded the entire file. Assuming that there is a centralized controller who does the scheduling of the uploads, we show how to solve this problem by solving a finite number of linear programs. Making connections with the so-called ‘broadcasting problem’, we provide a complete solution of this problem when the capacities are all equal. We also carry out simulations to assess the performance of a natural randomized algorithm that operates under distributed control. We compare the performance of this algorithm in two different information scenarios with what can be achieved by centralized control.

### Citations

1099 | A Measurement Study of Peer-toPeer File Sharing Systems
- Saroiu, Gummadi, et al.
- 2002
(Show Context)
Citation Context ... [17]. We would also like to consider peers who prefer to free-ride and do not wish to contribute uploading effort. Significant amounts of free-riding have been observed in P2P applications [1], [4], =-=[12]-=-. BitTorrent implements a choking algorithm to limit free-riders. Recently, alternatives to BitTorrent have been proposed, e.g., Slurpie [13]. A comparison of these would be interesting. Acknowledgmen... |

832 | Incentives build robustness in BitTorrent
- COHEN
- 2003
(Show Context)
Citation Context ... selected who are peers also downloading the file. Peers use this information to connect to each other. By default, the file is divided into pieces of a quarter megabyte. Full details can be found in =-=[6]-=-. The BitTorrent protocol has been implemented successfully and is deployed widely. In Section 2, we describe our ‘uplink-sharing model’. Our aim is to develop good decentralized algorithms, i.e., one... |

685 | Mersenne twister: A 623dimensionally equidistributed uniform pseudorandom number generator - Matsumoto, Nishimura - 1998 |

520 | Free Riding on Gnutella
- Adar, Huberman
- 2000
(Show Context)
Citation Context ...is LP for various T : maximize ∑ pjk(T ) (1) subject to the following constraints. Regional constraints Link constraints between variables pik(t) = Mτ j,k xijk(t) ∈ {0, 1} for all i, j, k, t pik(t) ∈ =-=[0, 1]-=- for all i, k, t ∑t−τ t ′=0 j=0 N∑ xijk(t ′ )Cj , for all i, k (2) Essential constraints ∑ xijk(t) ≤ 1 , for all i, j (Connection constraint) (3) Initial conditions k ∑ xijk(t) ≤ 1 , for all j (Capaci... |

427 | Modeling and Performance Analysis of BitTorrent-Like Peerto-Peer Networks
- Qiu, Srikant
(Show Context)
Citation Context ...nload of the whole file. In Internet applications peers often connect for only relatively short times. Work in this direction, using a fluid model to study the steady-state performance, is pursued in =-=[11]-=- and there is other relevant work in [17]. We would also like to consider peers who prefer to free-ride and do not wish to contribute uploading effort. Significant amounts of free-riding have been obs... |

234 | Dissecting BitTorrent: Five Months in a Torrent’s Lifetime
- Izal, Uvroy-Keller, et al.
(Show Context)
Citation Context ...sting to compare the performance of the precise protocol. Measurements of the actual BitTorrent protocol constitute an alternative approach to simulations. Results of such an analysis are reported in =-=[7]-=-. In practice, splitting the file and passing on extra information has an overhead cost. Given this overhead, we might try to compute an optimal number of file parts M. We would like to generalize our... |

119 |
de Veciana, Service Capacity of Peer to Peer Networks
- Yang, G
(Show Context)
Citation Context ...n Section 5, our solution would take M +⌊log 2 N⌋ rounds, each lasting time 1/Mk, and this gives a smaller makespan than they give for the k-port model. Finally, we note that Yang and de Veciana [16] =-=[17]-=- have also considered problems relating to the service capacity of P2P networks. They give an argument for (9) when N is of the form 2 n − 1. Like us, they seem to have also done their research while ... |

98 | Slurpie: A cooperative bulk data transfer protocol
- Sherwood, Braud, et al.
- 2004
(Show Context)
Citation Context ...ee-riding have been observed in P2P applications [1], [4], [12]. BitTorrent implements a choking algorithm to limit free-riders. Recently, alternatives to BitTorrent have been proposed, e.g., Slurpie =-=[13]-=-. A comparison of these would be interesting. Acknowledgment We thank our colleague Teymur Tahseen for helpful discussions and his contributions to the computation of the mean makespan shown in Tables... |

55 |
Scheduling file transfers
- Coffman, Garey, et al.
- 1985
(Show Context)
Citation Context ...haring model (as well as in the broadcasting model) with all upload capacities equal to 1, constraining the peers’ download rates to 1 does not further increase the minimum makespan. Coffman, et. al. =-=[5]-=- have considered a problem in which the download capacities are constrained, however, the decision as to which peer is to download from which other is fixed in advance. They show that the determinatio... |

27 | Fairness, incentives and performance in peer-to-peer networks
- Veciana, Yang
- 2003
(Show Context)
Citation Context ...see in Section 5, our solution would take M +⌊log 2 N⌋ rounds, each lasting time 1/Mk, and this gives a smaller makespan than they give for the k-port model. Finally, we note that Yang and de Veciana =-=[16]-=- [17] have also considered problems relating to the service capacity of P2P networks. They give an argument for (9) when N is of the form 2 n − 1. Like us, they seem to have also done their research w... |

19 |
and Integer Programming: theory and practice
- Sierksma, Linear
(Show Context)
Citation Context ...) (7) 1 − ξik(t) − ζijk(t) ≤ 0 , for all i, j, k (Source availability constraint) (8) p0k(0) = 1 for all k pik(0) = 0 for all i, k Constraints (6)–(8) have been linearized. Background can be found in =-=[14]-=-. For this, we used the two auxiliary variables ξik(t) = 1 {pik(t)=1} and ζijk(t) = 1 {rijk(t)=0}. These definitions can be expressed through the following constraints. Linearization constraints ξik(t... |

16 | Optimal multiple message broadcasting in telephone-like communication systems
- Bar-Noy, Kipnis, et al.
(Show Context)
Citation Context ... solved completely when Cj = 1 for all j. Our problem is then the same as the so-called ‘simultaneous send/receive broadcasting problem’. This problem was first solved by Bar-Noy, Kipnis and Schieber =-=[3]-=-. They proved Theorem 1 as a special case of their stronger result for a telephone-like model in which peers must be matched pairwise at each round and N + 1 is even. Since we do not require such matc... |

14 |
A simplex based algorithm to solve separated continuous linear programs
- Weiss
- 2001
(Show Context)
Citation Context ... it might be possible to formulate it either as an optimal control problem, or as a continuous linear programming problem. The latter are difficult to solve, but there has been some progress recently =-=[15]-=-. In Section 6 we considered the strategy where all choices are made uniformly at random. There are obvious improvements that can be made following from the observations in Section 4. Namely, it would... |

6 | Broadcasting multiple messages in the multiport model
- Bar-Noy, Ho
- 1999
(Show Context)
Citation Context ...eers must be matched pairwise at each round and N + 1 is even. Since we do not require such matching, we can offer a very much simpler scheduling algorithm by which to prove Theorem 1. Bar-Noy and Ho =-=[2]-=- have considered a multiport model in which each peer may upload to k other peers at once. They provide an algorithm that takes 1 round more than a simple lower bound on the number of rounds of ⌈M/k⌉ ... |

5 |
Availability and locality measurements of peerto-peer file sharing systems
- Chu, Labonte, et al.
- 2002
(Show Context)
Citation Context ...rk in [17]. We would also like to consider peers who prefer to free-ride and do not wish to contribute uploading effort. Significant amounts of free-riding have been observed in P2P applications [1], =-=[4]-=-, [12]. BitTorrent implements a choking algorithm to limit free-riders. Recently, alternatives to BitTorrent have been proposed, e.g., Slurpie [13]. A comparison of these would be interesting. Acknowl... |

1 | On efficiently disseminating a file using peer-to-peer technology. Working Paper - Mundinger, Tahseen, et al. - 2003 |