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.

Slides:



Advertisements
Similar presentations
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Advertisements

CAN 1.Distributed Hash Tables a)DHT recap b)Uses c)Example – CAN.
Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.
Scalable Content-Addressable Network Lintao Liu
Peer-to-Peer Systems Chapter 25. What is Peer-to-Peer (P2P)? Napster? Gnutella? Most people think of P2P as music sharing.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Schenker Presented by Greg Nims.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
A Scalable Content Addressable Network (CAN)
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
ZIGZAG A Peer-to-Peer Architecture for Media Streaming By Duc A. Tran, Kien A. Hua and Tai T. Do Appear on “Journal On Selected Areas in Communications,
Peer to Peer File Sharing Huseyin Ozgur TAN. What is Peer-to-Peer?  Every node is designed to(but may not by user choice) provide some service that helps.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker A Scalable, Content- Addressable Network (CAN) ACIRI U.C.Berkeley Tahoe Networks.
Topics in Reliable Distributed Systems Lecture 2, Fall Dr. Idit Keidar.
A Scalable Content-Addressable Network Authors: S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker University of California, Berkeley Presenter:
OSD Metadata Management
SCALLOP A Scalable and Load-Balanced Peer- to-Peer Lookup Protocol for High- Performance Distributed System Jerry Chou, Tai-Yi Huang & Kuang-Li Huang Embedded.
Object Naming & Content based Object Search 2/3/2003.
Content Addressable Networks. CAN Associate with each node and item a unique id in a d-dimensional space Goals –Scales to hundreds of thousands of nodes.
Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.
Freenet A Distributed Anonymous Information Storage and Retrieval System I Clarke O Sandberg I Clarke O Sandberg B WileyT W Hong.
CS218 – Final Project A “Small-Scale” Application- Level Multicast Tree Protocol Jason Lee, Lih Chen & Prabash Nanayakkara Tutor: Li Lao.
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks Ranveer Chandra (joint work with Venugopalan Ramasubramanian and Ken Birman)
Adaptive Web Caching Lixia Zhang, Sally Floyd, and Van Jacob-son. In the 2nd Web Caching Workshop, Boulder, Colorado, April 25, System Laboratory,
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.
P2P Course, Structured systems 1 Introduction (26/10/05)
Improving Data Access in P2P Systems Karl Aberer and Magdalena Punceva Swiss Federal Institute of Technology Manfred Hauswirth and Roman Schmidt Technical.
ICDE A Peer-to-peer Framework for Caching Range Queries Ozgur D. Sahin Abhishek Gupta Divyakant Agrawal Amr El Abbadi Department of Computer Science.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Distributed Data Stores – Facebook Presented by Ben Gooding University of Arkansas – April 21, 2015.
INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.
1 A scalable Content- Addressable Network Sylvia Rathnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker Pirammanayagam Manickavasagam.
Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
A Delaunay Triangulation Architecture Supporting Churn and User Mobility in MMVEs Mohsen Ghaffari, Behnoosh Hariri and Shervin Shirmohammadi Advanced Communications.
Towards Scalable and Robust Overlay Networks Christian Scheideler Institut für Informatik Technische Universität München Baruch Awerbuch Dept. of Computer.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
Information-Centric Networks07a-1 Week 7 / Paper 1 Internet Indirection Infrastructure –Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh.
Content Addressable Network CAN. The CAN is essentially a distributed Internet-scale hash table that maps file names to their location in the network.
Fast Handoff for Seamless wireless mesh Networks Yair Amir, Clauiu Danilov, Michael Hilsdale Mobisys’ Jeon, Seung-woo.
A Scalable Content-Addressable Network (CAN) Seminar “Peer-to-peer Information Systems” Speaker Vladimir Eske Advisor Dr. Ralf Schenkel November 2003.
Locating Mobile Agents in Distributed Computing Environment.
Resource Addressable Network (RAN) An Adaptive Peer-to-Peer Substrate for Internet-Scale Service Platforms RAN Concept & Design  Adaptive, self-organizing,
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.
Content Addressable Networks CAN is a distributed infrastructure, that provides hash table-like functionality on Internet-like scales. Keys hashed into.
Scalable Content- Addressable Networks Prepared by Kuhan Paramsothy March 5, 2007.
MobiQuitous 2007 Towards Scalable and Robust Service Discovery in Ubiquitous Computing Environments via Multi-hop Clustering Wei Gao.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
A Membership Management Protocol for Mobile P2P Networks Mohamed Karim SBAI, Emna SALHI, Chadi BARAKAT.
K-Anycast Routing Schemes for Mobile Ad Hoc Networks 指導老師 : 黃鈴玲 教授 學生 : 李京釜.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,
Pastry Antony Rowstron and Peter Druschel Presented By David Deschenes.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
1 30 November 2006 An Efficient Nearest Neighbor (NN) Algorithm for Peer-to-Peer (P2P) Settings Ahmed Sabbir Arif Graduate Student, York University.
BATON A Balanced Tree Structure for Peer-to-Peer Networks H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu.
Peer-to-Peer Systems: An Overview Hongyu Li. Outline  Introduction  Characteristics of P2P  Algorithms  P2P Applications  Conclusion.
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.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
PeerNet: Pushing Peer-to-Peer Down the Stack Jakob Eriksson, Michalis Faloutsos, Srikanth Krishnamurthy University of California, Riverside.
Malugo – a scalable peer-to-peer storage system..
1 FairOM: Enforcing Proportional Contributions among Peers in Internet-Scale Distributed Systems Yijun Lu †, Hong Jiang †, and Dan Feng * † University.
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications * CS587x Lecture Department of Computer Science Iowa State University *I. Stoica,
EE 122: Peer-to-Peer (P2P) Networks
An Introduction to Computer Networking
A Scalable Content Addressable Network
Presentation transcript:

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 2007

Overview Introduction Problem addressed What is GeoGrid? Existing solutions review Design of GeoGrid Basic GeoGrid system Construction Routing Dual peer and Dynamic work load adaptation techniques Experimental results and conclusion

Introduction Problem addressed serving a large and growing number of mobile users continious delivery and dissemination of location- based information in real time GeoGrid – a geographical location service overlay network system Decentralized Geographical location aware Techniques to improve fault-tolerance and workload balance

Existing solutions review Current location-based services are constrained to fixed set of moving objects expensive to maintain and expand One approach Create and maintain a centralized graphical location service. Drawbacks: Response time Expensive access to infrastructure communication service Not robust No model for such large scale location-based service

Challenges Can we organize nodes into efficient service network that is geographical proximity aware? End-to-end communication b/w any two nodes is bounded How to handle workload imbalance (hot spots)? How to minimize the possible service interruption? Ex. Highway system can be heavily loaded during the rush hours

GeoGrid Design Basic GeoGrid system GeoGrid construction Routing Dual peer and Dynamic work load adaptation techniques

Basic GeoGrid A network of N nodes interconnected using GeoGrid topology and routing protocol A node is a point in 2dim geographical coordinate space Space is dynamically partitioned into N disjoint rectangle Each node “owns” a rectangular region

Basic GeoGrid Nodes self-organize into an overlay network Connectivity is established through immediate neighbors of a node A mobile user connects his mobile device to one of the nodes Each node runs GeoGrid middleware and serves as a proxy for the mobile user

Basic GeoGrid Assumptions Information services existence (provide geographical info) User can be either from outside of the network or from inside it Network nodes are not mobile

GeoGrid Construction Plane is divided among N nodes into a set of rectangular regions r = A node p is identified by a tuple Each node maintains a list of its neighbors

GeoGrid Construction GeoGrid is constructed incrementally Start from one node owning the entire GeoGrid space Split the space upon new nodes joining decide which region the new node q belongs (say, of node p) split the region in half hand one half to node q notify neighbors (they must add q into their lists) create a list for q from the list of p

GeoGrid Construction Basic bootstrapping process for a new node Obtain geographical coordinate from a service Obtain a list of existing nodes from a bootstrapping server Randomly chose an entry node from the list Initiate a joining request contacting to the entry node

Routing in GeoGrid Location query Request is tagged with (x,y) p issues a query (x,y); q = p if q does not own (x, y) then forward the request to a neighbor closest to (x,y)

Routing in GeoGrid Two critical issues: Load balancing Routing efficiency Solution:heuristic load balance scheme - workload dynamic adjusting Dual peer technique Load adaptation technique

Dual peer technique Improves the overall system reliability Maps region sizes to the capacities of region owner nodes 2 nodes share a region ownership Primary owner node is a node with the larger capacity Secondary owner node is a backup node

Dual peer technique Node join: First 3 steps are the same as in basic GeoGrid Chose a neighbor region that has one owner and the least capacity If no such region exist, chose the region with the least primary node capacity Split the region and becomes a primary owner node of the region Node departure Secondary owner departure causes no change Primary owner must inform neighbors

Dual peer technique Failure recover Status information is periodically synchronized b/w primary and secondary nodes Failure of a node: If the primary node leaves, the secondary node becomes the primary If the secondary node leaves, the region becomes half-full If both nodes die, what happens?

Dual peer technique Avantages Improves the fault resilience Reduces the number of region split operations Improves the system load balance

Dynamic workload adaptation Main idea: balance workload distribution by selectively assigning new nodes to the most heavily loaded regions in its neighborhood Three basic rules: Use local adaptation instead remote one (less operation overhead) Use secondary peer switching/moving (for primary peer the ops costs more) Region split/merge are expensive – should be used with less priority

Conclusion Experimental results show that GeoGrid can reduce the workload load imbalance by an order of magnitude Unique design: Use of geographical mapping of nodes to regions; improved routing Dual peer and Dynamic workload adaptation techniques reduce load imbalance and improve fault-tolerance