#### DMCA

## Parallel and Distributed Systems Section (2010)

### Citations

2203 | Data networks
- Bertsekas, Gallager
- 1992
(Show Context)
Citation Context ...t unique. The algorithm runs on a finite, continuous, convex set (bounded by the finite many constant capacities), on which the maxmin fair allocation exists [12]; moreover, we know that it is unique =-=[2]-=-. Observe that in the first for-cycle we put those edges from MinSet into FixedSet for which: either (a) their d node is saturated and there exists no (l′, d) edge for or (b) all the u nodes, for whic... |

1037 | Incentives Build Robustness in BitTorrent
- Cohen
- 2003
(Show Context)
Citation Context ...Considerable research and development effort has been invested in designing and evaluating BitTorrent’s intra-swarm resouce allocation methods. In the paper introducing the BitTorrent protocol, Cohen =-=[3]-=- emphasizes the role of efficient upload bandwidth utilization. Experimental investigations by Legout et al. suggest that the current algorithms for choosing upload partners inside a swarm need no fur... |

147 | Rarest first and choke algorithms are enough
- Legout, Urvoy-Keller, et al.
- 2006
(Show Context)
Citation Context ...ole of efficient upload bandwidth utilization. Experimental investigations by Legout et al. suggest that the current algorithms for choosing upload partners inside a swarm need no further improvement =-=[9]-=- and documents the high bandwidth utilization of upload bandwidth inside a swarm [8]. BitTorrent has also been studied at the community level. Zhang et al. [14] show how an entire ecosystem forms arou... |

99 | Clustering and sharing incentives in BitTorrent systems
- Legout, Liogkas, et al.
(Show Context)
Citation Context ... et al. suggest that the current algorithms for choosing upload partners inside a swarm need no further improvement [9] and documents the high bandwidth utilization of upload bandwidth inside a swarm =-=[8]-=-. BitTorrent has also been studied at the community level. Zhang et al. [14] show how an entire ecosystem forms around the P2P protocol. Guo et al. [6] and Andrade et al. [1] analyze traces of multipl... |

84 | Measurements, analysis, and modeling of BitTorrent-like systems.
- Guo, Chen, et al.
- 2005
(Show Context)
Citation Context ... allocation, inter-swarm resource allocation has received limited attention. At the same time, measurements show that most BitTorrent users participate in multiple swarms, or torrents, simultaneously =-=[6]-=-. It is customary for users to concurrently download multiple files and continue uploading files they finished downloading. Because of this usage pattern, BitTorrent clients have devised various mecha... |

60 | A unified framework for max-min and min-max fairness with applications”.
- Radunovic, Boudec
- 2007
(Show Context)
Citation Context ...hat case the max-min fair allocation is not unique. The algorithm runs on a finite, continuous, convex set (bounded by the finite many constant capacities), on which the maxmin fair allocation exists =-=[12]-=-; moreover, we know that it is unique [2]. Observe that in the first for-cycle we put those edges from MinSet into FixedSet for which: either (a) their d node is saturated and there exists no (l′, d) ... |

55 | Antfarm: Efficient Content Distribution with Managed Swarms.
- Peterson, Sirer
- 2009
(Show Context)
Citation Context ...roved. Our results do not contradict this finding, but question whether improvements for present SSAP solutions are relevant for the problem instances most common in real communities. Peterson et al. =-=[11]-=- design a BitTorrent-inspired content distribution system with a central bandwidth allocation algorithm. Similar to us, they envisage different goals for the system, such as guaranteeing a minimum ser... |

46 |
Unraveling the bittorrent ecosystem
- Zhang, Dhungel, et al.
(Show Context)
Citation Context ...rce allocation mechanisms using traces of real-world BitTorrent usage. These traces come from two BitTorrent communities – sites which require user registration for access to a collection of torrents =-=[1, 14]-=-. To evaluate how present resource allocation methods perform in the context of these communities, we first describe the algorithms implemented in prevalent BitTorrent clients and introduce methods to... |

20 |
Resource demand and supply in BitTorrent content-sharing communities
- Andrade, Santosneto, et al.
- 2008
(Show Context)
Citation Context ...rce allocation mechanisms using traces of real-world BitTorrent usage. These traces come from two BitTorrent communities – sites which require user registration for access to a collection of torrents =-=[1, 14]-=-. To evaluate how present resource allocation methods perform in the context of these communities, we first describe the algorithms implemented in prevalent BitTorrent clients and introduce methods to... |

8 | Sampling Bias in BitTorrent Measurements
- Zhang, Iosup, et al.
- 2010
(Show Context)
Citation Context ...ad capacity of a large sample of BitTorrent users using passive measurement tools. We assume 1 We note that some of this data has been analyzed before (for example Andrade et al. [1] and Zhang et al. =-=[13]-=-). Nevertheless, the aspects evaluated in this paper have never been considered using these datasets. Wp 14PDS Capotă et al. Inter-swarm resource...Wp Wp Wp5.4 Wp Sampling this dataset represents the... |

4 | The importance of history in a media delivery system
- Dunn, Gribble, et al.
- 2007
(Show Context)
Citation Context ... multi-swarm systems has not characterized the community-level metrics we consider or evaluated the effect of current inter-swarm resource allocation mechanisms. More similar to our work, Dunn et al. =-=[5]-=- explore seeding session selection strategies for a BitTorrent-like system centered around a content provider. Their goal is minimizing the bandwidth demand at the provider–equivalent to maximizing P2... |

3 |
Leveraging BitTorrent for End Host Measurements. Passive and Active Measurement Workshop
- ISDAL, PIATEK, et al.
- 2007
(Show Context)
Citation Context ...ot have information about the upload and download capacities of users. We turn instead to an additional trace to derive realistic bandwidth capacities for users in each problem instance. Isdal et al. =-=[7]-=- measured the upload capacity of a large sample of BitTorrent users using passive measurement tools. We assume 1 We note that some of this data has been analyzed before (for example Andrade et al. [1]... |

2 |
optimization software,” www.mosek.com
- MosekApS
(Show Context)
Citation Context ...the fact that the capacity function is integer, the so-called integral flow theorem states that there exists an integral flow. This can be found in polynomial time using a linear solver. We use MOSEK =-=[10]-=-, which is able to solve our maxflow instances efficiently with special options for solving network problems. 4.3 Max-min fairness algorithm Our second goal from Section 2.3 is to find the Max-min fai... |

1 |
Dantzig (1914–2005
- George
(Show Context)
Citation Context ... equivalent to solving the maximum flow problem for G. Several well-known algorithms exist for Wp 11PDS Capotă et al. Inter-swarm resource...Wp Wp Wp4.3 Wp Max-min fairness algorithm solving maxflow =-=[4]-=-. In this paper we use the linear programming problem formalization, which is max ∑ (ui,l t j )∈E f(ui, l t j ), s.t. f(ui, l t j ) ≤ µi and f(l t j , dj) ≤ δj (∀(ui, l t j) ∈ E ∧ ∀(l t j, dj) ∈ E). N... |