Hari Balakrishnan 24 February 2005 MIT CSAIL UC Berkeley / ICSI IRIS Project Peering Peer-to-Peer Providers Scott Shenker Michael Walfish.

Slides:



Advertisements
Similar presentations
Untangling the Web from DNS Michael Walfish Hari Balakrishnan Massachusetts Institute of Technology Scott Shenker UC Berkeley/ICSI IRIS Project 30 March.
Advertisements

Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Michael Walfish, Jeremy Stribling, Maxwell Krohn, Hari Balakrishnan, Robert Morris, and Scott Shenker * 7 December 2004 MIT Computer Science and AI Lab.
IPv6 Multihoming Support in the Mobile Internet Presented by Paul Swenson CMSC 681, Fall 2007 Article by M. Bagnulo et. al. and published in the October.
CP Networking1 WAN and Internet Access. CP Networking2 Introduction What is Wide Area Networking? What is Wide Area Networking? How Internet.
CLive Cloud-Assisted P2P Live Streaming
Connect communicate collaborate View on eResearch 2020 study Draft report on “The Role of e-Infrastructures in the Creation of Global Virtual Research.
Tussle in cyberspace: Defining tomorrow ’ s internet (2002) D.Clark, J. Wroclawski, K. Sollins & R. Braden Presented by: Gergely Biczok (Slides in courtesy.
SplitStream: High-Bandwidth Multicast in Cooperative Environments Marco Barreno Peer-to-peer systems 9/22/2003.
Vortex98 Laguna Niguel, CA May 1998 Economic Issues Facing Internet Hal R. Varian SIMS, UC Berkeley
Vault: A Secure Binding Service Guor-Huar Lu, Changho Choi, Zhi-Li Zhang University of Minnesota.
Topics in Reliable Distributed Systems Lecture 2, Fall Dr. Idit Keidar.
Introducing: Cooperative Library Presented August 19, 2002.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
OpenDHT: A Public DHT Service Sean C. Rhea UC Berkeley June 2, 2005 Joint work with: Brighten Godfrey, Brad Karp, John Kubiatowicz, Sylvia Ratnasamy, Scott.
CS 268: Future Internet Architectures Ion Stoica May 1, 2006.
P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar.
Tussle in cyberspace: Defining tomorrow ’ s internet D.Clark, J.Wroclawski, K.Sollins & R.Braden Presented by: Ao-Jan Su (Slides in courtesy of: Baoning.
Idit Keidar, Principles of Reliable Distributed Systems, Technion EE, Spring Principles of Reliable Distributed Systems Lecture 2: Peer-to-Peer.
The Shapley Value: Its Use and Implications on Internet Economics Richard T.B. Ma Columbia University Dah-ming Chiu, John C.S. Lui The Chinese University.
Fixing the Embarrassing Slowness of OpenDHT on PlanetLab Sean Rhea, Byung-Gon Chun, John Kubiatowicz, and Scott Shenker UC Berkeley (and now MIT) December.
CS 268: Future Internet Architectures Ion Stoica May 6, 2003.
Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.
Internet Indirection Infrastructure Slides thanks to Ion Stoica.
1 Routing as a Service Karthik Lakshminarayanan (with Ion Stoica and Scott Shenker) Sahara/i3 retreat, January 2004.
Using Prices to Allocate Resources at Access Points Jimmy Shih, Randy Katz, Anthony Joseph One Administrative Domain Access Point A Access Point B Network.
Searching in Unstructured Networks Joining Theory with P-P2P.
Efficient agent-based selection of DiffServ SLAs over MPLS networks Thanasis G. Papaioannou a,b, Stelios Sartzetakis a, and George D. Stamoulis a,b presented.
Internet Indirection Infrastructure (i3) Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana UC Berkeley SIGCOMM 2002.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
INTERCONNECTING CDNS AKA “PEERING PEER-TO-PEER” Bruce Davie & Francois le Faucheur.
© 2011 Nicira. All rights reserved.. Peering at the Content Layer Bruce Davie Chief Service Provider Architect
1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.
Information-Centric Networks07b-1 Week 7 / Paper 2 NIRA: A New Inter-Domain Routing Architecture –Xiaowei Yang, David Clark, Arthur W. Berger –IEEE/ACM.
Active Network Applications Tom Anderson University of Washington.
Kendra initiative CONTENT DELIVERY RESEARCH Content Delivery Summit Amsterdam February 2001 "Fueling the demand for broadband Internet" Daniel Harris -
IP Addressing Introductory material. An entire module devoted to IP addresses.
Tussel in Cyberspace Based on Slides by I. Stoica.
Topics → Business strategy must set goals → Partners selection → Criteria for selecting partners → Structure must maximize cooperation → Incentives for.
Network Technologies essentials Week 9: Distributed file sharing & multimedia Compilation made by Tim Moors, UNSW Australia Original slides by David Wetherall,
2: Application Layer1 Chapter 2 outline r 2.1 Principles of app layer protocols r 2.2 Web and HTTP r 2.3 FTP r 2.4 Electronic Mail r 2.5 DNS r 2.6 Socket.
Full-Text Search in P2P Networks Christof Leng Databases and Distributed Systems Group TU Darmstadt.
Information-Centric Networks06a-1 Week 6 / Paper 1 Untangling the Web from DNS –Michael Walfish, Hari Balakrishnan and Scott Shenker –Networked Systems.
CHAPTER 3 PLANNING INTERNET CONNECTIVITY. D ETERMINING INTERNET CONNECTIVITY REQUIREMENTS Factors to be considered in internet access strategy: Sufficient.
Tussle in cyberspace: Defining tomorrow’s internet D.Clark, J.Wroclawski, K.Sollins, R.Braden Presenter: Baoning Wu.
Interconnection Issues Geoff Huston. Internet Service Providers Many providers in every market Many provider profiles - from small business to global.
Overcast: Reliable Multicasting with an Overlay Network Paper authors: Jannotti, Gifford, Johnson, Kaashoek, O’Toole Jr. Slides by Chris Johnstone.
Vertical Scope of the Firm What are the appropriate vertical boundaries of the firm?
Information-Centric Networks06b-1 Week 6 / Paper 2 A layered naming architecture for the Internet –Hari Balakrishnan, Karthik Lakshminarayanan, Sylvia.
1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.
Distribution and components. 2 What is the problem? Enterprise computing is Large scale & complex: It supports large scale and complex organisations Spanning.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 9 Virtual Trunking Protocol.
1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.
International Telecommunication Union Workshop on Next Generation Networks: What, When & How? Geneva, 9-10 July 2003 NGN Research in China Jiang lin-tao.
Chord Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, Robert E. Gruber Google,
Tussle in Cyberspace: Defining Tomorrow’s Internet Presented by: Khoa To.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
1. Efficient Peer-to-Peer Lookup Based on a Distributed Trie 2. Complex Queries in DHT-based Peer-to-Peer Networks Lintao Liu 5/21/2002.
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.
CS 347Notes081 CS 347: Parallel and Distributed Data Management Notes 08: P2P Systems.
Why PHY Really Matters Hari Balakrishnan MIT CSAIL August 2007 Joint work with Kyle Jamieson and Ramki Gummadi.
John S. Otto Mario A. Sánchez John P. Rula Fabián E. Bustamante Northwestern, EECS.
Kris, Karthik, Ansley, Sean, Jeremy Dick, David K, Frans, Hari
A Layered Naming Architecture
NET323 D: Network Protocols
ECE 671 – Lecture 16 Content Distribution Networks
NET323 D: Network Protocols
Dynamic Replica Placement for Scalable Content Delivery
EE 122: Lecture 22 (Overlay Networks)
Presentation transcript:

Hari Balakrishnan 24 February 2005 MIT CSAIL UC Berkeley / ICSI IRIS Project Peering Peer-to-Peer Providers Scott Shenker Michael Walfish

Academic P2P: An Abridged History Early days: B.Y.O.I. (Bring Your Own Infrastructure) Recently: proposals to use P2P technology (DHTs resolve flat names) for core network services  Examples: CoDoNs, HIP, P6P, DOA DNS client CoDoNS node DNS client DHT

Academic P2P: An Abridged History, Cont. The DHT still has to run somewhere But core network services cannot (or should not) depend on teenagers with cable modems … Solution? CoDoNS node DHT

A New School of DHT Research Open DHT [IPTPS04]: DHT nodes should be managed Run DHT as shared service  Running one is complex  Reuse minimal put-get iface From B.Y.O.I. to Frat Party  Open DHT is a communal keg Sean Rhea

So What’s the Problem? Sean has made Open DHT a stable, available, high- performance infrastructure … … but can’t afford to run it by himself, forever Shared infrastructure should be supported by a market, not by a benevolent donor

Shared, Commercial DHT Service? Must present users with a uniform “DHT dialtone” … … in a competitive market for DHT service Can multiple, competing providers coordinate?  Analogy: competing ISPs peer to give IP “dialtone” Imagine: DSPs (DHT Service Providers) do likewise  For now, assume market demand exists Investigate: federated P 4 Infrastructure (Peering Peer- to-Peer Providers) of DSPs

Requirements for a Global DHT Dialtone Customer pays its DSP for this service: Puts of accessible to all other P 4 customers Gets on keys will be fulfilled, no matter which provider serviced the put of Best effort service model put(k,v) get (k) v Customer P 4 Infrastructure DSP

Outline I.P 4 Design Spectrum II.Challenges III.Conclusion

Scenario Each DSP owns hosts, stores subset of { } Customer/provider interface: P 4 Proxy (like DNS) Assume for now DSPs all talk to each other We now discuss possible relationships … Company Home User v 1 = get(k 1 ) DSP put(k 1,v 1 ) P 4 Proxy

Possible DSP Relationships (First Two) All one DHT Existing DHT mechanisms work  No incentive for DSP to contribute resources Administrative separation (separate DHTs) DSP coded into key  right incentives DSPs store only for customers  Switching DSPs means switching keys DSP IDRest of the key

Possible DSP Relationships (Third) Now assume:  Every DSP runs own lookup infrastructure  Keys don’t encode DSP Therefore:  DSPs must exchange customers’ pairs  We believe this 3 rd relationship is the tenable one But how will it work? (For now, assume small set of top-level DSPs)

put (k, v) 2.Put-broadcasting of ; local gets 3.Put-broadcasting of keys only; forwarded gets put (k, v) put (k, v) get (k) 1.Get-broadcasting; local puts (can cache ) get (k) Different Exchange Regimes provider’s id

More on the Regimes They split put and get bandwidth differently Can and should coexist; putter chooses regime Different pricing schemes?

Outline I.P 4 Design Spectrum II.Challenges III.Conclusion

DSPs’ Incentives Incentive to be honest?  Commercial relationships; market discipline  No different from DNS or IP service today Incentive to peer? Settlements (i.e., payments between two peers):  Needed if two DSPs gain unequally from peering  Preclude caching and put-broadcast  Introduce complexity Paper argues DSPs gain equally from peering w/out settlements?

Coherence and Correctness 1. inserted by a customer must be visible to customers of other providers  Discussed earlier 2.Customers must not be able to own the same key or overwrite each other’s pairs  Inherit from existing DHTs, especially Open DHT  k=hash(v), k=(salt, pubkey), e.g.  Cryptography unaffected by # of providers

Market Structure and Scale Forest structure (ISP analogy again) Top-level DSPs do put- and get-broadcasting Children of top-level DSPs either:  Redirect customer put/get requests to top-level  Maintain a local lookup service Top-level DSPs Child DSPs

Outline I.P 4 Design Spectrum II.Challenges III.Conclusion

Conclusion P2P: technical revolution, yes. Economic novelty? A social theory of DHTs (compare with Marx): Anarchism (B.Y.O.I.) Communism (benevolent entity) Capitalism (P 4 a form of privatization) Our goals: DHT dialtone for customers, proper incentives for providers Peering arrangements necessary but not sufficient  Market requires demand, too

Appendix Slides

DSPs Gain Roughly Equally From Peering Assume DSP’s benefit proportional to:  Its customers’ benefit from reads in other DSPs  Its customers’ benefit from having their data read Case I: avg. benefit to a customer from a “get” is equal to avg. benefit from having its “put” read Case II: avg. benefits not equal. Under certain assumptions, # of “gets” in each direction equal. # from A to B (smaller fraction of larger #) # from B to A (larger fraction of smaller #) # “gets” from DSP B # “gets” from DSP A

Latency Puts: customer talks to P 4 Proxy. Low latency. For gets, separate by exchange regime:  Get-broadcast: Latency can be high But opportunistic caching can mitigate  Put-broadcast of key; forwarded get: (same.)  Put-broadcast of ; local get: All DSPs have copies of ; low latency Adaptive algorithm to decide which propagation regime is optimal for a key?

Can’t Google Do This? Sure. Will they charge for the service?  If not, great!  If so … This talk: whether P 4 infrastructure could emerge Not whether P 4 infrastructure will emerge  (We assumed market demand exists.)