Review session For DS final exam.

Slides:



Advertisements
Similar presentations
P2P data retrieval DHT (Distributed Hash Tables) Partially based on Hellerstein’s presentation at VLDB2004.
Advertisements

Peer to Peer and Distributed Hash Tables
P2P Systems and Distributed Hash Tables Section COS 461: Computer Networks Spring 2011 Mike Freedman
Peer-to-Peer Distributed Search. Peer-to-Peer Networks A pure peer-to-peer network is a collection of nodes or peers that: 1.Are autonomous: participants.
Project in Computer Security Integrating TOR’s attacks into the I2P darknet Chen Avnery Amihay Vinter.
Topics in Reliable Distributed Systems Lecture 2, Fall Dr. Idit Keidar.
Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications Stoica et al. Presented by Tam Chantem March 30, 2007.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek and Hari alakrishnan.
Freenet A Distributed Anonymous Information Storage and Retrieval System I Clarke O Sandberg I Clarke O Sandberg B WileyT W Hong.
Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.
1 CS 194: Distributed Systems Distributed Hash Tables Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer.
Peer-to-Peer Networks Slides largely adopted from Ion Stoica’s lecture at UCB.
File Sharing : Hash/Lookup Yossi Shasho (HW in last slide) Based on Chord: A Scalable Peer-to-peer Lookup Service for Internet ApplicationsChord: A Scalable.
ICS362 Distributed Systems Dr Ken Cosh Week 5. Review Communication – Fundamentals – Remote Procedure Calls (RPC) – Message Oriented Communication – Stream.
Chapter 16 – DNS. DNS Domain Name Service This service allows client machines to resolve computer names (domain names) to IP addresses DNS works at the.
Network Layer (3). Node lookup in p2p networks Section in the textbook. In a p2p network, each node may provide some kind of service for other.
By Shobana Padmanabhan Sep 12, 2007 CSE 473 Class #4: P2P Section 2.6 of textbook (some pictures here are from the book)
BitTorrent How it applies to networking. What is BitTorrent P2P file sharing protocol Allows users to distribute large amounts of data without placing.
DNS (Domain Name System) Protocol On the Internet, the DNS associates various sorts of information with domain names. A domain name is a meaningful and.
Distributed Systems Concepts and Design Chapter 10: Peer-to-Peer Systems Bruce Hammer, Steve Wallis, Raymond Ho.
October 8, 2015 University of Tulsa - Center for Information Security Microsoft Windows 2000 DNS October 8, 2015.
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.
1 Distributed Hash Tables (DHTs) Lars Jørgen Lillehovde Jo Grimstad Bang Distributed Hash Tables (DHTs)
Node Lookup in P2P Networks. Node lookup in p2p networks In a p2p network, each node may provide some kind of service for other nodes and also will ask.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.
Lecture 2 Distributed Hash Table
1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.
Node Lookup in P2P Networks. Node lookup in p2p networks Section in the textbook. In a p2p network, each node may provide some kind of service.
CS Spring 2014 CS 414 – Multimedia Systems Design Lecture 37 – Introduction to P2P (Part 1) Klara Nahrstedt.
Firewalls A brief introduction to firewalls. What does a Firewall do? Firewalls are essential tools in managing and controlling network traffic Firewalls.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
Chapter 29 Peer-to-Peer Paradigm Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
CS Spring 2010 CS 414 – Multimedia Systems Design Lecture 24 – Introduction to Peer-to-Peer (P2P) Systems Klara Nahrstedt (presented by Long Vu)
Domain Name System: DNS To identify an entity, TCP/IP protocols use the IP address, which uniquely identifies the Connection of a host to the Internet.
Peer-to-Peer Information Systems Week 12: Naming
Understand Names Resolution
Introduction to Information Security
IP and MAC Addresses, DNS Servers
School of Computing Clemson University Fall, 2012
Enabling Secure Internet Access with TMG
What’s the relationship here?
CS 268: Lecture 22 (Peer-to-Peer Networks)
CSE 486/586 Distributed Systems Distributed Hash Tables
IMPLEMENTING NAME RESOLUTION USING DNS
Distributed Hash Tables
COS 461: Computer Networks
CPS 512 midterm exam #1, 10/5/17 Your name please: NetID:_______ Sign for your honor:____________________________.
Distributed Systems CDN & Peer-to-Peer.
Internet Networking recitation #12
Welcome To : Group 1 VC Presentation
Net 323 D: Networks Protocols
Computer Networks Lesson 3.
EE 122: Peer-to-Peer (P2P) Networks
DHT Routing Geometries and Chord
5.2 FLAT NAMING.
Prof. Leonardo Mostarda University of Camerino
CS 162: P2P Networks Computer Science Division
P2P Systems and Distributed Hash Tables
Unit 1.4 Wired and Wireless Networks Lesson 3
AbbottLink™ - IP Address Overview
COS 461: Computer Networks
Computer Networks Lesson 3.
COMPUTER NETWORKS PRESENTATION
WJEC GCSE Computer Science
Consistent Hashing and Distributed Hash Table
CSE 486/586 Distributed Systems Distributed Hash Tables
A Scalable Peer-to-peer Lookup Service for Internet Applications
Lecture 4a Mobile IP 1.
Peer-to-Peer Information Systems Week 12: Naming
#02 Peer to Peer Networking
Presentation transcript:

Review session For DS final exam

[BitTorrent] Frozen network You start downloading a big torrent that has 2 seeders and 100 leechers according to the tracker. Then you let the download continue and you go to sleep. When you wake up in the morning, you are shocked to see that your torrent sits at 74.7% completion and doesn’t budge. Moreover, everybody else in the swarm also sits at 74.7%. What could have possibly led to this situation? (Assume that there is nothing wrong with your internet connection.) Explain what would happen if, at this time, a new peer who has none of the pieces joins the swarm. What can you say about the download speed of that peer?

[BitTorrent] Partial downloads You want to download one specific song over BitTorrent. You find a torrent that advertises that song. On the webpage, the tracker reports “0 seeders, 1000 leechers”. Is there a chance that you could use this torrent to get your song? Why?

[Anonymity] VPN services There are some VPN (Virtual Private Network) operators that claim to give you anonymity in your activities, including BitTorrent. Essentially, you connect to the VPN provider, and all your network data will be sent encrypted to them, and they will forward the data (unencrypted) to their destination. So, your BitTorrent activity will appear as if it came from the VPN service provider, instead of you. Why is this less anonymous than Tor? https://torrentfreak.com/vpn-anonymous-review-160220/ https://torrentfreak.com/researchers-issue-security-warning-over-android-vpn-apps-170125/

[Anonymity] Blocking Tor users Let’s assume you are the administrator of a webpage, and you see that only people with malicious intent connect to your webpage from Tor, so you would like to block all Tor users from accessing your webpage. What would you do?

[Anonymity] Inbound block Due to strict firewall settings, all inbound connections are blocked on your machine. You can open connections to others, but others can’t connect to you. Can you still visit webpages using Tor? Why?

Chord Consider the illustration of a Chord DHT, comprised of only 5 nodes. We show the finger tables for each node (i.e., the particular id distribution from which a node’s routing table neighbors should be drawn), but we don’t actually yet fill in the routing tables. Each node may be storing some items according to the Chord assignment rule (remember that Chord assigns keys to nodes in the same way as consistent hashing does, i.e., a successor mod N relationship). (a) Fill in the routing table for the node with id 1 above. (b) List the node(s) that will receive a query from node 1 for item 5 (i.e., the item named by key 5) (c) Suppose node 4 crashes, and the network converges to a new routing state. List the node(s) that will receive a query from node 7 for item 5. 

DNS (1) Describe one scenario where you would prefer short vs. long TTLs for DNS records (TTL refers to Time-To-Live, which is the duration for which the record can be cached) (2) In what scenarios, is it worth caching failed name resolutions (e.g., for mistyped domain names)? (3) When should a DNS server support recursive vs. iterative DNS queries? (When answering a recursive DNS query, the DNS server returns the IP address of the machine matching the name, while with a iterative DNS query, the name server can return a pointer to another name server responsible for a subdomain containing the name being resolved.)