network coordinates : internet distance estimation jieming zhu 15-11-2011
TRANSCRIPT
![Page 1: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/1.jpg)
Network Coordinates : Internet Distance Estimation
Jieming ZHU15-11-2011
![Page 2: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/2.jpg)
Outline
2
• Motivation
• Problem Statement
• General Approaches
• Applications
• Open Issues
![Page 3: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/3.jpg)
3
What is “Internet distance”?
• Round trip time– Symmetric– Relatively stable– Triangle inequality violation
• Bandwidth, loss rate– Not really “distance”, but useful– Asymmetric
![Page 4: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/4.jpg)
4
Why estimate distances?
![Page 5: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/5.jpg)
5
Why estimate distances?• Distance estimation can be used to optimize
large scale distributed systems:– Server selection– Locality aware peer-to-peer overlay networks– Application level multicast
• Problems with on-demand measurement:– Slow (e.g. ping N*(N-1) times)– High overhead
![Page 6: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/6.jpg)
Outline
6
• Motivation
• Problem Statement
• General Approaches
• Applications
• Open Issues
![Page 7: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/7.jpg)
7
Problem Statement• Network Coordinates: Internet as a
geometric space– Map each node to a position in the geometric space – Each host has a “coordinate”– Compute distances based on coordinates
![Page 8: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/8.jpg)
Outline
8
• Motivation
• Problem Statement
• General Approaches
• Applications
• Open Issues
![Page 9: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/9.jpg)
9
General Approaches• Landmark-based algorithms:
– Each node measure latency to set of landmark nodes– Use landmark nodes to calculate own coordinate– E.g. GNP [CMU], Lighthouses [Cambridge]
• Distributed algorithms:– Each node measures latency to random other nodes– Model embedding as a spring system– E.g. Vivaldi [MIT], DCS [Ottawa]
• Matrix factorization based algorithms– Based on SVD/NMF– E.g. IDES [Penn], Phoenix [Tsinghua]
![Page 10: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/10.jpg)
10
1. GNP: Global Network Positioning• Landmark operations
– Compute the coordinates of the Landmarks by minimizing:
where
jiLLLL
SLLLL
SL
SL
Nji
jijiNddccf
|},...,{, 1
1),(),...,( min
2)(),(21212121
SHHHH
SHHHH dddd
![Page 11: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/11.jpg)
11
1. GNP: Global Network Positioning• Ordinary host operations
– Ordinary host derives its own coordinates by using the coordinates of the landmarks
},...,{ 1
),()(minNi
iiLLL
SHLHL
SH ddcf
– Simplex downhill algorithm to solve the minimization problem
![Page 12: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/12.jpg)
12
2. Vivaldi: Distributed
![Page 13: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/13.jpg)
13
2. Vivaldi: Distributed
Confidence in remote node
Confidence in self
Adjust time step
![Page 14: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/14.jpg)
14
2. Drawback: Euclidean embedding
N1
N2
N3A
B C
|| A || <= || B || + || C||
N1
N2
N3100 ms
48 ms 48 ms
100 <= 48 + 48100 <= 96
• TIV: Triangle Inequality Violation
• GNP & Vivaldi: TIVInaccuracy
![Page 15: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/15.jpg)
15
3. IDES: MF based
![Page 16: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/16.jpg)
16
Evaluation
IDES vs. GNP
Vivaldi vs. GNP Vivaldi vs. GNP
![Page 17: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/17.jpg)
Outline
17
• Motivation
• Problem Statement
• General Approaches
• Applications
• Open Issues
![Page 18: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/18.jpg)
18
Applications• File sharing systems: find the nearest peer• Database query optimization• Overlay network multicast• Context distribution networks• Location-aware server selection• Compact routing• Distributed network games: find the top k
nearest servers for the player
![Page 19: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/19.jpg)
19
Applications
![Page 20: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/20.jpg)
Outline
20
• Motivation
• Problem Statement
• General Approaches
• Applications
• Open Issues
![Page 21: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/21.jpg)
21
Open Issues• Accuracy : TIV problem• Scalability : Efficient (fast convergence)
distributed algorithms• Robustness:
– Effect of network traffic– Impact of malicious nodes
• Stability– Vivaldi: Behavior of system when nodes are joining and
leaving (node churn)– GNP: Impact of Landmarks leaving the system
• Applications: Web service selection
![Page 22: Network Coordinates : Internet Distance Estimation Jieming ZHU 15-11-2011](https://reader033.vdocument.in/reader033/viewer/2022051418/5697bfc21a28abf838ca5077/html5/thumbnails/22.jpg)
Thank you!
Questions?