CRESCENDO GEORGE S. NOMIKOS. Advisor: Dr. George Xylomenos
|
|
- Toby Joseph
- 5 years ago
- Views:
Transcription
1 CRESCENDO Implementation of Hierarchical Chord (Crescendo), according to Canon paradigm and evaluation, via simulation over realistic network topologies, of the Crescendo's advantages in comparison to Chord. GEORGE S. NOMIKOS Advisor: Dr. George Xylomenos ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS DEPARTMENT OF INFORMATICS MSc IN COMPUTER SCIENCE ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS
2 Motivation All current DHTs are Flat, non-hierarchical structures. No single point of failure, homogeneity. Decentralization, Scalability. Why Hierarchical Design? Hierarchies exist! Physical Network has hierarchy. Fault Isolation, Security. Efficient caching and bandwidth usage. Adaptation to the underlying physical network. Hierarchical storage of content. Hierarchical access control. Goal: Inherit the best of both designs Hierarchical DHTs.
3 Motivation Hierarchical DHTs Simulators offering hierarchical DHT support Maintain all the advantages of flat DHTs and add even more. None of the current simulators offer hierarchical DHT support. No other module exists. This is the first and the only hierarchical DHT implementation available. Implemented for the simulation environment OMNeT++/OverSim.
4 Chord Hash function (SHA-1) assigns each node and key an m-bit identifier. Node keys are arranged in a circle. Each node: Has links to it's previous node (predecessor) and to it's next node (successor). Maintains a routing table with up to m entries called the finger table. Runs a stabilization protocol periodically to find newly joined and failed nodes. Responsible node for a key, is the successor of the key. Finger table contains records like the following: finger[k] = first node that succeeds (n + 2k-1) mod 2m, where 1 k m, n is the current node. Example Chord Ring 10 Nodes, 5 Keys m = 6 bits
5 Canon Networks are hierarchical Canon Paradigm Recursive Structure. Construct bottom-up. Merge smaller DHTs. Multi-level hierarchies. A global ring at the top level containing all the small rings. Canon adapts to the underlying network hierarchy
6 Crescendo Crescendo, Hierarchical Chord using Canon Paradigm. Merge Multiple Rings. All original links are retained. Each node n in one ring creates a link to a node n' in another ring if and only if: (a) n' is the closest node that is at least distance 2k away for some 0 k < m (b) and n' is closer to n than any node in n` s ring. Node state: Chord Node State x Level of hierarchy. Finger Tables after the lowest level of hierarchy have very few links, according to (a), (b)
7 Crescendo Merging Procedure Crescendo Merging example for nodes 0 (Ring A) and 8 (Ring B). Node 0 links to node 2. Node 8 links to node 10 and node 12. Ring A and Ring B Chord Rings. m = 4 bits Fingers distance (+1, +2, +4, +8) After merging procedure: One Crescendo Ring, containing both A and B Rings.
8 Crescendo Finger Tables Merging Procedure, including full Finger Tables. Comparison if instead of Crescendo, we had two Chord rings, one local and one global. Two Chord rings need 32 extra links. Crescendo needs only 12 extra links. Crescendo uses almost 3 times less links than the local, global Chord rings.
9 Crescendo Two Crucial Properties Crescendo has two crucial properties Locality of intra-domain paths. When the node which starts the lookup and the destination node are in the same domain, then the lookup never leaves this domain. Convergence of inter-domain paths. When different nodes from one domain A route to the same node in another domain, all the different routes exit the domain A through the same node. This node is the closest predecessor of the target node's identifier in the domain A.
10 Crescendo Key Responsibility Crescendo changes key responsibility. Responsible node for a key is it's predecessor.
11 Realistic Network Topologies OMNeT++/OverSim offers physical network topology with limitations. No Autonomous Systems Identification Numbers (ASIDs). No routing policy weights. Crescendo requires realistic physical network topology. Autonomous Systems Identification Numbers (ASIDs) required. With ASIDs nodes can calculate the relation among themselves and other nodes. Routing policy weights required. Solution: Extend BRITE topology generator export tool and OMNeT++. Support for Realistic Network Topologies based on GT-ITM model. Support for Autonomous Systems Identification Numbers (ASIDs). Support for Routing Policy Weights. Realistic network topologies can also be used as a standalone solution for other modules that require this level of reality.
12 Crescendo Implementation More than 7000 Lines of Code (including comments) Fully documented code Doxygen documentation NED documentation Crescendo implemented as a new autonomous module. Realistic Topologies based on the GT-ITM Model. KBRTestApp extended to export analytical statistics. Supports two levels hierarchy. Low level: Local AS. High level: All AS merged. OverSim Architecture. In blue boxes the sections where new code added.
13 Crescendo Implementation Crescendo node join procedure. Node sends join local ring request to the bootstrap node with same ASID. Node joins local ring. Node sends join global ring request to it's local predecessor. Node joins global ring. Join procedure ends. Predecessor node is the node that forwards the lookup to the next level of the hierarchy. Request to join the next level ring: (a) To any node except predecessor, extra hops. (b) To predecessor, minimum hops.
14 Crescendo Correctness Simulation to check that this implementation has the Crescendo's two crucial properties. Key length 16 bits, 1000 Nodes, 4 ASIDs. Lookup for key ASIDs Keys
15 Crescendo Evaluation Simulation Parameters Two topologies 112 ASIDs, 784 Access Routers, 28 Backbone Routers. 196 ASIDs, 1372 Access Routers, 28 Backbone Routers. Two runs for each topology with different seeds. Parameter: Number of nodes in the overlay. 256, 512, 1024, 2048, for the multicast simulation. Link latency. Transit-Transit 100ms, Transit-Stub 20ms, Stub-Stub 5 ms. Extended KBRTestApp for statistics. Physical network hops, direct and overlay path. Lookup latency. ASIDs path. Overlay hops. More than 50 hours of simulation.
16 Crescendo Simulation Results Average Lookup Latency Chord flat design. Lookups do many inter-domain hops until final destination. Crescendo adapts to the underlying network hierarchy. Crescendo key responsibility, many times needed one less hop than Chord. Crescendo, intra-domain paths locality, inter-domain paths convergence.
17 Crescendo Simulation Results Physical Network Routing Stretch Chord flat design. Lookups do many inter-domain hops until final destination. Crescendo adapts to the underlying network hierarchy. Crescendo key responsibility, many times needed one less hop than Chord. Crescendo, intra-domain paths locality, inter-domain paths convergence. Crescendo, more cheap intra-domain hops, fewer expensive inter-domain hops.
18 Crescendo Simulation Results Average Overlay Network Hops Chord flat design. Lookups do many inter-domain hops until final destination. Crescendo adapts to the underlying network hierarchy. Crescendo key responsibility, many times needed one less hop than Chord. Crescendo, intra-domain paths locality, inter-domain paths convergence. Crescendo, when very few nodes in network (e.g. 1 per AS), Chord like behavior.
19 Crescendo Simulation Results Average Physical Network Hops Chord flat design. Lookups do many inter-domain hops until final destination. Crescendo adapts to the underlying network hierarchy. Crescendo key responsibility, many times needed one less hop than Chord. Crescendo, intra-domain paths locality, inter-domain paths convergence. Crescendo, more cheap intra-domain hops, fewer expensive inter-domain hops.
20 Crescendo Simulation Results Efficient bandwidth usage during multicast 112 ASIDs Network Topology Participating Nodes Hops Processed. Lookup for the same key. Overlay Network Inter-domain Hops Intra-domain Hops Chord Crescendo Chord flat design. Lookups do many inter-domain hops until final destination. Crescendo adapts to the underlying network hierarchy. Crescendo key responsibility, many times needed one less hop than Chord. Crescendo, intra-domain paths locality, inter-domain paths convergence. Crescendo, more cheap intra-domain hops, fewer expensive inter-domain hops.
21 Conclusion - Future Work Crescendo has many more advantages than Chord without extra disadvantages. Locality: Fault isolation, Security, Efficiency. Convergence: Caching, Bandwidth savings. Future Work More simulations for multicast behavior over Crescendo. Comparison of Crescendo with other DHTs. Implementation of hierarchical structure for other DHTs.
22 Thanks THANK YOU George S. Nomikos Mobile Multimedia Laboratory ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS
23 Backup Slides
24 Distributed Hash Table (DHT) Hash table distributed among a set of nodes. Partition key space by node ID. Each node responsible for a part of the key space. SHA-1 Hash function, 160 bits identifiers. Flat overlay network. Basic actions. Insert (Key, Value) Lookup (Key, Value)
25 Chord Finger Table example for Node 8. Lookup Examples. Simple Lookup. Normal Lookup, using Finger Tables. Simple Lookup O(N) Normal Lookup O(logN)
26 Chord Definition of variables for node n, using m-bit identifiers Notation Definition finger[k] First node on circle that succeeds (n + 2k-1) mod 2m,1 k m successor The next node on the identifier circle, finger[1].node predecessor The previous node on the identifier circle Node Join Procedure Example: Node 26 joins the system between nodes 21 and 32. The arcs represent the successor relationship. (a) Initial state, node 21 points to node 32. Node 26 appears and finds it's successor node 32. (b) Node 26 points to it's found successor node 32. (c) Node 26 copies all keys less than 26 from node 32. (d) The stabilize procedure updates the successor of node 21 to node 26.
27 Chord Stabilization protocol Runs periodically at each node. Handles newly joined nodes and failed nodes. Stabilization Protocol procedure: Periodically ask your successor who it's predecessor is. If the predecessor is immediately after you then it's your successor. Notify this found successor and update self. Repeat this procedure.
28 Crescendo Due to the previous two properties Crescendo offers: Fault Isolation. Security. Efficient caching and bandwidth usage. Adaptation to the underlying physical network. Hierarchical Storage of content. Hierarchical access control. Less network stretch. Less lookup latency.
29 Crescendo Implementation Crescendo Core Structure. Crescendo (simple module). CrescendoFingerTable (simple module). CrescendoSuccessorList (simple module). CrescendoModules (compound module). CrescendoMessages. New code added to the following core OMNeT++ structures. CrescendoModules Structure ctopology: Routing Policy Weights support. New code added to the following core OverSim structures. INETUnderlay: Routing Policy Weights, ASIDs, Realistic Network Topologies. GlobalNodeList, BootstrapList: ASIDs, Hierarchy support. Common API, BaseOverlay: ASIDs, Hierarchy support. KBRTestApp: Heavily extended to export analytical statistics. Bash and Java parsers: To parse the simulation results.
30 Software Used OMNeT++ 4 OverSim BRITE GT-ITM INET for OverSim Arch Linux Doxygen
31 Realistic Network Topologies
March 10, Distributed Hash-based Lookup. for Peer-to-Peer Systems. Sandeep Shelke Shrirang Shirodkar MTech I CSE
for for March 10, 2006 Agenda for Peer-to-Peer Sytems Initial approaches to Their Limitations CAN - Applications of CAN Design Details Benefits for Distributed and a decentralized architecture No centralized
More informationChord : A Scalable Peer-to-Peer Lookup Protocol for Internet Applications
: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashock, Frank Dabek, Hari Balakrishnan March 4, 2013 One slide
More informationP2P Network Structured Networks: Distributed Hash Tables. Pedro García López Universitat Rovira I Virgili
P2P Network Structured Networks: Distributed Hash Tables Pedro García López Universitat Rovira I Virgili Pedro.garcia@urv.net Index Description of CHORD s Location and routing mechanisms Symphony: Distributed
More informationCompSci 356: Computer Network Architectures Lecture 21: Overlay Networks Chap 9.4. Xiaowei Yang
CompSci 356: Computer Network Architectures Lecture 21: Overlay Networks Chap 9.4 Xiaowei Yang xwy@cs.duke.edu Overview Problem Evolving solutions IP multicast Proxy caching Content distribution networks
More informationCS555: Distributed Systems [Fall 2017] Dept. Of Computer Science, Colorado State University
CS 555: DISTRIBUTED SYSTEMS [P2P SYSTEMS] Shrideep Pallickara Computer Science Colorado State University Frequently asked questions from the previous class survey Byzantine failures vs malicious nodes
More informationLecture 6: Overlay Networks. CS 598: Advanced Internetworking Matthew Caesar February 15, 2011
Lecture 6: Overlay Networks CS 598: Advanced Internetworking Matthew Caesar February 15, 2011 1 Overlay networks: Motivations Protocol changes in the network happen very slowly Why? Internet is shared
More informationAthens University of Economics and Business. Dept. of Informatics
Athens University of Economics and Business Athens University of Economics and Business Dept. of Informatics B.Sc. Thesis Project report: Implementation of the PASTRY Distributed Hash Table lookup service
More informationOverSim. A Flexible Overlay Network Simulation Framework. Ingmar Baumgart, Bernhard Heep, Stephan Krause
OverSim A Flexible Overlay Network Simulation Framework Ingmar Baumgart, Bernhard Heep, IEEE Global Internet Symposium 2007, Anchorage, AK, USA Requirements Overlay Flexibility Scalability Underlay Heterogeneity
More informationArchitectures for Distributed Systems
Distributed Systems and Middleware 2013 2: Architectures Architectures for Distributed Systems Components A distributed system consists of components Each component has well-defined interface, can be replaced
More informationGoals. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Solution. Overlay Networks: Motivations.
Goals CS : Introduction to Computer Networks Overlay Networks and PP Networks Ion Stoica Computer Science Division Department of lectrical ngineering and Computer Sciences University of California, Berkeley
More informationContent Overlays. Nick Feamster CS 7260 March 12, 2007
Content Overlays Nick Feamster CS 7260 March 12, 2007 Content Overlays Distributed content storage and retrieval Two primary approaches: Structured overlay Unstructured overlay Today s paper: Chord Not
More informationEECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Overlay Networks: Motivations
EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley
More informationCSE 5306 Distributed Systems
CSE 5306 Distributed Systems Naming Jia Rao http://ranger.uta.edu/~jrao/ 1 Naming Names play a critical role in all computer systems To access resources, uniquely identify entities, or refer to locations
More informationPeer to Peer Networks
Sungkyunkwan University Peer to Peer Networks Prepared by T. Le-Duc and H. Choo Copyright 2000-2018 Networking Laboratory P2P Applications Traditional P2P applications: for file sharing BitTorrent, Emule
More informationOverlay Networks. Behnam Momeni Computer Engineering Department Sharif University of Technology
CE443 Computer Networks Overlay Networks Behnam Momeni Computer Engineering Department Sharif University of Technology Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer
More informationCIS 700/005 Networking Meets Databases
Announcements CIS / Networking Meets Databases Boon Thau Loo Spring Lecture Paper summaries due at noon today. Office hours: Wed - pm ( Levine) Project proposal: due Feb. Student presenter: rd Jan: A Scalable
More informationScalability In Peer-to-Peer Systems. Presented by Stavros Nikolaou
Scalability In Peer-to-Peer Systems Presented by Stavros Nikolaou Background on Peer-to-Peer Systems Definition: Distributed systems/applications featuring: No centralized control, no hierarchical organization
More informationCSE 5306 Distributed Systems. Naming
CSE 5306 Distributed Systems Naming 1 Naming Names play a critical role in all computer systems To access resources, uniquely identify entities, or refer to locations To access an entity, you have resolve
More informationOverlay Networks: Motivations. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Motivations (cont d) Goals.
Overlay Networks: Motivations CS : Introduction to Computer Networks Overlay Networks and PP Networks Ion Stoica Computer Science Division Department of lectrical ngineering and Computer Sciences University
More informationChord: A Scalable Peer-to-peer Lookup Service For Internet Applications
Chord: A Scalable Peer-to-peer Lookup Service For Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan Presented by Jibin Yuan ION STOICA Professor of CS
More informationL3S Research Center, University of Hannover
, University of Hannover Dynamics of Wolf-Tilo Balke and Wolf Siberski 21.11.2007 *Original slides provided by S. Rieche, H. Niedermayer, S. Götz, K. Wehrle (University of Tübingen) and A. Datta, K. Aberer
More informationDistributed Hash Tables
Distributed Hash Tables Chord Smruti R. Sarangi Department of Computer Science Indian Institute of Technology New Delhi, India Smruti R. Sarangi Chord 1/29 Outline Overview 1 Overview 2 3 Smruti R. Sarangi
More informationDHT Overview. P2P: Advanced Topics Filesystems over DHTs and P2P research. How to build applications over DHTS. What we would like to have..
DHT Overview P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar DHTs provide a simple primitive put (key,value) get (key) Data/Nodes distributed over a key-space High-level idea: Move
More informationP2P Network Structured Networks: Distributed Hash Tables. Pedro García López Universitat Rovira I Virgili
P2P Network Structured Networks: Distributed Hash Tables Pedro García López Universitat Rovira I Virgili Pedro.garcia@urv.net Index Introduction to DHT s Origins of structured overlays Case studies Chord
More informationMotivation. The Impact of DHT Routing Geometry on Resilience and Proximity. Different components of analysis. Approach:Component-based analysis
The Impact of DHT Routing Geometry on Resilience and Proximity Presented by Karthik Lakshminarayanan at P2P Systems class (Slides liberally borrowed from Krishna s SIGCOMM talk) Krishna Gummadi, Ramakrishna
More informationPage 1. How Did it Start?" Model" Main Challenge" CS162 Operating Systems and Systems Programming Lecture 24. Peer-to-Peer Networks"
How Did it Start?" CS162 Operating Systems and Systems Programming Lecture 24 Peer-to-Peer Networks" A killer application: Napster (1999) Free music over the Internet Key idea: share the storage and bandwidth
More informationThe Impact of DHT Routing Geometry on Resilience and Proximity. Acknowledgement. Motivation
The Impact of DHT Routing Geometry on Resilience and Proximity Presented by Noorullah Moghul Krishna Gummadi, Ramakrishna Gummadi, Sylvia Ratnasamy, Steve Gribble, Scott Shenker, Ion Stoica Acknowledgement
More informationLECT-05, S-1 FP2P, Javed I.
A Course on Foundations of Peer-to-Peer Systems & Applications LECT-, S- FPP, javed@kent.edu Javed I. Khan@8 CS /99 Foundation of Peer-to-Peer Applications & Systems Kent State University Dept. of Computer
More informationLast Time. CSE 486/586 Distributed Systems Distributed Hash Tables. What We Want. Today s Question. What We Want. What We Don t Want C 1
Last Time Distributed Systems Distributed Hash Tables Evolution of peer-to-peer Central directory (Napster) Query flooding (Gnutella) Hierarchical overlay (Kazaa, modern Gnutella) BitTorrent Focuses on
More informationPeer to Peer Networks
Sungkyunkwan University Peer to Peer Networks Prepared by T. Le-Duc and H. Choo Copyright 2000-2017 Networking Laboratory Presentation Outline 2.1 Introduction 2.2 Client-Server Paradigm 2.3 Peer-To-Peer
More informationC 1. Last Time. CSE 486/586 Distributed Systems Distributed Hash Tables. Today s Question. What We Want. What We Want. What We Don t Want
Last Time Distributed Systems Distributed Hash Tables Evolution of peer-to-peer Central directory (Napster) Query flooding (Gnutella) Hierarchical overlay (Kazaa, modern Gnutella) BitTorrent Focuses on
More informationEE 122: Peer-to-Peer Networks
EE 122: Peer-to-Peer Networks Ion Stoica (and Brighten Godfrey) TAs: Lucian Popa, David Zats and Ganesh Ananthanarayanan http://inst.eecs.berkeley.edu/~ee122/ (Materials with thanks to Vern Paxson, Jennifer
More informationThree Layer Hierarchical Model for Chord
Three Layer Hierarchical Model for Chord Waqas A. Imtiaz, Shimul Shil, A.K.M Mahfuzur Rahman Abstract Increasing popularity of decentralized Peer-to-Peer (P2P) architecture emphasizes on the need to come
More informationFlooded Queries (Gnutella) Centralized Lookup (Napster) Routed Queries (Freenet, Chord, etc.) Overview N 2 N 1 N 3 N 4 N 8 N 9 N N 7 N 6 N 9
Peer-to-Peer Networks -: Computer Networking L-: PP Typically each member stores/provides access to content Has quickly grown in popularity Bulk of traffic from/to CMU is Kazaa! Basically a replication
More informationBayeux: An Architecture for Scalable and Fault Tolerant Wide area Data Dissemination
Bayeux: An Architecture for Scalable and Fault Tolerant Wide area Data Dissemination By Shelley Zhuang,Ben Zhao,Anthony Joseph, Randy Katz,John Kubiatowicz Introduction Multimedia Streaming typically involves
More information: Scalable Lookup
6.824 2006: Scalable Lookup Prior focus has been on traditional distributed systems e.g. NFS, DSM/Hypervisor, Harp Machine room: well maintained, centrally located. Relatively stable population: can be
More informationOverlay and P2P Networks. Structured Networks and DHTs. Prof. Sasu Tarkoma
Overlay and P2P Networks Structured Networks and DHTs Prof. Sasu Tarkoma 6.2.2014 Contents Today Semantic free indexing Consistent Hashing Distributed Hash Tables (DHTs) Thursday (Dr. Samu Varjonen) DHTs
More informationChordNet: A Chord-based self-organizing super-peer network
ChordNet: A Chord-based self-organizing super-peer network Dennis Schwerdel, Matthias Priebe, Paul Müller Dennis Schwerdel University of Kaiserslautern Department of Computer Science Integrated Communication
More informationThe InfoMatrix: Distributed Indexing in a P2P Environment
The InfoMatrix: Distributed Indexing in a P2P Environment ABSTRACT Ref. No: 154 We study the problem of enabling efficient queries over dynamic data distributed over a wide-area peer-to-peer network. We
More informationAn Expresway over Chord in Peer-to-Peer Systems
An Expresway over Chord in Peer-to-Peer Systems Hathai Tanta-ngai Technical Report CS-2005-19 October 18, 2005 Faculty of Computer Science 6050 University Ave., Halifax, Nova Scotia, B3H 1W5, Canada An
More informationTelematics Chapter 9: Peer-to-Peer Networks
Telematics Chapter 9: Peer-to-Peer Networks Beispielbild User watching video clip Server with video clips Application Layer Presentation Layer Application Layer Presentation Layer Session Layer Session
More informationLecture 6: Securing Distributed and Networked Systems. CS 598: Network Security Matthew Caesar March 12, 2013
Lecture 6: Securing Distributed and Networked Systems CS 598: Network Security Matthew Caesar March 12, 2013 1 Today: Distributed Internet Services Previous cycle: how to build Internet services that run
More informationDistributed Hash Table
Distributed Hash Table P2P Routing and Searching Algorithms Ruixuan Li College of Computer Science, HUST rxli@public.wh.hb.cn http://idc.hust.edu.cn/~rxli/ In Courtesy of Xiaodong Zhang, Ohio State Univ
More informationDISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES
DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES Dr. Jack Lange Computer Science Department University of Pittsburgh Fall 2015 Outline System Architectural Design Issues Centralized Architectures Application
More informationCS 640 Introduction to Computer Networks. Today s lecture. What is P2P? Lecture30. Peer to peer applications
Introduction to Computer Networks Lecture30 Today s lecture Peer to peer applications Napster Gnutella KaZaA Chord What is P2P? Significant autonomy from central servers Exploits resources at the edges
More informationPEER-TO-PEER NETWORKS, DHTS, AND CHORD
PEER-TO-PEER NETWORKS, DHTS, AND CHORD George Porter May 25, 2018 ATTRIBUTION These slides are released under an Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0) Creative Commons license
More informationCS514: Intermediate Course in Computer Systems
Distributed Hash Tables (DHT) Overview and Issues Paul Francis CS514: Intermediate Course in Computer Systems Lecture 26: Nov 19, 2003 Distributed Hash Tables (DHT): Overview and Issues What is a Distributed
More informationBuilding a low-latency, proximity-aware DHT-based P2P network
Building a low-latency, proximity-aware DHT-based P2P network Ngoc Ben DANG, Son Tung VU, Hoai Son NGUYEN Department of Computer network College of Technology, Vietnam National University, Hanoi 144 Xuan
More informationA Scalable Content- Addressable Network
A Scalable Content- Addressable Network In Proceedings of ACM SIGCOMM 2001 S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker Presented by L.G. Alex Sung 9th March 2005 for CS856 1 Outline CAN basics
More informationSaarland University Faculty of Natural Sciences and Technology I Department of Computer Science. Masters Thesis
Saarland University Faculty of Natural Sciences and Technology I Department of Computer Science Masters Thesis Experimental Comparison of Byzantine Fault Tolerant Distributed Hash Tables submitted by Supriti
More informationSEMESTER 2 Chapter 3 Introduction to Dynamic Routing Protocols V 4.0
SEMESTER 2 Chapter 3 Introduction to Dynamic Routing Protocols V 4.0 3.1.1 What are the four routing RIP, RIPv2, EIGRP, OSPFv2 protocols that are the focus of this course? 3.1.1.2 What are routing protocols?
More informationPeer to peer systems: An overview
Peer to peer systems: An overview Gaurav Veda (Y1148) gveda@cse.iitk.ac.in Computer Science & Engineering Indian Institute of Technology Kanpur, UP, INDIA - 208016 Abstract Peer-to-peer (p2p) systems is
More informationDistributed Systems Final Exam
15-440 Distributed Systems Final Exam Name: Andrew: ID December 12, 2011 Please write your name and Andrew ID above before starting this exam. This exam has 14 pages, including this title page. Please
More informationCSE 486/586 Distributed Systems
CSE 486/586 Distributed Systems Distributed Hash Tables Slides by Steve Ko Computer Sciences and Engineering University at Buffalo CSE 486/586 Last Time Evolution of peer-to-peer Central directory (Napster)
More informationSearching for Shared Resources: DHT in General
1 ELT-53207 P2P & IoT Systems Searching for Shared Resources: DHT in General Mathieu Devos Tampere University of Technology Department of Electronics and Communications Engineering Based on the original
More informationSearching for Shared Resources: DHT in General
1 ELT-53206 Peer-to-Peer Networks Searching for Shared Resources: DHT in General Mathieu Devos Tampere University of Technology Department of Electronics and Communications Engineering Based on the original
More informationDistributed File Systems: An Overview of Peer-to-Peer Architectures. Distributed File Systems
Distributed File Systems: An Overview of Peer-to-Peer Architectures Distributed File Systems Data is distributed among many sources Ex. Distributed database systems Frequently utilize a centralized lookup
More informationBrocade: Landmark Routing on Peer to Peer Networks. Ling Huang, Ben Y. Zhao, Yitao Duan, Anthony Joseph, John Kubiatowicz
Brocade: Landmark Routing on Peer to Peer Networks Ling Huang, Ben Y. Zhao, Yitao Duan, Anthony Joseph, John Kubiatowicz State of the Art Routing High dimensionality and coordinate-based P2P routing Decentralized
More informationFinding Data in the Cloud using Distributed Hash Tables (Chord) IBM Haifa Research Storage Systems
Finding Data in the Cloud using Distributed Hash Tables (Chord) IBM Haifa Research Storage Systems 1 Motivation from the File Systems World The App needs to know the path /home/user/my pictures/ The Filesystem
More information416 Distributed Systems. Mar 3, Peer-to-Peer Part 2
416 Distributed Systems Mar 3, Peer-to-Peer Part 2 Scaling Problem Millions of clients server and network meltdown 2 P2P System Leverage the resources of client machines (peers) Traditional: Computation,
More informationCPSC 426/526. P2P Lookup Service. Ennan Zhai. Computer Science Department Yale University
CPSC 4/5 PP Lookup Service Ennan Zhai Computer Science Department Yale University Recall: Lec- Network basics: - OSI model and how Internet works - Socket APIs red PP network (Gnutella, KaZaA, etc.) UseNet
More informationTurning Heterogeneity into an Advantage in Overlay Routing
Turning Heterogeneity into an Advantage in Overlay Routing Zhichen Xu Hewlett-Packard Laboratories 50 Page Mill Rd Palo Alto, CA 9404 Email: zhichen@hpl.hp.com Mallik Mahalingam VMware Inc. 45 Porter Drive
More informationInternet Indirection Infrastructure (i3) Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana. UC Berkeley SIGCOMM 2002
Internet Indirection Infrastructure (i3) Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana UC Berkeley SIGCOMM 2002 Motivations Today s Internet is built around a unicast pointto-point
More informationReliable End System Multicasting with a Heterogeneous Overlay Network
Reliable End System Multicasting with a Heterogeneous Overlay Network Jianjun Zhang, Ling Liu, Calton Pu and Mostafa Ammar College of Computing Georgia Institute of Technology Atlanta, GA 333, U.S.A. {zhangjj,
More informationApplication Layer Multicast For Efficient Peer-to-Peer Applications
Application Layer Multicast For Efficient Peer-to-Peer Applications Adam Wierzbicki 1 e-mail: adamw@icm.edu.pl Robert Szczepaniak 1 Marcin Buszka 1 1 Polish-Japanese Institute of Information Technology
More informationSymphony. Symphony. Acknowledgement. DHTs: : The Big Picture. Spectrum of DHT Protocols. Distributed Hashing in a Small World
Distributed Hashing in a Small World Gurmeet Singh Manku Stanford University with Mayank Bawa and Prabhakar Raghavan Acknowledgement The following slides are borrowed from the author s talk at USITS 2003.
More informationEE 122: Peer-to-Peer (P2P) Networks. Ion Stoica November 27, 2002
EE 122: Peer-to-Peer (P2P) Networks Ion Stoica November 27, 22 How Did it Start? A killer application: Naptser - Free music over the Internet Key idea: share the storage and bandwidth of individual (home)
More informationDISTRIBUTED SYSTEMS [COMP9243] Lecture 9a: Naming WHAT IS NAMING? Name: Entity: Slide 3. Slide 1. Address: Identifier:
BASIC CONCEPTS DISTRIBUTED SYSTEMS [COMP9243] Name: String of bits or characters Refers to an entity Slide 1 Lecture 9a: Naming ➀ Basic Concepts ➁ Naming Services ➂ Attribute-based Naming (aka Directory
More informationHybrid Overlay Structure Based on Random Walks
Hybrid Overlay Structure Based on Random Walks Ruixiong Tian 1,, Yongqiang Xiong 2, Qian Zhang 2,BoLi 3, Ben Y. Zhao 4, and Xing Li 1 1 Department of Electronic Engineering, Tsinghua University 2 Microsoft
More informationDISTRIBUTED SYSTEMS CSCI 4963/ /4/2015
1 DISTRIBUTED SYSTEMS CSCI 4963/6963 12/4/2015 2 Info Quiz 7 on Tuesday. Project 2 submission URL is posted on the web site Submit your source code and project report (PDF!!!) in a single zip file. If
More informationContent Overlays (continued) Nick Feamster CS 7260 March 26, 2007
Content Overlays (continued) Nick Feamster CS 7260 March 26, 2007 Administrivia Quiz date Remaining lectures Interim report PS 3 Out Friday, 1-2 problems 2 Structured vs. Unstructured Overlays Structured
More informationMotivation for peer-to-peer
Peer-to-peer systems INF 5040 autumn 2015 lecturer: Roman Vitenberg INF5040, Frank Eliassen & Roman Vitenberg 1 Motivation for peer-to-peer Ø Inherent restrictions of the standard client/ server model
More informationDistributed Hash Tables
KTH ROYAL INSTITUTE OF TECHNOLOGY Distributed Hash Tables Distributed Hash Tables Vladimir Vlassov Large scale data bases hundreds of servers High churn rate servers will come and go Benefits fault tolerant
More informationNaming. Distributed Systems IT332
Naming Distributed Systems IT332 2 Outline Names, Identifier, and Addresses Flat Naming Structured Naming 3 Names, Addresses and Identifiers A name is used to refer to an entity An address is a name that
More informationHandling Churn in a DHT
Handling Churn in a DHT Sean Rhea, Dennis Geels, Timothy Roscoe, and John Kubiatowicz UC Berkeley and Intel Research Berkeley What s a DHT? Distributed Hash Table Peer-to-peer algorithm to offering put/get
More informationLecture 8: Application Layer P2P Applications and DHTs
Lecture 8: Application Layer P2P Applications and DHTs COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016,
More informationScalable overlay Networks
overlay Networks Dr. Samu Varjonen 1 Contents Course overview Lectures Assignments/Exercises 2 Course Overview Overlay networks and peer-to-peer technologies have become key components for building large
More informationCSCD 433/533 Advanced Networks Spring 2016
CSCD 433/533 Advanced Networks Spring 2016 Lecture 13 Router Algorithms and Design Chapter 5 1 Topics Router Algorithms Routing in General Hierarchical routing Interior Gateway Protocols OSPF mention of
More informationIntroduction to P2P Computing
Introduction to P2P Computing Nicola Dragoni Embedded Systems Engineering DTU Compute 1. Introduction A. Peer-to-Peer vs. Client/Server B. Overlay Networks 2. Common Topologies 3. Data Location 4. Gnutella
More informationIntroduction to OSPF
Introduction to OSPF 1 OSPF Open Shortest Path First Link state or SPF technology Developed by OSPF working group of IETF (RFC 1247) OSPFv2 standard described in RFC2328 Designed for: TCP/IP environment
More informationCS 640: Introduction to Computer Networks. Intra-domain routing. Inter-domain Routing: Hierarchy. Aditya Akella
CS 640: Introduction to Computer Networks Aditya Akella Lecture 11 - Inter-Domain Routing - BGP (Border Gateway Protocol) Intra-domain routing The Story So Far Routing protocols generate the forwarding
More informationInter-Autonomous-System Routing: Border Gateway Protocol
Inter-Autonomous-System Routing: Border Gateway Protocol Antonio Carzaniga Faculty of Informatics University of Lugano June 14, 2005 Outline Hierarchical routing BGP Routing Routing Goal: each router u
More informationA Structured Overlay for Non-uniform Node Identifier Distribution Based on Flexible Routing Tables
A Structured Overlay for Non-uniform Node Identifier Distribution Based on Flexible Routing Tables Takehiro Miyao, Hiroya Nagao, Kazuyuki Shudo Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku,
More information15-744: Computer Networking P2P/DHT
15-744: Computer Networking P2P/DHT Overview P2P Lookup Overview Centralized/Flooded Lookups Routed Lookups Chord Comparison of DHTs 2 Peer-to-Peer Networks Typically each member stores/provides access
More informationFinding Data in the Cloud using Distributed Hash Tables (Chord) IBM Haifa Research Storage Systems
Finding Data in the Cloud using Distributed Hash Tables (Chord) IBM Haifa Research Storage Systems 1 In File Systems The App needs to know the path /home/user/my pictures/ The Filesystem looks up the directory
More informationDistributed Hash Tables: Chord
Distributed Hash Tables: Chord Brad Karp (with many slides contributed by Robert Morris) UCL Computer Science CS M038 / GZ06 12 th February 2016 Today: DHTs, P2P Distributed Hash Tables: a building block
More informationSlides for Chapter 10: Peer-to-Peer Systems
Slides for Chapter 10: Peer-to-Peer Systems From Coulouris, Dollimore, Kindberg and Blair Distributed Systems: Concepts and Design Edition 5, Addison-Wesley 2012 Overview of Chapter Introduction Napster
More informationNaming. Naming. Naming versus Locating Entities. Flat Name-to-Address in a LAN
Naming Naming Tanenbaum Ch. 5 Distributed Software Systems CS 707 A name in a distributed system is a string of bits or characters that is used to refer to an entity Types of names: Address: an access
More information08 Distributed Hash Tables
08 Distributed Hash Tables 2/59 Chord Lookup Algorithm Properties Interface: lookup(key) IP address Efficient: O(log N) messages per lookup N is the total number of servers Scalable: O(log N) state per
More informationIntroduction to Peer-to-Peer Systems
Introduction Introduction to Peer-to-Peer Systems Peer-to-peer (PP) systems have become extremely popular and contribute to vast amounts of Internet traffic PP basic definition: A PP system is a distributed
More informationPath Optimization in Stream-Based Overlay Networks
Path Optimization in Stream-Based Overlay Networks Peter Pietzuch, prp@eecs.harvard.edu Jeff Shneidman, Jonathan Ledlie, Mema Roussopoulos, Margo Seltzer, Matt Welsh Systems Research Group Harvard University
More informationBGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Daniel Zappala CS 460 Computer Networking Brigham Young University 2/20 Scaling Routing for the Internet scale 200 million destinations - can t store all destinations or all prefixes in routing tables
More informationDistributed Systems. 17. Distributed Lookup. Paul Krzyzanowski. Rutgers University. Fall 2016
Distributed Systems 17. Distributed Lookup Paul Krzyzanowski Rutgers University Fall 2016 1 Distributed Lookup Look up (key, value) Cooperating set of nodes Ideally: No central coordinator Some nodes can
More informationChord: A Scalable Peer-to-peer Lookup Service for Internet Applications
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan Presented by Veranika Liaukevich Jacobs University
More informationCS 347 Parallel and Distributed Data Processing
CS 347 Parallel and Distributed Data Processing Spring 2016 Notes 9: Peer-to-Peer Systems Previous Topics Data Database design Queries Query processing Localization Operators Optimization Transactions
More informationPeer-to-Peer (P2P) Systems
Peer-to-Peer (P2P) Systems What Does Peer-to-Peer Mean? A generic name for systems in which peers communicate directly and not through a server Characteristics: decentralized self-organizing distributed
More informationStructured Peer-to-Peer Networks
Structured Peer-to-Peer Networks The P2P Scaling Problem Unstructured P2P Revisited Distributed Indexing Fundamentals of Distributed Hash Tables DHT Algorithms Chord Pastry Can Programming a DHT Graphics
More informationOnehopMANET: One-hop Structured P2P over Mobile ad hoc Networks
2014 2014 Eighth Eighth International Conference Next on Next Generation Mobile Mobile Applications, Apps, Services Services and and Technologies OnehopMANET: One-hop Structured P2P over Mobile ad hoc
More informationOverlay Networks in ScaleNet
Overlay Networks in ScaleNet Dipl-Inform. Ingmar Baumgart Prof. Dr. Martina Zitterbart VDE ITG 5.2.1 Fachgruppentreffen, Ericsson, Aachen, 5.5.06, The ScaleNet Project : Scalable, efficient and flexible
More informationScalable Information-Sharing Network Management Nina X. Guo
Computer Science and Artificial Intelligence Laboratory Technical Report MIT-CSAIL-TR-2011-030 June 7, 2011 Scalable Information-Sharing Network Management Nina X. Guo massachusetts institute of technology,
More information