bounds on the performance of p2p networks using tit-for-tat strategies dimitri defigueiredo balaji...
Post on 20-Dec-2015
220 views
TRANSCRIPT
![Page 1: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/1.jpg)
Bounds on the Performance of P2P Networks Using Tit-for-Tat
Strategies
Dimitri DeFigueiredo Balaji Venkatachalam
S. Felix Wu
![Page 2: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/2.jpg)
Motivation
Content Distribution
A user wants to download a movie asquickly as possible.
DVD New Releases:Many users at the same time
Akamai? Can P2P help?
![Page 3: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/3.jpg)
Outline
• Motivation
• Analysis Framework
• Strategies
• Comparison
• Seed Capacity
• Summary
![Page 4: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/4.jpg)
Topological Model
Real Network vs. Ideal Network Upload capacity = willingness to contribute
![Page 5: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/5.jpg)
Analysis Framework• All peers want file at time t=0 (Flash Crowd)
• N peers• M pieces
• File of size Z bytes.
• All peers have the same upload capacity U
• For now: seed capacity C = peer capacity U upload capacity = download capacity
• It takes seconds to upload a pieceCM
Z
![Page 6: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/6.jpg)
Client/Server Model
Server connects to all clients.
• How fast is it?
• Workload: W = NZ
![Page 7: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/7.jpg)
Analysis in 3 Axes
• Efficiency, E[t]
• Scalability, N
• Workload, W (and C )
• Fairness, IAbs
![Page 8: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/8.jpg)
Fairness
Motivation:– Absolute value needed to prevent cancellation– Max instead of sum does not detect all
unfairness
(Always exclude seed from the sums)
![Page 9: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/9.jpg)
Client/Server Fairness
• Other notable points 0 and 2.
![Page 10: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/10.jpg)
Fully Cooperative Strategy
Setting:
• Previously agreed upon
• All peers cooperate• N = 2k peers
(Proposed by Yang and de Veciana ’04)
![Page 11: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/11.jpg)
FC Strategy
Example…
![Page 12: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/12.jpg)
24 = 16 peers 5 pieces
![Page 13: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/13.jpg)
t = 0+t = +
![Page 14: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/14.jpg)
t = +t = 2+
![Page 15: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/15.jpg)
t = 2+t = 3+
![Page 16: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/16.jpg)
t = 4+t = 3+
![Page 17: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/17.jpg)
t = 4+t = 5+
![Page 18: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/18.jpg)
t = 5+t = 6+
![Page 19: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/19.jpg)
t = 6+t = 7+
![Page 20: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/20.jpg)
t = 8t = 7+
![Page 21: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/21.jpg)
FC Properties
• All peers finish at the same time
• Each peer connects to (log N) others.
• Download = Upload
• Pieces are completed in order
• Very Fast!
![Page 22: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/22.jpg)
FC Strategy
How fast is it?
Workload:
Fairness (see full version):
IAbs → 0 as N → ∞
![Page 23: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/23.jpg)
FC vs. Client/Server
Client/server Tit-for-Tat FC
Increasing cooperation
![Page 24: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/24.jpg)
Tit-for-Tat Strategies
• Direct Reciprocity (DR):A uploads to B only if B uploads to A
• Indirect Reciprocity (IR): A uploads to B only if somebody uploads to A
A B
A B C
![Page 25: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/25.jpg)
Tit-for-Tat Strategies
From previous definitions:
• Peer stops uploading as soon as it is done• W ≥ max( N, M ) pieces
• Fairness:
![Page 26: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/26.jpg)
IR Strategy
Example…
![Page 27: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/27.jpg)
IR Strategy
Peers
1 2 3 4 5
t = 0+t = +
![Page 28: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/28.jpg)
IR Strategy
Peers
1 2 3 4 5
t = +t = 2+
![Page 29: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/29.jpg)
t = 3+t = 2+
IR Strategy
Peers
1 2 3 4 5
![Page 30: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/30.jpg)
t = 4+t = 3+
IR Strategy
Peers
1 2 3 4 5
![Page 31: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/31.jpg)
t = 5+t = 4+
IR Strategy
Peers
1 2 3 4 5
![Page 32: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/32.jpg)
t = 6+t = 5+
IR Strategy
Peers
1 2 3 4 5
![Page 33: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/33.jpg)
t = 7+t = 6+
IR Strategy
Peers
1 2 3 4 5
![Page 34: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/34.jpg)
t = 7+t = 8+
IR Strategy
Peers
1 2 3 4 5
![Page 35: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/35.jpg)
t = 9t = 8+
IR Strategy
Peers
1 2 3 4 5
![Page 36: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/36.jpg)
IR Strategy
How fast?
Fastest among TFT when:
• N = infinite; or,
• download capacity = upload capacity
![Page 37: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/37.jpg)
Outline
• Motivation
• Analysis Framework
• Strategies
• Comparison
• Seed Capacity
• Summary
![Page 38: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/38.jpg)
Strategy Comparison
• In TFT, peers cooperate with ≤ M-1 others• In TFT, M is important!
• Increase in number of cooperating peers• Gain of IR strategy over client/server
• It does not hurt to increase M
O(N/M)
→0 →0
O( log N )
O( log N ) O(N/M)
O(N)
O(N)
![Page 39: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/39.jpg)
Outline
• Motivation
• Analysis Framework
• Strategies
• Comparison
• Seed Capacity
• Summary
![Page 40: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/40.jpg)
Seed Capacity
• 2 views: Throughput or Replication
s =
• Previous TFT results hold for s = 1
• Let us assume N > M
seed capacity
peer capacity
![Page 41: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/41.jpg)
Increasing Seed Capacity
• If s=1, use IR
• If s=N/M ,use IR with Parallel Grouping
• If s=N, we can obtain optimal strategy
Increasing s
![Page 42: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/42.jpg)
Seed Capacity Threshold
Strategy IR IR+Parallel Grouping
Optimal
Seed Capacity s = 1 s = N
E[t]
2
1NM
2
1
2
2 MM
2
11
M
M
Ns
×N/M
÷N/M
×M
÷3
M
Ns Rule of Thumb:
![Page 43: Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu](https://reader036.vdocuments.site/reader036/viewer/2022062516/56649d455503460f94a21ce2/html5/thumbnails/43.jpg)
Summary
• Analysis criteria: N, E[t], W, IAbs
• Client/Server: slow, high workload
• Log increase in E[t] with N is best possible• M is important:
– Determines cooperation in TFT– The larger M, the better for cooperation
• Rule of thumb for seed in TFT: s=N/M