Bilateral and Multilateral Exchanges for Peer-Assisted Content - - PowerPoint PPT Presentation

bilateral and multilateral exchanges for peer assisted
SMART_READER_LITE
LIVE PREVIEW

Bilateral and Multilateral Exchanges for Peer-Assisted Content - - PowerPoint PPT Presentation

Bilateral and Multilateral Exchanges for Peer-Assisted Content Distribution Christina Aperjis Social Computing Group HP Labs Joint work with Ramesh Johari (Stanford) and Michael J. Freedman (Princeton) Christina Aperjis Bilateral vs.


slide-1
SLIDE 1

Bilateral and Multilateral Exchanges for Peer-Assisted Content Distribution

Christina Aperjis Social Computing Group HP Labs Joint work with Ramesh Johari (Stanford) and Michael J. Freedman (Princeton)

Christina Aperjis Bilateral vs. Multilateral Content Exchange 1

slide-2
SLIDE 2

Peer-assisted content distribution

Users upload files to each other Work well only if users share files and upload capacity P2P systems try to incentivize users to share

Christina Aperjis Bilateral vs. Multilateral Content Exchange 2

slide-3
SLIDE 3

Bilateral and multilateral exchange

Most prevalent P2P exchange systems are bilateral: downloading is possible in return for uploading to the same user

Christina Aperjis Bilateral vs. Multilateral Content Exchange 3

slide-4
SLIDE 4

Bilateral and multilateral exchange

Most prevalent P2P exchange systems are bilateral: downloading is possible in return for uploading to the same user Drawback of Bilateral Exchange:

  • nly works between users that have

reciprocally desired files

Christina Aperjis Bilateral vs. Multilateral Content Exchange 3

slide-5
SLIDE 5

Bilateral and multilateral exchange

Most prevalent P2P exchange systems are bilateral: downloading is possible in return for uploading to the same user Drawback of Bilateral Exchange:

  • nly works between users that have

reciprocally desired files Multilateral exchange allows users to trade in more general ways but is more complex to implement (e.g., virtual currency)

Christina Aperjis Bilateral vs. Multilateral Content Exchange 3

slide-6
SLIDE 6

Bilateral and multilateral exchange

Most prevalent P2P exchange systems are bilateral: downloading is possible in return for uploading to the same user Drawback of Bilateral Exchange:

  • nly works between users that have

reciprocally desired files Multilateral exchange allows users to trade in more general ways but is more complex to implement (e.g., virtual currency) Tradeoff: simplicity vs. participation

Christina Aperjis Bilateral vs. Multilateral Content Exchange 3

slide-7
SLIDE 7

Bilateral vs. multilateral

1 Comparison of equilibria

What are the efficiency properties

  • f the allocations that arise at equilibria?

2 Quantitative comparison

What proportion of users cannot participate?

Christina Aperjis Bilateral vs. Multilateral Content Exchange 4

slide-8
SLIDE 8

Preliminaries

1 View content exchange as an economy:

Demand = download requests for content Supply = scarce system resources

2 What files do peers have?

We focus on exchange on a timescale

  • ver which the set of files peers have remains constant.

3 Rates vs. bytes

We focus on download/upload rates, rather than total number of bytes transferred.

4 The network

In the model we study, the constraint is on upload capacity. More generally, a network structure may constrain uploads and downloads.

Christina Aperjis Bilateral vs. Multilateral Content Exchange 5

slide-9
SLIDE 9

Notation

i j rijf

rijf = upload rate of file f from i to j dif =

j rjif = download rate of f for peer i

ui =

j,f rijf = upload rate of peer i

vi(di, ui) = utility to peer i from (di, ui) Bi = bandwidth constraint of user i X = set of feasible rate vectors X = {r : r ≥ 0; ui ≤ Bi; rijf = 0 if i does not have file f }

Christina Aperjis Bilateral vs. Multilateral Content Exchange 6

slide-10
SLIDE 10

Bilateral content exchange

Peers exchange content on a pairwise basis Let Rij =

f rijf = rate of upload from i to j

Exchange ratio: γij = Rji/Rij As if there exist prices pij, pji, and all exchange is settlement-free: pijRij = pjiRji Thus: γij = pij/pji

Christina Aperjis Bilateral vs. Multilateral Content Exchange 7

slide-11
SLIDE 11

Bilateral content exchange

Peers exchange content on a pairwise basis Let Rij =

f rijf = rate of upload from i to j

Exchange ratio: γij = Rji/Rij As if there exist prices pij, pji, and all exchange is settlement-free: pijRij = pjiRji Thus: γij = pij/pji Peer i may be effectively price-discriminating (if pij = pik)

Christina Aperjis Bilateral vs. Multilateral Content Exchange 7

slide-12
SLIDE 12

Bilateral content exchange

Peers exchange content on a pairwise basis Let Rij =

f rijf = rate of upload from i to j

Exchange ratio: γij = Rji/Rij As if there exist prices pij, pji, and all exchange is settlement-free: pijRij = pjiRji Thus: γij = pij/pji Peer i may be effectively price-discriminating (if pij = pik) Example: BitTorrent Peer j splits upload rate Bj equally among kj peers with highest rates to j (the “active set”) For a peer i in the active set: γij =

Bj kjRij

Christina Aperjis Bilateral vs. Multilateral Content Exchange 7

slide-13
SLIDE 13

Multilateral content exchange

Users can trade a virtual currency, where downloading from peer j costs pj per unit rate Similar to an exchange economy

Christina Aperjis Bilateral vs. Multilateral Content Exchange 8

slide-14
SLIDE 14

Equilibria

In multilateral exchange, users optimize given prices Multilateral optimization max vi(di, ui) s.t.:

  • j pjRji ≤ pi
  • j Rij

r ∈ X

Christina Aperjis Bilateral vs. Multilateral Content Exchange 9

slide-15
SLIDE 15

Equilibria

In multilateral exchange, users optimize given prices Multilateral optimization max vi(di, ui) s.t.:

  • j pjRji ≤ pi
  • j Rij

r ∈ X In bilateral exchange, users

  • ptimize given exchange ratios

Bilateral optimization max vi(di, ui) s.t.: Rji ≤ γijRij∀j r ∈ X

Christina Aperjis Bilateral vs. Multilateral Content Exchange 9

slide-16
SLIDE 16

Equilibria

In multilateral exchange, users optimize given prices Multilateral optimization max vi(di, ui) s.t.:

  • j pjRji ≤ pi
  • j Rij

r ∈ X In bilateral exchange, users

  • ptimize given exchange ratios

Bilateral optimization max vi(di, ui) s.t.: Rji ≤ γijRij∀j r ∈ X At an equilibrium all users have optimized, and the market clears Multilateral equilibrium (ME) r∗ and prices p∗ Bilateral equilibrium (BE) r∗ and exchange ratios γ∗ Under mild conditions, both ME and BE exist

Christina Aperjis Bilateral vs. Multilateral Content Exchange 9

slide-17
SLIDE 17

Pareto efficiency

An allocation r is Pareto efficient if: no user’s utility can be strictly improved without strictly reducing another user’s utility ME are always Pareto efficient (First fundamental theorem of welfare economics) BE may not be Pareto efficient

Christina Aperjis Bilateral vs. Multilateral Content Exchange 10

slide-18
SLIDE 18

Pareto efficiency

When are BE efficient? Theorem Assume utility approaches −∞ as upload rate approaches capacity A BE (γ∗, r∗) is Pareto efficient if and only if there exists a supporting vector of prices p∗ such that (p∗, r∗) is a ME [Hard part to prove is the “only if”]

Christina Aperjis Bilateral vs. Multilateral Content Exchange 11

slide-19
SLIDE 19

Pareto efficiency: proof sketch

Given Pareto efficient BE (γ∗, r∗) find price vector p∗ such that (p∗, r∗) is a ME The proof exploits a connection between equilibria and reversible Markov chains Let R∗

ij = total rate from i to j at BE and R∗ ii = − j R∗ ij

For simplicity, suppose R∗ is an irreducible rate matrix of a continuous time MC (generalizes to nonirreducible case)

Christina Aperjis Bilateral vs. Multilateral Content Exchange 12

slide-20
SLIDE 20

Pareto efficiency: proof sketch

Let p be the unique invariant distribution of R∗ If R∗ is reversible, then: piR∗

ij = pjR∗ ji ⇒ γ∗ ij = pi/pj ⇒ BE ≡ ME

What is the intuition for this result? The invariant distribution gives a vector of prices at which agents could potentially trade When R∗ is reversible, agents’ trades balance on a pairwise basis with one vector of prices

Christina Aperjis Bilateral vs. Multilateral Content Exchange 13

slide-21
SLIDE 21

Pareto efficiency: proof sketch

What if R∗ is not reversible? pi

pj > γ∗ ij for some R∗ ij > 0

⇒ i “overpaid” to transact with j at BE

Christina Aperjis Bilateral vs. Multilateral Content Exchange 14

slide-22
SLIDE 22

Pareto efficiency: proof sketch

What if R∗ is not reversible? pi

pj > γ∗ ij for some R∗ ij > 0

⇒ i “overpaid” to transact with j at BE

  • k γkiR∗

ki = k pk pi R∗ ki ⇒ i “underpaid” some j′

Christina Aperjis Bilateral vs. Multilateral Content Exchange 14

slide-23
SLIDE 23

Pareto efficiency: proof sketch

What if R∗ is not reversible? pi

pj > γ∗ ij for some R∗ ij > 0

⇒ i “overpaid” to transact with j at BE

  • k γkiR∗

ki = k pk pi R∗ ki ⇒ i “underpaid” some j′

Can find cycle of users {1, ..., K} such that k “overpaid” k + 1 ∀k

Christina Aperjis Bilateral vs. Multilateral Content Exchange 14

slide-24
SLIDE 24

Pareto efficiency: proof sketch

What if R∗ is not reversible? pi

pj > γ∗ ij for some R∗ ij > 0

⇒ i “overpaid” to transact with j at BE

  • k γkiR∗

ki = k pk pi R∗ ki ⇒ i “underpaid” some j′

Can find cycle of users {1, ..., K} such that k “overpaid” k + 1 ∀k Pareto improvement: Increase u∗

i and R∗ i,i−1 by ai

User i better off if ai+1

ai

> γ∗

i,i+1

Possible to find such ai’s, because

i γ∗ i,i+1 < 1

1 2 3 a a a

2 1 3

Christina Aperjis Bilateral vs. Multilateral Content Exchange 14

slide-25
SLIDE 25

Pareto efficiency: proof sketch

What if R∗ is not reversible? pi

pj > γ∗ ij for some R∗ ij > 0

⇒ i “overpaid” to transact with j at BE

  • k γkiR∗

ki = k pk pi R∗ ki ⇒ i “underpaid” some j′

Can find cycle of users {1, ..., K} such that k “overpaid” k + 1 ∀k Pareto improvement: Increase u∗

i and R∗ i,i−1 by ai

User i better off if ai+1

ai

> γ∗

i,i+1

Possible to find such ai’s, because

i γ∗ i,i+1 < 1

1 2 3 a a a

2 1 3

r∗ Pareto efficient BE ⇒ R∗ reversible

Christina Aperjis Bilateral vs. Multilateral Content Exchange 14

slide-26
SLIDE 26

Pareto efficiency: proof sketch

Of course, in general R∗ may not be irreducible Instead, the graph of trades in the BE may have multiple connected components To complete the proof, we consider supporting price vectors p that arise as linear combinations of the unique invariant distributions on each component We show that if no supporting prices for the BE exist, then a cycle of agents (possibly spanning multiple connected components) can be found who have a Pareto improving trade

Christina Aperjis Bilateral vs. Multilateral Content Exchange 15

slide-27
SLIDE 27

Bilateral vs. multilateral

1 Pareto efficiency of equilibria 2 Participation

How many peers are able to trade bilaterally and multilaterally? We use a random model to quantify the density of trade produced by the two models

Christina Aperjis Bilateral vs. Multilateral Content Exchange 16

slide-28
SLIDE 28

Participation

Two peers are complementary if each has what the other wants A peer can trade bilaterally if she has a complementary peer A peer can trade multilaterally if it belongs on a cycle of peers along which peers want to trade

Christina Aperjis Bilateral vs. Multilateral Content Exchange 17

slide-29
SLIDE 29

Participation: asymptotic analysis

N users, K files Each user has one file to upload, and wants to download one file The probability a user wants or has the f -th most popular file is proportional to f −s (Zipf’s law)

s = 0: uniform popularity s > 1: popularity concentrated in relatively few files

Metric: expected proportion of users that cannot participate

Christina Aperjis Bilateral vs. Multilateral Content Exchange 18

slide-30
SLIDE 30

Participation: asymptotic analysis for s < 1

Let ρME (resp., ρBE) be the expected number of unmatched peers in multilateral (resp., bilateral) exchange Theorem When s ∈ [0, 1): If N > K 2, then ρBE → 0 If N < K 2, then ρBE ≥ (1 − s)2 If K log K < N, then ρME → 0 If N scales faster than K log K but slower than K 2, multilateral is significantly better than bilateral

Christina Aperjis Bilateral vs. Multilateral Content Exchange 19

slide-31
SLIDE 31

Participation: asymptotic analysis for s > 1

Theorem If s > 1, then ρBE → 0 for any scaling of K and N So in this case, bilateral performs very well Intuition: high concentration of popularity in a small number of files This result also holds:

when peers upload and download multiple files for more general random graph models

Christina Aperjis Bilateral vs. Multilateral Content Exchange 20

slide-32
SLIDE 32

BitTorrent popularity data

Dataset from [Piatek et al., 2008] 1.4M downloads, 680K peers, 7.3K files

Christina Aperjis Bilateral vs. Multilateral Content Exchange 21

slide-33
SLIDE 33

Data-driven comparison

What if we sample a random graph from the BT distribution?

2 4 6 8 10 x 10

5

0.2 0.4 0.6 0.8 1 number of users ρBE ρME

Multilateral exchange matches many more peers than bilateral

Christina Aperjis Bilateral vs. Multilateral Content Exchange 22

slide-34
SLIDE 34

Data-driven comparison

What if users can trade in triangles? Trilateral exchange converges much faster than bilateral

Christina Aperjis Bilateral vs. Multilateral Content Exchange 23

slide-35
SLIDE 35

Data-driven comparison

However, as the number of files a peer has increases, bilateral rapidly approaches multilateral

2 4 6 8 10 x 10

5

0.2 0.4 0.6 0.8 1 number of users ρBE m=1 m=2 m=5 m=10 m=20

m = # of files a peer has available for uploading

Christina Aperjis Bilateral vs. Multilateral Content Exchange 24

slide-36
SLIDE 36

Data-driven comparison

What if the number of files that users possess varies across different users?

2 4 6 8 10 x 10

5

0.4 0.5 0.6 0.7 0.8 0.9 1 number of users ρBE m=1 m ~ d m=2

d = distribution from dataset

  • mean = 2.0084
  • high variance

Christina Aperjis Bilateral vs. Multilateral Content Exchange 25

slide-37
SLIDE 37

Conclusions

A BE is Pareto efficient if and only if it corresponds to a ME Bilateral exchange performs very well in expectation if the file popularity is very concentrated and/or users share a sufficiently large number of files

Christina Aperjis Bilateral vs. Multilateral Content Exchange 26

slide-38
SLIDE 38

Conclusions

A BE is Pareto efficient if and only if it corresponds to a ME Bilateral exchange performs very well in expectation if the file popularity is very concentrated and/or users share a sufficiently large number of files Open issue: extend comparison to a dynamic setting, where downloads complete and preferences change over time users join and leave the system

Christina Aperjis Bilateral vs. Multilateral Content Exchange 26