Fabián E. Bustamante, 2007 Meridian: A lightweight network location service without virtual coordinates B. Wong, A. Slivkins and E. Gün Sirer SIGCOM 2005.

Slides:



Advertisements
Similar presentations
C. Mastroianni, D. Talia, O. Verta - A Super-Peer Model for Resource Discovery Services in Grids A Super-Peer Model for Building Resource Discovery Services.
Advertisements

Sequoia: Virtual-Tree Models for Internet Path Metrics Rama Microsoft Research Also:Ittai Abraham (Hebrew Univ.) Mahesh Balakrishnan (Cornell) Archit Gupta.
A Network Positioning System for the Internet T. S. Eugene Ng and Hui Zhang USENIX 04 Presented By: Imranul Hoque 1.
Intel Research Internet Coordinate Systems - 03/03/2004 Internet Coordinate Systems Marcelo Pias Intel Research Cambridge
Peer to Peer and Distributed Hash Tables
Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.
Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK
Peer-to-Peer Systems Chapter 25. What is Peer-to-Peer (P2P)? Napster? Gnutella? Most people think of P2P as music sharing.
Relative Network Positioning via CDN Redirections A. Su, D. Choffnes, F. Bustamante, A. Kuzmanovic ICDCS 2008 Presented by: Imranul Hoque.
Topologically-Aware Overlay Construction and Server Selection Sylvia Ratnasamy, Mark Handly, Richard Karp and Scott Shenker Presented by Shreeram Sahasrabudhe.
EL9331 Meridian: A Lightweight Network Location Service without Virtual Coordinates Bernard Wong, Aleksandrs Slivkins, Emin Gun Sirer SIGCOMM’05 ( Slides.
CSE 380 – Computer Game Programming Pathfinding AI
Computer Science 1 CSC 774 Advanced Network Security Enhancing Source-Location Privacy in Sensor Network Routing (ICDCS ’05) Brian Rogers Nov. 21, 2005.
On the Effectiveness of Measurement Reuse for Performance-Based Detouring David Choffnes Fabian Bustamante Fabian Bustamante Northwestern University INFOCOM.
Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.
1 PASTRY Partially borrowed from Gabi Kliot ’ s presentation.
Approximating Sensor Network Queries Using In-Network Summaries Alexandra Meliou Carlos Guestrin Joseph Hellerstein.
IPlane: An Information Plane for Distributed Services Offence by: Anup Goyal Sagar Vemuri.
Sequoia: Supporting Latency-Aware Applications through Prediction Trees Dahlia Malkhi, MSR and Hebrew U Joint work with Ittai Abraham, Mahesh Balakrishnan,
Vivaldi Coordinate Service Justin Ma, Patrick Verkaik, Michael Vrable Department of Computer Science And Engineering UCSD CSE222A, Winter 2005.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Overlay Networks EECS 122: Lecture 18 Department of Electrical Engineering and Computer Sciences University of California Berkeley.
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.
Novel Self-Configurable Positioning Technique for Multihop Wireless Networks Authors : Hongyi Wu Chong Wang Nian-Feng Tzeng IEEE/ACM TRANSACTIONS ON NETWORKING,
T. S. Eugene Ng Mellon University1 Global Network Positioning: A New Approach to Network Distance Prediction Tze Sing Eugene.
Geographic Routing Without Location Information A. Rao, C. Papadimitriou, S. Shenker, and I. Stoica In Proceedings of the 9th Annual international Conference.
Topology-Aware Overlay Networks By Huseyin Ozgur TAN.
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,
Communication (II) Chapter 4
Oasis: Anycast for Any Service Michael J. Freedman Karthik Lakshminarayanan David Mazières in NSDI 2006 Presented by: Sailesh Kumar.
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.
Ao-Jan Su, David R. Choffnes, Fabián E. Bustamante and Aleksandar Kuzmanovic Department of EECS Northwestern University Relative Network Positioning via.
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
Efficient Gathering of Correlated Data in Sensor Networks
HERO: Online Real-time Vehicle Tracking in Shanghai Xuejia Lu 11/17/2008.
Phoenix: A Weight-Based Network Coordinate System Using Matrix Factorization Yang Chen Department of Computer Science Duke University
Jonathan Walpole CSE515 - Distributed Computing Systems 1 Teaching Assistant for CSE515 Rahul Dubey.
 A P2P IRC Network Built on Top of the Kademlia Distributed Hash Table.
A Distributed Clustering Framework for MANETS Mohit Garg, IIT Bombay RK Shyamasundar School of Tech. & Computer Science Tata Institute of Fundamental Research.
Paper Group: 20 Overlay Networks 2 nd March, 2004 Above papers are original works of respective authors, referenced here for academic purposes only Chetan.
1 Mobile-Assisted Localization in Wireless Sensor Networks Nissanka B.Priyantha, Hari Balakrishnan, Eric D. Demaine, Seth Teller IEEE INFOCOM 2005 March.
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.
1 Vivaldi: A Decentralized Network Coordinate System Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris Presented by: Chen Qian.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
L-24 Adaptive Applications 1. State of the Art – Manual Adaptation Objective: automating adaptation ? CaliforniaNew York 2.
Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems Antony Rowstron and Peter Druschel, Middleware 2001.
DHT-based unicast for mobile ad hoc networks Thomas Zahn, Jochen Schiller Institute of Computer Science Freie Universitat Berlin 報告 : 羅世豪.
WSP: A Network Coordinate based Web Service Positioning Framework for Response Time Prediction Jieming Zhu, Yu Kang, Zibin Zheng and Michael R. Lyu The.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Network Coordinates : Internet Distance Estimation Jieming ZHU
Network Computing Laboratory 1 Vivaldi: A Decentralized Network Coordinate System Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT Published.
CS 484 Load Balancing. Goal: All processors working all the time Efficiency of 1 Distribute the load (work) to meet the goal Two types of load balancing.
1 Presented by Jing Sun Computer Science and Engineering Department University of Conneticut.
Topologically-Aware Overlay Construction and Sever Selection Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker.
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.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Ahmed Helmy, USC1 Architectural Framework for Large- Scale Multicast in Mobile Ad Hoc Networks Ahmed Helmy Electrical Engineering Department University.
Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
P2P Search COP6731 Advanced Database Systems. P2P Computing  Powerful personal computer Share computing resources P2P Computing  Advantages: Shared.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Gang Wang, Shining Wu, Guodong Wang, Beixing Deng, Xing Li Tsinghua University Tsinghua Univ. Oct Experimental Study on Neighbor Selection Policy.
Oct 23, 2005FOCS Metric Embeddings with Relaxed Guarantees Alex Slivkins Cornell University Joint work with Ittai Abraham, Yair Bartal, Hubert Chan,
Fabián E. Bustamante, Fall 2005 A brief introduction to Pastry Based on: A. Rowstron and P. Druschel, Pastry: Scalable, decentralized object location and.
Vivaldi: A Decentralized Network Coordinate System
Distributed Hash Tables
Accessing nearby copies of replicated objects
RandPing: A Randomized Algorithm for IP Mapping
A Case for Mutual Notification
Presentation transcript:

Fabián E. Bustamante, 2007 Meridian: A lightweight network location service without virtual coordinates B. Wong, A. Slivkins and E. Gün Sirer SIGCOM 2005 Presenter: F. E. Bustamante

EECS 443 Advanced Operating Systems Northwestern University 2 The need for a network location service Selecting node base on a set of network properties A useful building block for many distributed systems –Locate closest game server –Distributed web-crawling to nearby hosts –Perform efficient application level multicast –Satisfy a service level agreement –Provide inter-node latency bounds for clusters Simple collecting global info is infeasible for large-scale systems

EECS 443 Advanced Operating Systems Northwestern University 3 Common approach: Virtual coordinates Maps high-dimensional network measurements (latencies) into a smaller Euclidean space –GNP, Vivaldi, Lighthouse, Virtual Landmarks, PIC, NPS, etc Reduces number of real-time measurements Practical problems –How many landmarks, how many measurements, …? –Introduces inherent embedding error –A snapshot in time of the network location of a node Coordinates become stale over time Latency estimates based on coordinates computed at different times can lead to additional errors –Needs additional service to solve network location problems w/o centralized servers or O(N) state

EECS 443 Advanced Operating Systems Northwestern University 4 Meridian approach Avoid most problems with coordinates by going back to active measurements Avoid the scalability problem of all-to-all measurements via –A loosely-structured overlay –Avoiding reconcile latencies seen into a globally consistent coordinate space Avoid the need for additional service by combining query routing w/ active measurement

EECS 443 Advanced Operating Systems Northwestern University 5 Framework Multi-resolution rings –Each node keeps track of a fixed number of other nodes –Organized into a set of concentric, non-overlapping rings of increasing radius (inner: r i = alpha * s i-1 and outer R i = alpha * s i ) –Each ring with k peers Ring membership management –Each node also keeps a list of l candidates –To increase geographic diversity, begin with hyper- volume of (k+l) vertices and greedily eliminate the one that leads to the smallest reduction, l times A riri RiRi

EECS 443 Advanced Operating Systems Northwestern University 6 Framework Gossip based node discovery –Each node randomly picks one per ring and sends list of randomly chosen others per ring –Recipient node probes its distance to those nodes and the source –The interval between gossip cycles gradually increases to a common value Bootstrapping –Need to know of at least one node already in –Get this node’s list and bin them based on its own measurements

EECS 443 Advanced Operating Systems Northwestern University 7 Common network location problems (1) Closest node –Discovering the closest node to a targeted reference point –Can be use by CDNs, multiplayer games, P2P overlays, … –Meridian Multihop search similar to finding the closest identifier in a DHT Each hop exponentially reduces the distance to the target –Determine distance d to target –Ask all peers within (1-/+beta)*d, anybody closer? repeat Reduction threshold beta (+,<1) – when to stop

EECS 443 Advanced Operating Systems Northwestern University 8 Common network location problems (2) Central leader –Locate the center point of a region defined by a set of nodes –To pick the leader of a cluster when forming multicast trees –Meridian Minimizes avg latency to a set of targets instead of one target Replace d with d avg Inter-node latencies of targets are not known

EECS 443 Advanced Operating Systems Northwestern University 9 Common network location problems (3) Multi-constraint –Locate nodes in the intersection of a set of constraints such as set of latencies to well-known peering points –You have some room here, e.g. when trying to satisfy a SLA –Meridian Add range and use sum of max(0, d - range) 2, for all u constraints

EECS 443 Advanced Operating Systems Northwestern University 10 Evaluation In simulation –2500 DNS servers –Use 500 of them as targets –Internode latency measure using the King measurement technique –Compare using GNP, Vivaldi and Vivaldi with height Also deployed in PlanetLab – closestnode.com –Over 166 nodes, now over more than 300 nodes with all applications

EECS 443 Advanced Operating Systems Northwestern University 11 Closest node discovery Median error for discovering closest node Relative error CDFs for different schemes

EECS 443 Advanced Operating Systems Northwestern University 12 Closest node discovery Accuracy maybe couple with low query latencies Avg. query latency determined by slowest node in each ring Here k is set to log 1.6 N

EECS 443 Advanced Operating Systems Northwestern University 13 Central leader election Only 2 and 8 targets; authors argue that relative error decreases with increasing number of targets

EECS 443 Advanced Operating Systems Northwestern University 14 Multi-constraint System Categorized multi-constraint queries by its difficulty Success rate for queries that can be satisfied by only 0.5% of nodes

EECS 443 Advanced Operating Systems Northwestern University 15 Conclusions & Issues You don’t need coordinates to solve some useful practical problems “The accuracy of Meridian’s closest node discovery protocol [and everything else, therefore] depends on several parameters, such as the number of nodes per ring, …” Effect of churn Firewalled hosts are excluded form ring membership on other firewalled hosts Length of bootstrapping process Accuracy of service meanwhile