Dewan Tanvir Ahmed and Shervin Shirmohammadi

Slides:



Advertisements
Similar presentations
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
Advertisements

Peer to Peer and Distributed Hash Tables
Scalable Content-Addressable Network Lintao Liu
CHORD – peer to peer lookup protocol Shankar Karthik Vaithianathan & Aravind Sivaraman University of Central Florida.
PDPTA03, Las Vegas, June S-Chord: Using Symmetry to Improve Lookup Efficiency in Chord Valentin Mesaros 1, Bruno Carton 2, and Peter Van Roy 1 1.
Node Lookup in Peer-to-Peer Network P2P: Large connection of computers, without central control where typically each node has some information of interest.
The Chord P2P Network Some slides have been borowed from the original presentation by the authors.
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.
Massively Distributed Database Systems Distributed Hash Spring 2014 Ki-Joune Li Pusan National University.
Multicasting in Mobile Ad-Hoc Networks (MANET)
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Distributed Lookup Systems
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.
Wide-area cooperative storage with CFS
Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.
Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Young-Bae Ko and Nitin H. Vaidya Recipient of the MOBICOM'98 Best Student Paper Award.
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,
Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.
Effizientes Routing in P2P Netzwerken Chord: A Scalable Peer-to- peer Lookup Protocol for Internet Applications Dennis Schade.
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.
Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment Dewan Tanvir Ahmed and Shervin Shirmohammadi Distributed & Collaborative Virtual.
09/07/2004Peer-to-Peer Systems in Mobile Ad-hoc Networks 1 Lookup Service for Peer-to-Peer Systems in Mobile Ad-hoc Networks M. Tech Project Presentation.
A Delaunay Triangulation Architecture Supporting Churn and User Mobility in MMVEs Mohsen Ghaffari, Behnoosh Hariri and Shervin Shirmohammadi Advanced Communications.
Chord & CFS Presenter: Gang ZhouNov. 11th, University of Virginia.
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( )
A Scalable Content-Addressable Network (CAN) Seminar “Peer-to-peer Information Systems” Speaker Vladimir Eske Advisor Dr. Ralf Schenkel November 2003.
Presentation 1 By: Hitesh Chheda 2/2/2010. Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT Laboratory for Computer Science.
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.
SIGCOMM 2001 Lecture slides by Dr. Yingwu Zhu Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.
National Institute of Advanced Industrial Science and Technology Query Processing for Distributed RDF Databases Using a Three-dimensional Hash Index Akiyoshi.
Dynamic Routing in Mobile Ad Hoc Network 報告者:呂佐鴻 指導教授:李鴻璋.
Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
PRIN WOMEN PROJECT Research Unit: University of Naples Federico II G. Ferraiuolo
Memory Coherence in Shared Virtual Memory System ACM Transactions on Computer Science(TOCS), 1989 KAI LI Princeton University PAUL HUDAK Yale University.
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
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.
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.
Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.
Distributed systems. distributed systems and protocols distributed systems: use components located at networked computers use message-passing to coordinate.
Nov. 29, 2006GLOBECOM /17 A Location-based Directional Route Discovery (LDRD) Protocol in Mobile Ad-hoc Networks Stephen S. Yau, Wei Gao, and Dazhi.
Distributed Hash Tables (DHT) Jukka K. Nurminen *Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen)
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications * CS587x Lecture Department of Computer Science Iowa State University *I. Stoica,
The Chord P2P Network Some slides taken from the original presentation by the authors.
Peer-to-Peer Information Systems Week 12: Naming
A Cluster-based Routing Protocol for Mobile Ad hoc Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Che-Liang Liu, Chih-Yu Wang, Hung-Yu Wei
CS 268: Lecture 22 (Peer-to-Peer Networks)
CSE 486/586 Distributed Systems Distributed Hash Tables
The Chord P2P Network Some slides have been borrowed from the original presentation by the authors.
Peer-to-Peer Data Management
Improving and Generalizing Chord
S-Chord: Using Symmetry to Improve Lookup Efficiency in Chord
Plethora: Infrastructure and System Design
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
EE 122: Peer-to-Peer (P2P) Networks
A Scalable content-addressable network
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service
P2P Systems and Distributed Hash Tables
Mobile P2P Data Retrieval and Caching
An Overview of Peer-to-Peer
MIT LCS Proceedings of the 2001 ACM SIGCOMM Conference
Consistent Hashing and Distributed Hash Table
CSE 486/586 Distributed Systems Distributed Hash Tables
Peer-to-Peer Information Systems Week 12: Naming
Presentation transcript:

Dewan Tanvir Ahmed and Shervin Shirmohammadi Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment Dewan Tanvir Ahmed and Shervin Shirmohammadi Distributed and Collaborative Virtual Environments Research Laboratory School of Information Technology & Engineering University of Ottawa, Canada

Motivation Heart of the p2p protocols Smart content distribution mechanism Efficient content discovery process Extra challenges in wireless ad hoc network Routing cost Resource limitations In this paper, our focus on to check The effectiveness of multilevel hashing Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Architecture The entire system consists of a set of home regions Peers in close proximity form home region Home region representative plays a supporting role functions as a rendezvous point for incoming requests and provides useful information to local peers change over the time identified by Home-Region-ID Local Region Representative Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Node identification Two keys:: <Home-Region-ID, Node-ID> depends on its location may change over time. Node-ID = Hl(Node-Address) Home-Region-ID Home-Region-ID Node-ID Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Learning Representative Periodic broadcast home region representative Controlled flooding not flooded to the entire system Stop forwarding request when it has the answer Keep minimum hops away response Peer gets the identity of its successor and predecessor from this representative Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Logical layout of nodes in a home region Logical Structure Chord like structure Logical layout of nodes in a home region Peer Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Content Publishing Contents & nodes Key: an n-bit number mapped to the same address space Key: an n-bit number two hash functions providing two keys One key map the content name to a home region keyr= Hr(Content-Name ) Second key determine the successor in a particular region keys=Hl(Content-Name) Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Content Publishing The content publisher builds a tuple <Content-Name, Owner-Address> asks local representative to store the tuple Index distribution In local region Index distribution in foreign region Representative Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Content Discovery To discover content peer hashes Content-Name keyr = Hr(Content-Name) it represents the home region where the content information is stored How does peer get id of foreign representative? with the help of local representative What is the role of second key, keys? To discover the successor when the content discovering process has been shifted to the appropriate region chord like content searching process Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Content Discovery (cont..) Chord uses Finger Table (FT) to speed up searching process Let hash key is 128-bit long address space: 3.4e38 Say, we have 1020 peers in the system average gap: 3.4e18 between two active nodes most entries of the FT point to the same successor actually search continues in linear way Big issue in Ad hoc Networks as routing is expensive Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Content Discovery (cont..) The FT has m entries 0 to m-1 Divided into two halves 0 to m/2 and m/2 to (m-1) Each entry has two fields start and the physical address of successor(start) Start Successor Address Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Content Discovery (cont..) First half: for entry i at node k start = k + 2i mod 2m, where 0  i < m/2 Physical address of successor (start[i]) first half table covers k to k+2 m/2-1 address space Second half: define step-size as a big number to jump more rapidly The entries are incremented by the step size starting from k+2 m/2-1 Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Content Discovery (cont..) Example Node 1’s Finger Table (Step size 8) Start Physical Address of start 2 4 3 5 7 13 14 21 24 29 30 Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Content Discovery (cont..) Another approach the start and the physical address of the successor start = (k + ai) mod 2n ,where m/2  i< m Physical address of successor (start[i]) a is a constant and we have n-bit hash value possible choice for ‘a’ is the index of finger table it increase at a rate of ii [11, 22, 33…] Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Greedy Routing Algorithm Simulation results Simulation setup Parameter Setup - 1 Setup - 2 Deployment area 100  100 square unit 10000  10000 Node’s velocity 4 unit per second Content per node 3 Routing algorithm Greedy Routing Algorithm Hash function Message Digest 5 Modulo (32-bit Number) Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Simulation results Chord’s performance in Mobile p2p 4000 8000 12000 4000 8000 12000 16000 20000 1000 2000 6000 Number of peers Hop Distance Routing Cost Search Cost Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Simulation results (cont..) Improvement of search cost due to two level-hashing 6 12 18 24 30 1000 2000 4000 6000 8000 10000 Ratio of search cost Number of peers Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Simulation results (cont..) Improvement of routing overhead due to two level-hashing 20 40 60 80 1000 2000 4000 6000 8000 10000 Number of peers Ratio of routing cost Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Conclusion We present a two-level hashing scheme for wireless ad hoc peer-to-peer systems Performance improvement due to multi-level hashing in terms of search cost and routing overhead Modified finger tables works well when the number of peers is too small as compared to the hash address space Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Thank You! Wednesday, November 21, 2018 Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment