Advanced Networks Colloquium: Christina Aperjis, "Peer-Assisted Content Distribution"

Friday, November 18, 2011
11:00 a.m.
1146 A.V. Williams Building
Kimberly Edwards
301 405 6579
kedwards@umd.edu

Advanced Networks Colloquium
Bilateral and Multilateral Exchanges for Peer-Assisted Content Distribution

Christina Aperjis
Hewlett-Packard Laboratories

| video |

Abstract
Users of the BitTorrent file-sharing protocol and its variants are incentivized to contribute their upload capacity in a bilateral manner: downloading is possible in return for uploading to the same user. An alternative is to enable multilateral exchange via a price-based market mechanism to match user demand for content to available supply at other users in the system. The two system designs present a significant tradeoff: bilateral exchange without money is simple, while multilateral exchange allows more users to trade. We provide a formal comparison of the two types of exchange both in terms of equilibria and through the expected percentage of users that can trade in a large system. Our theoretical results as well as analysis of a BitTorrent dataset provide quantitative insight into regimes where bilateral exchange may perform quite well even though it does not always give rise to Pareto-efficient equilibrium allocations.

This is joint work with Ramesh Johari and Michael J. Freedman.

Biography
Christina Aperjis received the B.S. degree in electrical and computer engineering from the National Technical University of Athens, Athens, Greece, in 2003, the M.S. degree in computer science from Columbia University, New York, NY, in 2004, and the Ph.D. degree in operations research from Stanford University, Stanford, CA, in 2009. She is currently a Researcher with the Social Computing Group, HP Labs, Palo Alto, Calif.

Audience: Graduate  Undergraduate  Faculty  Post-Docs  Alumni 

remind we with google calendar

 

March 2024

SU MO TU WE TH FR SA
25 26 27 28 29 1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
31 1 2 3 4 5 6
Submit an Event