DNSR: Domain Name Suffix-based Routing in Overlay Networks

Slides:



Advertisements
Similar presentations
Efficient Event-based Resource Discovery Wei Yan*, Songlin Hu*, Vinod Muthusamy +, Hans-Arno Jacobsen +, Li Zha* * Chinese Academy of Sciences, Beijing.
Advertisements

1 Scoped and Approximate Queries in a Relational Grid Information Service Dong Lu, Peter A. Dinda, Jason A. Skicewicz Prescience Lab, Dept. of Computer.
Review of a research paper on Skype
University of Cincinnati1 Towards A Content-Based Aggregation Network By Shagun Kakkar May 29, 2002.
“A Local Search Mechanism for Peer-to-Peer Networks”
Spotlighting Decentralized P2P File Sharing Archie Kuo and Ethan Le Department of Computer Science San Jose State University.
Building Low-Diameter P2P Networks Eli Upfal Department of Computer Science Brown University Joint work with Gopal Pandurangan and Prabhakar Raghavan.
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
LSDS-IR’08, October 30, Peer-to-Peer Similarity Search over Widely Distributed Document Collections Christos Doulkeridis 1, Kjetil Nørvåg 2, Michalis.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #12 LSNAT - Load Sharing NAT (RFC 2391)
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
CS 6401 Efficient Addressing Outline Addressing Subnetting Supernetting.
P2P File Sharing Systems
INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.
1 Napster & Gnutella An Overview. 2 About Napster Distributed application allowing users to search and exchange MP3 files. Written by Shawn Fanning in.
By Shobana Padmanabhan Sep 12, 2007 CSE 473 Class #4: P2P Section 2.6 of textbook (some pictures here are from the book)
GeoGrid: A scalable Location Service Network Authors: J.Zhang, G.Zhang, L.Liu Georgia Institute of Technology presented by Olga Weiss Com S 587x, Fall.
Efficient Addressing Outline Addressing Subnetting Supernetting CS 640.
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Hierarchical Routing (§5.2.6)
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
Freelib: A Self-sustainable Digital Library for Education Community Ashraf Amrou, Kurt Maly, Mohammad Zubair Computer Science Dept., Old Dominion University.
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
Kaleidoscope – Adding Colors to Kademlia Gil Einziger, Roy Friedman, Eyal Kibbar Computer Science, Technion 1.
A Membership Management Protocol for Mobile P2P Networks Mohamed Karim SBAI, Emna SALHI, Chadi BARAKAT.
CIDR Classless Inter Domain Routing Give the IP address space some breathing room! Basic idea: allocate the remaining IP addresses in variable-size blocks.
1 University of California, Irvine Done By : Ala Khalifeh (Note : Not Presented)
Pastry Antony Rowstron and Peter Druschel Presented By David Deschenes.
Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.
Peer to Peer Network Design Discovery and Routing algorithms
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.
Dijkstra-Scholten and Shavit-Francez termination algorithms
CS 347Notes081 CS 347: Parallel and Distributed Data Management Notes 08: P2P Systems.
Querying the Internet with PIER CS294-4 Paul Burstein 11/10/2003.
Decentralized Trust Management for Ad-Hoc Peer-to-Peer Networks Thomas Repantis Vana Kalogeraki Department of Computer Science & Engineering University.
Distributed Caching and Adaptive Search in Multilayer P2P Networks Chen Wang, Li Xiao, Yunhao Liu, Pei Zheng The 24th International Conference on Distributed.
CS Spring 2010 CS 414 – Multimedia Systems Design Lecture 24 – Introduction to Peer-to-Peer (P2P) Systems Klara Nahrstedt (presented by Long Vu)
Marco Conti, Enrico Gregori, Giovanni Turi Istituto di Informatica e Telematica – CNR MobiHoc ‘ Jongsoo Lee
Distributed Web Systems Peer-to-Peer Systems Lecturer Department University.
Interaction and Animation on Geolocalization Based Network Topology by Engin Arslan.
Brocade: Landmark Routing on Overlay Networks
Peer-to-Peer Information Systems Week 12: Naming
Advanced Computer Networks
PEER-TO-PEER NETWORK FAMILIES
Copyright notice © 2008 Raul Jimenez - -
CASCADE: AN ATTACK-RESISTANT DHT WITH MINIMAL HARD STATE
Domain Name System (DNS)
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
COS 461: Computer Networks
Copyright notice © 2008 Raul Jimenez - -
CHAPTER 3 Architectures for Distributed Systems
Host Multicast: A Framework for Delivering Multicast to End Users
Early Measurements of a Cluster-based Architecture for P2P Systems
EE 122: Peer-to-Peer (P2P) Networks
DHT Routing Geometries and Chord
Statistical Optimal Hash-based Longest Prefix Match
5.2 FLAT NAMING.
CS 162: P2P Networks Computer Science Division
Paraskevi Raftopoulou, Euripides G.M. Petrakis
Friendships that last Peer lifespan and its role in P2P protocols
Distributed computing deals with hardware
Joydeep Chandra, Santosh Shaw and Niloy Ganguly
Korea University of Technology and Education
Dynamic Replica Placement for Scalable Content Delivery
COS 461: Computer Networks
CS 188: Artificial Intelligence Spring 2006
A Semantic Peer-to-Peer Overlay for Web Services Discovery
Peer-to-Peer Information Systems Week 12: Naming
#02 Peer to Peer Networking
Presentation transcript:

DNSR: Domain Name Suffix-based Routing in Overlay Networks Dept. of Computer Science & Engineering. University of California - Riverside CS202 – Advanced O.S Spring ’03 DNSR: Domain Name Suffix-based Routing in Overlay Networks Demetrios Zeinalipour-Yazti

Introduction Most overlay networks don’t match the underlying topology Transcontinental connections are expensive. It would be desirable to keep the bulk of the P2P traffic within the same domain

Motivation Analyzing the Gnutella Network [D. Zeinalipour & T. Folias, cs204 Course Project] We analyzed ~300,000 IP addresses. 58.73% of Gnutella IPs belongs to only 20 ISPs. Organizing Peers into domains rather than loosely interconnecting them might be feasible

DNSR Idea DNSR:Domain-Name Suffix-based Routing Decentralized Routing Algorithm that attempts to keep P2P traffic within the same domain. DNSR defines three Level factors per peer: Sibling Factor (sfi) Parent Factor (pfi) Children Factor (cfi) DNSR also defines a similarity function -suffix

DNSR Topology Given that each node maintains the Level Factors we end up with a semi-hierarchical topology.

Joining a DNSR Topology A node obtains a random list from an out-of-band mechanism (e.g. hostcache). It probes for “best” entry point with Lookup

Searching a DNSR Topology Searching can be done with a variety of techniques (BFS, Random BFS,….) The bottom-line with all techniques is that the bulk of the traffic remains within the same domain

Experimental Setup Scenario We generate a DNSR topology and a Random Topology of 1000 nodes with following distributions We deploy the 1000 real nodes on 25 machines We run a number of queries and observe the distribution of hosts contacted in each case.

Experimental Evaluation Each node reads its settings from the filesystem All nodes are launched concurrently with ssh public/private keys making the bootstrapping easy.

Experimental Results We connect to a .rr.com host Level 0 We connect to a .rr.com host Submit 40 queries and count the number of hosts contacted C. In a random topology C matches the actual distribution of hosts In a DNSR topology most of the hosts contacted are .com hosts for level 0.

Experimental Results Level 1 For Level 1 we can see that in DNSR topology we will contact more .rr.com hosts than with a random topology. Therefore more traffic remains within same domain Sibling Factor was 66%. If it was larger then 24% would be larger

DNSR Demo Follows… Dept. of Computer Science & Engineering. University of California - Riverside DNSR Demo Follows…