CS5412: TORRENTS AND TIT-FOR-TAT

More documents

Recommendations

Info

10 End-host based multicast “Single-uploader” “Multiple-uploaders” Lots of nodes want to download Make use of their uploading abilities as well Node that has downloaded (part of) file will then upload it to other nodes. Uploading costs amortized across all nodes <strong>CS5412</strong> Spring 2012 (Cloud Computing: Birman)
11 End-host based multicast Also called “Application-level Multicast” Many protocols proposed early this decade Yoid (2000), Narada (2000), Overcast (2000), ALMI (2001) All use single trees Problem with single trees? <strong>CS5412</strong> Spring 2012 (Cloud Computing: Birman)
Page 1 and 2: Lecture VI CS5412: TORRENTS AND TIT
Page 3 and 4: 3 The basic BitTorrent Scenario Mi
Page 5 and 6: 5 Source Router “Interested” En
Page 7 and 8: 7 Client-Server Source Router “In
Page 9: 9 End-host based multicast Source R
Page 13 and 14: 13 End-host multicast using single
Page 15 and 16: 15 End-host multicast using single
Page 17 and 18: 17 BitTorrent Swarm Swarm Set of
Page 19 and 20: Peer How a node enters a swarm for
Page 21 and 22: Peer How a node enters a swarm for
Page 23 and 24: 23 Terminology Seed: peer with the
Page 25 and 26: 25 Choosing pieces to request Rand
Page 27 and 28: 27 Tit-for-tat as incentive to uplo
Page 29 and 30: 29 Why BitTorrent took off Better
Page 31 and 32: 31 Pros and cons of BitTorrent Pro
Page 33 and 34: 33 Pros and cons of BitTorrent Dep
Page 35 and 36: 35 Prior to Netflix “explosion”
Page 37 and 38: 37 Example finding from a recent st
Page 39 and 40: 39 Basic strategy They assume cryp
Page 41 and 42: 41 Obvious concern: Failed key exch
Page 43 and 44: 43 Insights gained? Collaborative

CS5412: TORRENTS AND TIT-FOR-TAT

Create successful ePaper yourself

Delete template?

Save as template?