Network Positioning for Wide-Area and Wireless Networks
Transcript of Network Positioning for Wide-Area and Wireless Networks
![Page 1: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/1.jpg)
Emin Gün Sirer
Department of Computer ScienceCornell University
Network Positioning for Wide-Area and Wireless Networks
![Page 2: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/2.jpg)
Localization is Critical
Locality information is the building block for novel services in wired and wireless networks
Critical to find out where in the physical world nodes (and other items of interest) are
Localityaware content, computing, routing, service discovery, event tracking in sensor networks, ...
Critical to select servers based on the position of target nodes
Find closest server, find centrally located node, find node within latency bounds
![Page 3: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/3.jpg)
Sextant
Determining the location of nodes and events in wireless (ad hoc, sensor) networks
![Page 4: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/4.jpg)
Localization in Wireless Networks
Infrastructurebased hardware (GPS) is the traditional solution
ExpensivePowerhungryDoes not work indoors, without infrastructure
How well can we do with intelligent software and cheap, ubiquitous hardware?
![Page 5: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/5.jpg)
Sextant Approach
Treat localization as a constraintsatisfaction problem
Extract constraints aggressively from the networkDisseminate them transitivelySolve in a distributed manner
![Page 6: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/6.jpg)
Sextant Properties
AccurateNegative as well as positive informationExplicit representation
PracticalConstraint extractionDeployed on Mica2 motes, PDAs and laptops
Positive Constraint
Negative Constraint
![Page 7: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/7.jpg)
Sextant Properties
AccurateNegative as well as positive informationExplicit representation
PracticalConstraint extractionDeployed on Mica2 motes, PDAs and laptops
Need not be convexMay have holesMay have disconnected components
![Page 8: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/8.jpg)
Sextant Properties
AccurateNegative as well as positive informationExplicit representation
PracticalConstraint extractionDeployed on Mica2 motes, PDAs and laptops
![Page 9: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/9.jpg)
Node Localization
Positive information
![Page 10: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/10.jpg)
Node Localization
Intersection of Positive information
![Page 11: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/11.jpg)
Node Localization
Negative information
![Page 12: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/12.jpg)
Node Localization
Positive information
![Page 13: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/13.jpg)
Node Localization
Transitive dissemination of positive information
![Page 14: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/14.jpg)
Node Localization
Transitive dissemination of positive information
![Page 15: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/15.jpg)
Node Localization
Transitive dissemination of positive information
![Page 16: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/16.jpg)
Node Localization
Transitive dissemination of positive information
![Page 17: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/17.jpg)
Node Localization
Combining negative and positive information
![Page 18: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/18.jpg)
Node Localization
Combining negative and positive information
![Page 19: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/19.jpg)
Node Localization
Combining negative and positive information
![Page 20: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/20.jpg)
Node Localization
Combining negative and positive information
![Page 21: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/21.jpg)
Node Localization
Combining negative and positive information
![Page 22: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/22.jpg)
Node Localization
Refining position estimates
![Page 23: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/23.jpg)
Sextant Approach
Location estimate: ßx
Set of positive constraints: x
Set of negative constraints: x
ßx = (p x) \ (n x)
![Page 24: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/24.jpg)
Sextant Areas
Represent areas explicitlyUse Bezier curves to bound bezier regionsFour control points define a curveUnion and intersection are implemented efficiently
Not a point estimate!Ideally, applications should take the bezier region as inputCan generate point estimate from bezier regions
![Page 25: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/25.jpg)
Localizing Events
Hot area in sensor networksThe Sextant approach provides a comprehensive, unified frameworkDifferences from node localization
Constraints from sensors, not wireless radiosBoolean connected/not connected to sensed/not sensedAnnotate resulting areas with probabilities
![Page 26: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/26.jpg)
Event localization
Decompose space into a grid, propagate probabilitiesCalculate normalized Bayesian probabilities
![Page 27: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/27.jpg)
Event Localization
Start with initial Sextant node regions
![Page 28: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/28.jpg)
Event Localization
An event occurs
![Page 29: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/29.jpg)
Event Localization
Sextant is used for event localization
![Page 30: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/30.jpg)
Event Localization
Sextant is used for event localization
![Page 31: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/31.jpg)
Event Localization
Event localized
![Page 32: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/32.jpg)
Event Localization
Event used for node localization!
Title:sextant Creator:Tgif-4.1.43-QPL written by Willi CreationDate:Sun May 22 18:05:55 2005
![Page 33: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/33.jpg)
Event Localization
Event used to refine node location!
![Page 34: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/34.jpg)
Event Localization
Event detection helps refine node positions!
![Page 35: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/35.jpg)
Meridian
Selecting nodes based on location(without knowing their actual location in the real
world)
![Page 36: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/36.jpg)
Network Location Service
Realworld problems:
Locate closest game server
Distribute webcrawling to nearby hosts
Perform efficient application level multicast
Satisfy a Service Level Agreement
Provide internode latency bounds for clusters
Underlying abstract problems
Finding closest node to target
Finding the closest node to the center of a set of targets
Finding a node that is <ri ms from target ti for all targets
Select nodes based on a set of network properties
![Page 37: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/37.jpg)
Current StateoftheArt: Virtual Coordinates
Maps Internet latencies into low dimensional spaceGNP, Vivaldi, Lighthouse, ICS, VL, BBS, PIC, NPS, etc.
Reduces number of realtime measurements
3 practical problems:Introduces inherent embedding error
A snapshot in time of the network location of a nodeCoordinates become stale over timeLatency estimates based on coordinates computed at different times can lead to additional errors
Requires additional P2P substrate to solve network location problems without centralized servers or O(N) state
![Page 38: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/38.jpg)
Meridian Approach
Solve node selection directly without computing coordinatesCombine query routing with active measurements
3 Design Goals:Accurate: Find satisfying nodes with high probability
General: Users can fully express their network location requirements
Scalable: O(log N) state per node, O(log D) hops per query
Design tradeoffs:Active measurements incur higher query latencies
Overhead more dependent on query load
![Page 39: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/39.jpg)
Meridian Operation
Framework:
Loosely structured overlay network
Algorithms:
Solve network location problems in O(log D) hops
Language:
Generalpurpose language for expressing network location requirements
![Page 40: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/40.jpg)
Multiresolution Rings
Organize peers into small fixed number of concentric rings
Radii of rings grow outwards exponentially
Logarithmic # of peers per ring
Favors nearby neighbors
Retains a sufficient number of pointers to remote regions
Gossip protocol used for peer discovery
r= sr= s2A
![Page 41: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/41.jpg)
Multiresolution Rings
Organize peers into small fixed number of concentric rings
Radii of rings grow outwards exponentially
Logarithmic # of peers per ring
Favors nearby neighbors
Retains a sufficient number of pointers to remote regions
Gossip protocol used for peer discovery
r= sr= s2A
![Page 42: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/42.jpg)
Multiresolution Rings
Organize peers into small fixed number of concentric rings
Radii of rings grow outwards exponentially
Logarithmic # of peers per ring
Favors nearby neighbors
Retains a sufficient number of pointers to remote regions
Gossip protocol used for peer discovery
r= sr= s2A
![Page 43: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/43.jpg)
Multiresolution Rings
Organize peers into small fixed number of concentric rings
Radii of rings grow outwards exponentially
Logarithmic # of peers per ring
Favors nearby neighbors
Retains a sufficient number of pointers to remote regions
Gossip protocol used for peer discovery
r= sr= s2A
![Page 44: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/44.jpg)
Closest Node Discovery
Multihop searchSimilar to finding the closest identifier in DHTs
Replaces virtual identifiers with physical latencies
Each hop exponentially reduces the distance to the target
Reduction threshold for β 0 ≤ < 1β
Only take another hop if a peer node is times closerβ
Limits # of probed peers through triangle inequality
![Page 45: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/45.jpg)
Closest Node Discovery
C
T
![Page 46: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/46.jpg)
Closest Node Discovery
C
T
d
![Page 47: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/47.jpg)
Closest Node Discovery
C
T
d
![Page 48: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/48.jpg)
Closest Node Discovery
C
T
d β * d
β * d
![Page 49: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/49.jpg)
Closest Node Discovery
C
T
![Page 50: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/50.jpg)
Closest Node Discovery
C
T
![Page 51: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/51.jpg)
Closest Node Discovery
C
T
![Page 52: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/52.jpg)
Closest Node Discovery
C
T
![Page 53: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/53.jpg)
C
Td
Closest Node Discovery
![Page 54: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/54.jpg)
Closest Node Discovery
C
Td
![Page 55: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/55.jpg)
Closest Node Discovery
C
Td
![Page 56: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/56.jpg)
Closest Node Discovery
C
T
![Page 57: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/57.jpg)
Closest Node Discovery
C
T
![Page 58: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/58.jpg)
Closest Node Discovery
C
T
![Page 59: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/59.jpg)
Closest Node Discovery
T
C
![Page 60: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/60.jpg)
Closest Node Discovery
T
C
![Page 61: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/61.jpg)
Closest Node Discovery
T
C
![Page 62: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/62.jpg)
Closest Node Discovery
T
C
![Page 63: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/63.jpg)
Closest Node Discovery
T
C
![Page 64: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/64.jpg)
Meridian Theoretical AnalysisAnalytical guarantees for closest node discovery
Meridian can find the closest node with high probability
Given nodes in a space with a doubling metric
As well as a growth constrained metric
Scales well with increasing system size
Does not lead to hot spots
![Page 65: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/65.jpg)
Central Leader Election
Select the closest node to the center of a set of targetsMulticast trees can place central nodes higher in the hierarchy
Algorithm similar to closest node discovery
Minimizes avg. latency to a set of targets instead of one targetUses distance metric davg instead of d
Internode latencies of targets not knownNeed to be conservative in pruning peers
![Page 66: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/66.jpg)
Central Leader Election
C
T
T
T
![Page 67: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/67.jpg)
Central Leader Election
d1
C
T
T
T
d2
d3
![Page 68: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/68.jpg)
Central Leader Election
d1
C
T
T
T
d2
d3
![Page 69: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/69.jpg)
Central Leader Election
C
T
T
T
![Page 70: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/70.jpg)
Central Leader Election
C
T
T
T
![Page 71: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/71.jpg)
Central Leader Election
d3
d2d1
C
T
T
T
![Page 72: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/72.jpg)
Central Leader Election
d3
d2d1
C
T
T
T
![Page 73: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/73.jpg)
Central Leader Election
C
T
T
T
![Page 74: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/74.jpg)
Central Leader Election
C
T
T
T
![Page 75: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/75.jpg)
Multiconstraint SystemFind a node that satisfies a set of latency constraints
ISP can find a server that can satisfy a SLA with a clientGrid users can find a set of nodes with a bounded internode latency
There exists a solution space, containing 0 or more nodesOnly a solution point in previous problems
Requires a different distance metric s :
s = 0 when all constraints are satisfiedSum of squares places more weight on fringe constraints
Allows for faster convergence to solution space
Other metrics can be used, square works well in practice
![Page 76: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/76.jpg)
Multiconstraint System
T
T
T
C
![Page 77: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/77.jpg)
Multiconstraint System
T
T
T
C
![Page 78: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/78.jpg)
Multiconstraint System
T
T
T
C
![Page 79: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/79.jpg)
Multiconstraint System
T
T
T
C
![Page 80: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/80.jpg)
Multiconstraint System
T
T
T
C
![Page 81: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/81.jpg)
Multiconstraint System
T
T
T
C
![Page 82: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/82.jpg)
Multiconstraint System
T
T
T
C
![Page 83: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/83.jpg)
Multiconstraint System
T
T
T
C
![Page 84: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/84.jpg)
Multiconstraint System
T
T
T
C
![Page 85: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/85.jpg)
Meridian Query Language
Variant of C/Python Safe, polymorphic, and dynamicallytyped Includes an extensive set of library functions
Allows users to:Access multiresolution ringsIssue latency probesForward queries to peers
Tight resource limits on:Execution time of queryNumber of hopsAmount of memory allocated
![Page 86: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/86.jpg)
Evaluation
Evaluated our system through a large scale simulation and a PlanetLab deployment
Simulation parameterized by real latency measurements
2500 DNS servers, latency between 6.25 million node pairs
DNS servers are authorities name servers for domains found in the Yahoo! web directory
We evaluated system sizes of up to 2000 nodes500 nodes reserved as targets
![Page 87: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/87.jpg)
Evaluation: Closest Node DiscoveryMeridian has an order of magnitude less error than virtual coordinate schemes
![Page 88: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/88.jpg)
Evaluation: Closest Node DiscoveryCDF of relative error shows Meridian is more accurate for both typical nodes and fringe nodes
![Page 89: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/89.jpg)
Evaluation: Closest Node DiscoveryWith k = log1.6 N, error and query latency remain constant as N increasesAverage query latency determined by slowest node in each ring
![Page 90: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/90.jpg)
Evaluation: Central Leader ElectionMeridian incurs significantly less relative error
![Page 91: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/91.jpg)
Evaluation: Multiconstraint SystemCategorized multiconstraint queries by its difficulty
Difficulty a measure of the number of nodes in solution space
Success rate for queries that can be satisfied by only 0.5% of the nodes:
VC: 11%Meridian: 91%4 Constraints
VC: 19%VC: 35% Meridian: 90%3 Constraints
Meridian: 91%2 Constraints
![Page 92: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/92.jpg)
Evaluation: PlanetLab DeploymentA PlanetLab deployment of 166 nodes shows the closest node discovery accuracy to be very close to the simulation results
Have expanded deployment to 325 PlanetLab nodes supporting all 3 applications and MQL
![Page 93: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/93.jpg)
Implementation
Includes query language and the 3 protocols
Works with firewalled hosts
Can use DNS queries, TCP connect times, and Meridian UDP packets to measure latency
Optimizations:
Measurement cache reduces query latency
Ring management scheme to select more diverse peers
![Page 94: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/94.jpg)
ClosestNode.com
ClosestNode.com is a DNS redirection service that returns the IP address of closest node to the client
e.g. cobweb.closestnode.com will resolve to the closest CobWeb DHT node to the requesting client
Requires minimal changes to the serviceLinking the Meridian library and calling one function at startup
Or add standalone Meridian server to start script
No changes required for the client
Can register your service at:
http://www.closestnode.com
![Page 95: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/95.jpg)
Meridian SummaryA lightweight accurate system for selecting nodes
Combines query routing with active measurements
An order of magnitude less error than virtual coordinates
Solves the network location problem directlyDoes not need to be paired with CAN
Code, data, demos and more information athttp://www.cs.cornell.edu/People/egs/meridian
![Page 96: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/96.jpg)
Octant
Determining the physical location of Internet nodes in the real world(Combining Sextant with Meridian...)
![Page 97: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/97.jpg)
OctantOften need to determine the physical location of a machine on the Internet
Provide customized servicesTrace user activityPerform monitoring and locate attackers
Need to map from IP Address to geographic locationIP to Zip Code: Static, Coursegrained, Inaccurate
Need a dynamic, accurate way of finding physical location of machines
Must work even if host is behind NAT, firewall or in a VPN
![Page 98: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/98.jpg)
Octant Approach
Find general dependency between network latency and physical distanceSet up a system of constraints based on latency measurements to known landmark nodes
Aggressively extract constraintsUse both positive and negative information
Solve the system geometrically, yielding the set of physical areas on the globe where a target may be located
![Page 99: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/99.jpg)
Latency-Distance Relationship
Internet latencies correlated with distance
0
2000
4000
6000
8000
10000
0 50 100 150 200 250 300 350 400 450
Latency (ms)
Dis
tanc
e (k
m)
![Page 100: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/100.jpg)
Positive and Negative Information
A latency probe establishes the minimum and maximum distances between a target T and chosen landmarks
Geometric intersection yields target location
TT
r
R
![Page 101: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/101.jpg)
Cylindrical Equidistant Projection
Use Bézier curves to bound the areas in which a node can appear
Map curves onto projected 2D globe
![Page 102: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/102.jpg)
Summary
Octant is a dynamic and accurate Internet host localization service
Achieves high fidelity by using both positive and negative information
Can be used to determine the physical location of any node without user input
![Page 103: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/103.jpg)
Emin Gün Sirer
Department of Computer ScienceCornell University
Network Positioning for Wide-Area and Wireless Networks
![Page 104: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/104.jpg)
2
Localization is Critical
Locality information is the building block for novel services in wired and wireless networks
Critical to find out where in the physical world nodes (and other items of interest) are
Localityaware content, computing, routing, service discovery, event tracking in sensor networks, ...
Critical to select servers based on the position of target nodes
Find closest server, find centrally located node, find node within latency bounds
![Page 105: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/105.jpg)
3
Sextant
Determining the location of nodes and events in wireless (ad hoc, sensor) networks
![Page 106: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/106.jpg)
4
Localization in Wireless Networks
Infrastructurebased hardware (GPS) is the traditional solution
ExpensivePowerhungryDoes not work indoors, without infrastructure
How well can we do with intelligent software and cheap, ubiquitous hardware?
![Page 107: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/107.jpg)
5
Sextant Approach
Treat localization as a constraintsatisfaction problem
Extract constraints aggressively from the networkDisseminate them transitivelySolve in a distributed manner
![Page 108: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/108.jpg)
6
Sextant Properties
AccurateNegative as well as positive informationExplicit representation
PracticalConstraint extractionDeployed on Mica2 motes, PDAs and laptops
Positive Constraint
Negative Constraint
![Page 109: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/109.jpg)
7
Sextant Properties
AccurateNegative as well as positive informationExplicit representation
PracticalConstraint extractionDeployed on Mica2 motes, PDAs and laptops
Need not be convexMay have holesMay have disconnected components
![Page 110: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/110.jpg)
8
Sextant Properties
AccurateNegative as well as positive informationExplicit representation
PracticalConstraint extractionDeployed on Mica2 motes, PDAs and laptops
![Page 111: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/111.jpg)
9
Node Localization
Positive information
![Page 112: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/112.jpg)
10
Node Localization
Intersection of Positive information
![Page 113: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/113.jpg)
11
Node Localization
Negative information
![Page 114: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/114.jpg)
12
Node Localization
Positive information
![Page 115: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/115.jpg)
13
Node Localization
Transitive dissemination of positive information
![Page 116: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/116.jpg)
14
Node Localization
Transitive dissemination of positive information
![Page 117: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/117.jpg)
15
Node Localization
Transitive dissemination of positive information
![Page 118: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/118.jpg)
16
Node Localization
Transitive dissemination of positive information
![Page 119: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/119.jpg)
17
Node Localization
Combining negative and positive information
![Page 120: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/120.jpg)
18
Node Localization
Combining negative and positive information
![Page 121: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/121.jpg)
19
Node Localization
Combining negative and positive information
![Page 122: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/122.jpg)
20
Node Localization
Combining negative and positive information
![Page 123: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/123.jpg)
21
Node Localization
Combining negative and positive information
![Page 124: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/124.jpg)
22
Node Localization
Refining position estimates
![Page 125: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/125.jpg)
23
Sextant Approach
Location estimate: ßx
Set of positive constraints: x
Set of negative constraints: x
ßx = (p x) \ (n x)
![Page 126: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/126.jpg)
24
Sextant Areas
Represent areas explicitlyUse Bezier curves to bound bezier regionsFour control points define a curveUnion and intersection are implemented efficiently
Not a point estimate!Ideally, applications should take the bezier region as inputCan generate point estimate from bezier regions
![Page 127: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/127.jpg)
25
Localizing Events
Hot area in sensor networksThe Sextant approach provides a comprehensive, unified frameworkDifferences from node localization
Constraints from sensors, not wireless radiosBoolean connected/not connected to sensed/not sensedAnnotate resulting areas with probabilities
![Page 128: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/128.jpg)
26
Event localization
Decompose space into a grid, propagate probabilitiesCalculate normalized Bayesian probabilities
![Page 129: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/129.jpg)
27
Event Localization
Start with initial Sextant node regions
![Page 130: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/130.jpg)
28
Event Localization
An event occurs
![Page 131: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/131.jpg)
29
Event Localization
Sextant is used for event localization
![Page 132: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/132.jpg)
30
Event Localization
Sextant is used for event localization
![Page 133: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/133.jpg)
31
Event Localization
Event localized
![Page 134: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/134.jpg)
32
Event Localization
Event used for node localization!
Title:sextant Creator:Tgif-4.1.43-QPL written by Willi CreationDate:Sun May 22 18:05:55 2005
![Page 135: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/135.jpg)
33
Event Localization
Event used to refine node location!
![Page 136: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/136.jpg)
34
Event Localization
Event detection helps refine node positions!
![Page 137: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/137.jpg)
35
Meridian
Selecting nodes based on location(without knowing their actual location in the real
world)
![Page 138: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/138.jpg)
36
Network Location Service
Realworld problems:
Locate closest game server
Distribute webcrawling to nearby hosts
Perform efficient application level multicast
Satisfy a Service Level Agreement
Provide internode latency bounds for clusters
Underlying abstract problems
Finding closest node to target
Finding the closest node to the center of a set of targets
Finding a node that is <ri ms from target ti for all targets
Select nodes based on a set of network properties
![Page 139: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/139.jpg)
37
Current StateoftheArt: Virtual Coordinates
Maps Internet latencies into low dimensional spaceGNP, Vivaldi, Lighthouse, ICS, VL, BBS, PIC, NPS, etc.
Reduces number of realtime measurements
3 practical problems:Introduces inherent embedding error
A snapshot in time of the network location of a nodeCoordinates become stale over timeLatency estimates based on coordinates computed at different times can lead to additional errors
Requires additional P2P substrate to solve network location problems without centralized servers or O(N) state
![Page 140: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/140.jpg)
38
Meridian ApproachSolve node selection directly without computing coordinates
Combine query routing with active measurements
3 Design Goals:Accurate: Find satisfying nodes with high probability
General: Users can fully express their network location requirements
Scalable: O(log N) state per node, O(log D) hops per query
Design tradeoffs:Active measurements incur higher query latencies
Overhead more dependent on query load
![Page 141: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/141.jpg)
39
Meridian OperationFramework:
Loosely structured overlay network
Algorithms:
Solve network location problems in O(log D) hops
Language:
Generalpurpose language for expressing network location requirements
![Page 142: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/142.jpg)
40
Multiresolution RingsOrganize peers into small fixed number of concentric rings
Radii of rings grow outwards exponentially
Logarithmic # of peers per ring
Favors nearby neighbors
Retains a sufficient number of pointers to remote regions
Gossip protocol used for peer discovery
r= sr= s2A
![Page 143: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/143.jpg)
41
Multiresolution RingsOrganize peers into small fixed number of concentric rings
Radii of rings grow outwards exponentially
Logarithmic # of peers per ring
Favors nearby neighbors
Retains a sufficient number of pointers to remote regions
Gossip protocol used for peer discovery
r= sr= s2A
![Page 144: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/144.jpg)
42
Multiresolution RingsOrganize peers into small fixed number of concentric rings
Radii of rings grow outwards exponentially
Logarithmic # of peers per ring
Favors nearby neighbors
Retains a sufficient number of pointers to remote regions
Gossip protocol used for peer discovery
r= sr= s2A
![Page 145: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/145.jpg)
43
Multiresolution RingsOrganize peers into small fixed number of concentric rings
Radii of rings grow outwards exponentially
Logarithmic # of peers per ring
Favors nearby neighbors
Retains a sufficient number of pointers to remote regions
Gossip protocol used for peer discovery
r= sr= s2A
![Page 146: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/146.jpg)
44
Closest Node Discovery
Multihop searchSimilar to finding the closest identifier in DHTs
Replaces virtual identifiers with physical latencies
Each hop exponentially reduces the distance to the target
Reduction threshold for β 0 ≤ < 1β
Only take another hop if a peer node is times closerβ
Limits # of probed peers through triangle inequality
![Page 147: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/147.jpg)
45
Closest Node Discovery
C
T
![Page 148: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/148.jpg)
46
Closest Node Discovery
C
T
d
![Page 149: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/149.jpg)
47
Closest Node Discovery
C
T
d
![Page 150: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/150.jpg)
48
Closest Node Discovery
C
T
d β * d
β * d
![Page 151: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/151.jpg)
49
Closest Node Discovery
C
T
![Page 152: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/152.jpg)
50
Closest Node Discovery
C
T
![Page 153: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/153.jpg)
51
Closest Node Discovery
C
T
![Page 154: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/154.jpg)
52
Closest Node Discovery
C
T
![Page 155: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/155.jpg)
53
C
Td
Closest Node Discovery
![Page 156: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/156.jpg)
54
Closest Node Discovery
C
Td
![Page 157: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/157.jpg)
55
Closest Node Discovery
C
Td
![Page 158: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/158.jpg)
56
Closest Node Discovery
C
T
![Page 159: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/159.jpg)
57
Closest Node Discovery
C
T
![Page 160: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/160.jpg)
58
Closest Node Discovery
C
T
![Page 161: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/161.jpg)
59
Closest Node Discovery
T
C
![Page 162: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/162.jpg)
60
Closest Node Discovery
T
C
![Page 163: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/163.jpg)
61
Closest Node Discovery
T
C
![Page 164: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/164.jpg)
62
Closest Node Discovery
T
C
![Page 165: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/165.jpg)
63
Closest Node Discovery
T
C
![Page 166: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/166.jpg)
64
Meridian Theoretical AnalysisAnalytical guarantees for closest node discovery
Meridian can find the closest node with high probability
Given nodes in a space with a doubling metric
As well as a growth constrained metric
Scales well with increasing system size
Does not lead to hot spots
![Page 167: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/167.jpg)
65
Central Leader ElectionSelect the closest node to the center of a set of targets
Multicast trees can place central nodes higher in the hierarchy
Algorithm similar to closest node discovery
Minimizes avg. latency to a set of targets instead of one targetUses distance metric davg instead of d
Internode latencies of targets not knownNeed to be conservative in pruning peers
![Page 168: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/168.jpg)
66
Central Leader Election
C
T
T
T
![Page 169: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/169.jpg)
67
Central Leader Election
d1
C
T
T
T
d2
d3
![Page 170: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/170.jpg)
68
Central Leader Election
d1
C
T
T
T
d2
d3
![Page 171: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/171.jpg)
69
Central Leader Election
C
T
T
T
![Page 172: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/172.jpg)
70
Central Leader Election
C
T
T
T
![Page 173: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/173.jpg)
71
Central Leader Election
d3
d2d1
C
T
T
T
![Page 174: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/174.jpg)
72
Central Leader Election
d3
d2d1
C
T
T
T
![Page 175: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/175.jpg)
73
Central Leader Election
C
T
T
T
![Page 176: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/176.jpg)
74
Central Leader Election
C
T
T
T
![Page 177: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/177.jpg)
75
Multiconstraint SystemFind a node that satisfies a set of latency constraints
ISP can find a server that can satisfy a SLA with a clientGrid users can find a set of nodes with a bounded internode latency
There exists a solution space, containing 0 or more nodesOnly a solution point in previous problems
Requires a different distance metric s :
s = 0 when all constraints are satisfiedSum of squares places more weight on fringe constraints
Allows for faster convergence to solution space
Other metrics can be used, square works well in practice
![Page 178: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/178.jpg)
76
Multiconstraint System
T
T
T
C
![Page 179: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/179.jpg)
77
Multiconstraint System
T
T
T
C
![Page 180: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/180.jpg)
78
Multiconstraint System
T
T
T
C
![Page 181: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/181.jpg)
79
Multiconstraint System
T
T
T
C
![Page 182: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/182.jpg)
80
Multiconstraint System
T
T
T
C
![Page 183: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/183.jpg)
81
Multiconstraint System
T
T
T
C
![Page 184: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/184.jpg)
82
Multiconstraint System
T
T
T
C
![Page 185: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/185.jpg)
83
Multiconstraint System
T
T
T
C
![Page 186: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/186.jpg)
84
Multiconstraint System
T
T
T
C
![Page 187: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/187.jpg)
85
Meridian Query LanguageVariant of C/Python
Safe, polymorphic, and dynamicallytyped Includes an extensive set of library functions
Allows users to:Access multiresolution ringsIssue latency probesForward queries to peers
Tight resource limits on:Execution time of queryNumber of hopsAmount of memory allocated
![Page 188: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/188.jpg)
86
EvaluationEvaluated our system through a large scale simulation and a PlanetLab deployment
Simulation parameterized by real latency measurements
2500 DNS servers, latency between 6.25 million node pairs
DNS servers are authorities name servers for domains found in the Yahoo! web directory
We evaluated system sizes of up to 2000 nodes500 nodes reserved as targets
![Page 189: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/189.jpg)
87
Evaluation: Closest Node DiscoveryMeridian has an order of magnitude less error than virtual coordinate schemes
![Page 190: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/190.jpg)
88
Evaluation: Closest Node DiscoveryCDF of relative error shows Meridian is more accurate for both typical nodes and fringe nodes
![Page 191: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/191.jpg)
89
Evaluation: Closest Node DiscoveryWith k = log1.6 N, error and query latency remain constant as N increasesAverage query latency determined by slowest node in each ring
![Page 192: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/192.jpg)
90
Evaluation: Central Leader ElectionMeridian incurs significantly less relative error
![Page 193: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/193.jpg)
91
Evaluation: Multiconstraint SystemCategorized multiconstraint queries by its difficulty
Difficulty a measure of the number of nodes in solution space
Success rate for queries that can be satisfied by only 0.5% of the nodes:
VC: 11%Meridian: 91%4 Constraints
VC: 19%VC: 35% Meridian: 90%3 Constraints
Meridian: 91%2 Constraints
![Page 194: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/194.jpg)
92
Evaluation: PlanetLab DeploymentA PlanetLab deployment of 166 nodes shows the closest node discovery accuracy to be very close to the simulation results
Have expanded deployment to 325 PlanetLab nodes supporting all 3 applications and MQL
![Page 195: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/195.jpg)
93
ImplementationIncludes query language and the 3 protocols
Works with firewalled hosts
Can use DNS queries, TCP connect times, and Meridian UDP packets to measure latency
Optimizations:
Measurement cache reduces query latency
Ring management scheme to select more diverse peers
![Page 196: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/196.jpg)
94
ClosestNode.com
ClosestNode.com is a DNS redirection service that returns the IP address of closest node to the client
e.g. cobweb.closestnode.com will resolve to the closest CobWeb DHT node to the requesting client
Requires minimal changes to the serviceLinking the Meridian library and calling one function at startup
Or add standalone Meridian server to start script
No changes required for the client
Can register your service at:
http://www.closestnode.com
![Page 197: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/197.jpg)
95
Meridian SummaryA lightweight accurate system for selecting nodes
Combines query routing with active measurements
An order of magnitude less error than virtual coordinates
Solves the network location problem directlyDoes not need to be paired with CAN
Code, data, demos and more information athttp://www.cs.cornell.edu/People/egs/meridian
![Page 198: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/198.jpg)
96
Octant
Determining the physical location of Internet nodes in the real world(Combining Sextant with Meridian...)
![Page 199: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/199.jpg)
97
OctantOften need to determine the physical location of a machine on the Internet
Provide customized servicesTrace user activityPerform monitoring and locate attackers
Need to map from IP Address to geographic locationIP to Zip Code: Static, Coursegrained, Inaccurate
Need a dynamic, accurate way of finding physical location of machines
Must work even if host is behind NAT, firewall or in a VPN
![Page 200: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/200.jpg)
98
Octant Approach
Find general dependency between network latency and physical distanceSet up a system of constraints based on latency measurements to known landmark nodes
Aggressively extract constraintsUse both positive and negative information
Solve the system geometrically, yielding the set of physical areas on the globe where a target may be located
![Page 201: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/201.jpg)
99
Latency-Distance Relationship
Internet latencies correlated with distance
0
2000
4000
6000
8000
10000
0 50 100 150 200 250 300 350 400 450
Latency (ms)
Dis
tanc
e (k
m)
![Page 202: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/202.jpg)
100
Positive and Negative Information
A latency probe establishes the minimum and maximum distances between a target T and chosen landmarks
Geometric intersection yields target location
TT
r
R
![Page 203: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/203.jpg)
101
Cylindrical Equidistant Projection
Use Bézier curves to bound the areas in which a node can appear
Map curves onto projected 2D globe
![Page 204: Network Positioning for Wide-Area and Wireless Networks](https://reader031.fdocuments.us/reader031/viewer/2022020703/61fb33b62e268c58cd5b5dc0/html5/thumbnails/204.jpg)
102
Summary
Octant is a dynamic and accurate Internet host localization service
Achieves high fidelity by using both positive and negative information
Can be used to determine the physical location of any node without user input