Focus on Distributed Hash Tables Distributed hash tables (DHT) provide resource locating and routing in peer-to-peer networks –But, more than object locating.

Slides:

Advertisements

Similar presentations

MMT (Multi Meshed Tree) Protocols for Cognitive Airborne Networks Nirmala Shenoy Lab for Wireless Networking and Security Rochester Institute of Technology.

Advertisements

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

Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.

Cs/ee 143 Communication Networks Chapter 6 Internetworking Text: Walrand & Parekh, 2010 Steven Low CMS, EE, Caltech.

Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.

Cooperative Overlay Networking for Streaming Media Content Feng Wang 1, Jiangchuan Liu 1, Kui Wu 2 1 School of Computing Science, Simon Fraser University.

Rumor Routing Algorithm For sensor Networks David Braginsky, Computer Science Department, UCLA Presented By: Yaohua Zhu CS691 Spring 2003.

Massively Distributed Database Systems Distributed Hash Spring 2014 Ki-Joune Li Pusan National University.

LightFlood: An Optimal Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

Multicasting in Mobile Ad-Hoc Networks (MANET)

Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Multimedia Streaming in Dynamic Peer-to-Peer Systems and Mobile Wireless.

ToNC workshop Next generation architecture H. Balakrishnan, A. Goel, D. Johnson, S. Muthukrishnan, S.Tekinay, T. Wolf DAY 2, Feb

Carnegie Mellon University Complex queries in distributed publish- subscribe systems Ashwin R. Bharambe, Justin Weisz and Srinivasan Seshan.

P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar.

Object Naming & Content based Object Search 2/3/2003.

Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.

P2P Over MANET An Introduction to Mobile Resource Sharing.

Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.

1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.

Mobile Ad-hoc Pastry (MADPastry) Niloy Ganguly. Problem of normal DHT in MANET No co-relation between overlay logical hop and physical hop – Low bandwidth,

INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.

Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.

Peer-to-Peer Support for Massively Multiplayer Games Zone Federation of Game Servers : a Peer-to-Peer Approach to Scalable Multi-player Online Games [INFOCOM.

Research Interests Georgia Koloniari Computer Science Department University of Ioannina, Greece.

1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.

Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks Jae-Young Choi, Jun-Hui Lee, and Yeong-Jee Chung Dept. of Computer Engineering, College.

Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.

BitTorrent enabled Ad Hoc Group 1  Garvit Singh( )  Nitin Sharma( )  Aashna Goyal( )  Radhika Medury( )

Routing Indices For P-to-P Systems ICDCS Introduction Search in a P2P system –Mechanisms without an index –Mechanisms with specialized index nodes.

Peer-to-Peer Name Service (P2PNS) Ingmar Baumgart Institute of Telematics, Universität Karlsruhe IETF 70, Vancouver.

JuxMem: An Adaptive Supportive Platform for Data Sharing on the Grid Gabriel Antoniu, Luc Bougé, Mathieu Jan IRISA / INRIA & ENS Cachan, France Grid Data.

Quantitative Evaluation of Unstructured Peer-to-Peer Architectures Fabrício Benevenuto José Ismael Jr. Jussara M. Almeida Department of Computer Science.

Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.

Fast Searching in Peer-to-Peer Networks Self-Organizing Parallel Search Clusters Rocky Dunlap.

1 MSc Project Yin Chen Supervised by Dr Stuart Anderson 2003 Grid Services Monitor Long Term Monitoring of Grid Services Using Peer-to-Peer Techniques.

RF network in SoC1 SoC Test Architecture with RF/Wireless Connectivity 1. D. Zhao, S. Upadhyaya, M. Margala, “A new SoC test architecture with RF/wireless.

1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.

Paper Survey of DHT Distributed Hash Table. Usages Directory service  Very little amount of information, such as URI, metadata, … Storage  Data, such.

Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.

A Utility-based Approach to Scheduling Multimedia Streams in P2P Systems Fang Chen Computer Science Dept. University of California, Riverside

Experience Sharing in Mobile Peer Communities EPI Planete, INRIA International Consortium Meeting (Oulou) 10 June, 2009.

LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.

1. Outline  Introduction  Different Mechanisms Broadcasting Multicasting Forward Pointers Home-based approach Distributed Hash Tables Hierarchical approaches.

Effective Replica Maintenance for Distributed Storage Systems USENIX NSDI’ 06 Byung-Gon Chun, Frank Dabek, Andreas Haeberlen, Emil Sit, Hakim Weatherspoon,

Research of P2P Architecture based on Cloud Computing Speaker : 吳靖緯 MA0G0101.

Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.

The Problem of Location Determination and Tracking in Networked Systems Weikuan Yu, Hui Cao, and Vineet Mittal The Ohio State University.

A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.

CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.

Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks

Peter R Pietzuch and Jean Bacon Peer-to-Peer Overlay Networks in an Event-Based Middleware DEBS’03, San Diego, CA, USA,

Aggregation and Secure Aggregation. Learning Objectives Understand why we need aggregation in WSNs Understand aggregation protocols in WSNs Understand.

Click to edit Master title style Multi-Destination Routing and the Design of Peer-to-Peer Overlays Authors John Buford Panasonic Princeton Lab, USA. Alan.

PeerNet: Pushing Peer-to-Peer Down the Stack Jakob Eriksson, Michalis Faloutsos, Srikanth Krishnamurthy University of California, Riverside.

P2P Search COP6731 Advanced Database Systems. P2P Computing  Powerful personal computer Share computing resources P2P Computing  Advantages: Shared.

P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.

TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.

Aggregation and Secure Aggregation. [Aggre_1] Section 12 Why do we need Aggregation? Sensor networks – Event-based Systems Example Query: –What is the.

Dynamic Proxy Tree-Based Data Dissemination Schemes for Wireless Sensor Networks Wensheng Zhang, Guohong Cao and Tom La Porta Department of Computer Science.

1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.

Fabián E. Bustamante, Fall 2005 A brief introduction to Pastry Based on: A. Rowstron and P. Druschel, Pastry: Scalable, decentralized object location and.

CS Spring 2010 CS 414 – Multimedia Systems Design Lecture 24 – Introduction to Peer-to-Peer (P2P) Systems Klara Nahrstedt (presented by Long Vu)

Haiyun Luo,Fan Ye, Jerry Cheng,Songwu Lu, Lixia Zhang

Introduction to Wireless Sensor Networks

5.2 FLAT NAMING.

The Case for DDoS Resistant Membership Management in P2P Systems

REED : Robust, Efficient Filtering and Event Detection

A Semantic Peer-to-Peer Overlay for Web Services Discovery

Design and Implementation of OverLay Multicast Tree Protocol

Presentation transcript:

Focus on Distributed Hash Tables Distributed hash tables (DHT) provide resource locating and routing in peer-to-peer networks –But, more than object locating and routing –Basically, a routing network Outline –Three papers Mobile Grid Broadcast An architecture based on DHT for grid resource location and allocation for massively distributed applications –One implementation Grid resource location and allocation

Wireless Grid Vision: provide a easy way to access resource in the grid –PUT and GET: put/get a resource from/into the grid –Fundamental service: routing! Comprise of stationary Internet hosts and wireless devices –Wireless devices can change their network attachment points A potential application: NCHC ’ s EcoGrid –Internet severs + sensors in the wild Our solution to provide a wireless grid –Based on distributed hash tables (DHT)

Wireless Grid (cont’d) Nodes can change their network addresses Research problem –Given the network bandwidth budget ( B i ) of each node i to maintain the DHT –How to efficiently utilize B i of each node i to provide efficient routing By efficiency, the route takes nearly zero timeouts An example of DHTFailed route from 1 to 12Successful route

Wireless Grid (cont’d) Preliminary results –PHT: percentage of hop counts due to timeouts –PBT: percentage of maintenance bandwidth due to timeouts Manuscripts in preparation –Mobility churn in DHTs –Nearly, optimal peer state supervision for mobile DHTs Our sol.

Broadcast in Dynamic P2P Networks Broadcast is a basic building block for many P2P applications –Message broadcast –Query routing in unstructured P2P networks –Diagnostics for overlay network structure –… Broadcast in P2P networks –Each message has a TTL value –TTL decreases when the message is forwarded every time –A message is not forwarded if TTL = 0

Broadcast … (cont’d) Research problem –Given a TTL value –How to maximize the broadcast scope while to minimize the maintenance bandwidth? Intuition behind: to maximize the broadcast scope requires the overlay network being maintained robustly!

Broadcast … (cont’d) There is no easy way to maximize the broadcast scope and meanwhile to minimize the maintenance bandwidth –We investigate several scalable failure detection and recovery mechanisms in the context of DHT –Paper under reviewed: scoped broadcast in dynamic peer-to-peer networks

P2P Mechanism for Grid Resource Location and Allocation Overview

P2P Mechanism for Grid Resource Location and Allocation (cont’d) Organizes the allocated resources as a tree-like overlay Submit tasks using Armada agents –Send the agents to the tree root –The tree root helps distribute the agent codes to its children

Implementation Targeted environment: NCHC UniGrid Status: –A DHT Prototype for a cluster environment is available –P2P mechanism for Grid resource location and allocation –Hopefully, can be tested in UniGrid