1 / 29

EGOIST Overlay Routing using Selfish Neighbor Selection

EGOIST Overlay Routing using Selfish Neighbor Selection. Georgios Smaragdakis Joint work with Vassilis Lekakis, Nikos Laoutaris, Azer Bestavros, John Byers and Mema Roussopoulos. 1. O 2. Overlay Plane. O 1. O 3. Physical Plane. R 2. R 3. R 1. R 7. R 4. R 5. R 6. Overlay Networks.

ariane
Télécharger la présentation

EGOIST Overlay Routing using Selfish Neighbor Selection

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. EGOIST Overlay Routing using Selfish Neighbor Selection Georgios Smaragdakis Joint work with Vassilis Lekakis, Nikos Laoutaris, Azer Bestavros, John Byers and Mema Roussopoulos 1

  2. O2 Overlay Plane O1 O3 Physical Plane R2 R3 R1 R7 R4 R5 R6 Overlay Networks Applications • Overlay routing • P2P file sharing • Content distribution networks • Multimedia streaming • Online multiplayer games • …. 2

  3. Connectivity Management • Full mesh architectures for reliability (e.g. RON) • Myopic heuristics random or proximity based neighbor selection • Tree forest or mesh construction to optimize multicast (e.g. Bullet, Splitstream) • Optimization for network delay (e.g. Detour, QRON) • Opportunistic choke/unchoke (e.g. BitTorrent) • Distributed hashing tables (e.g. Chord, Pastry, Tapestry) 3

  4. w u Selfish Neighbor Selection Optimal wiring for vi: choose k neighbors, s.t. • [Laoutaris, Smaragdakis, Bestavros, Byers, INFOCOM’07] min vi 4

  5. Selfish Neighbor Selection Advantages • The selfish node can reap substantial performance. • The performance gain is higher under uninformed overlays. • The evolving stable graphs that consist of selfish nodes are highly optimized. • The computation of the exact optimal wiring might be expensive. • Requires full information about the network. • The number of iterative wirings before stabilization might be high. Disadvantages 5

  6. EGOIST:Key Contributions System Architecture • Link state protocol to support connectivity information dissemination. • Overlay monitoring and maintenance mechanism. • Computationally efficient neighbor selection. Performance Evaluation • Average performance in real operational scenaria. • Performance under different performance metrics (delay, system load, available bandwidth) • Overhead of the implementation. • Performance under churn. • Vulnerability to malicious users. • Applications. 6

  7. 111.1.1.1 122.2.2.2 25msecs 111.1.1.1 133.3.3.3 165msecs 111.1.1.1 122.2.2.2 25msecs 111.1.1.1 133.3.3.3 165msecs 111.1.1.1 122.2.2.2 25msecs 111.1.1.1 133.3.3.3 165msecs 111.1.1.1 122.2.2.2 25msecs 111.1.1.1 133.3.3.3 165msecs 111.1.1.1 122.2.2.2 25msecs 111.1.1.1 133.3.3.3 165msecs 111.1.1.1 122.2.2.2 25msecs 111.1.1.1 133.3.3.3 165msecs 111.1.1.1 122.2.2.2 25msecs 111.1.1.1 133.3.3.3 165msecs EGOIST:Basic Architecture 133.3.3.3 X 144.4.4.4 122.2.2.2 111.1.1.1 122.2.2.2 25msecs 111.1.1.1 133.3.3.3 165msecs 111.1.1.1 7

  8. EGOIST:Basic Architecture 133.3.3.3 144.4.4.4 122.2.2.2 111.1.1.1 8

  9. EGOIST:Monitoring 133.3.3.3 144.4.4.4 122.2.2.2 111.1.1.1 9

  10. EGOIST:Monitoring 133.3.3.3 144.4.4.4 122.2.2.2 111.1.1.1 10

  11. EGOIST:Rewiring 133.3.3.3 144.4.4.4 122.2.2.2 111.1.1.1 11

  12. EGOIST:Newcomers 133.3.3.3 144.4.4.4 122.2.2.2 111.1.1.1 99.9.9.9 12

  13. 133.3.3.3 DOWN EGOIST:Node Drop/Failure 133.3.3.3 144.4.4.4 122.2.2.2 111.1.1.1 12

  14. Performance Evaluation:Experimental Setting Objectives Nodes: • 50 PlanetLab nodes for 2 months. Wiring policies: • EGOIST • k-Random, k-Closest, k-Regular (DHT). • Wiring frequency: 60 seconds. Metrics of interest: • Delay (ping, Pyxida). • CPU load (loadavg). • Available Bandwidth (pathChirp). Control variables: • We vary the number (k) of neighbors. 11 7 30 1 1 13

  15. Performance Evaluation:Active Measurements delay/EGOIST delay EGOIST 14

  16. Performance Evaluation:Passive Measurements Wiring delay/EGOIST delay EGOIST EGOIST 15

  17. Performance Evaluation:System Load 10% utilization 10% utilization 10% utilization 111.1.1.1 16

  18. Performance Evaluation:System Load delay/EGOIST delay EGOIST 17

  19. Performance Evaluation:Available Bandwidth 2Mbps 3Mbps 1Mbps 3Mbps pathChirp 111.1.1.1 18

  20. Performance Evaluation:Available Bandwidth EGOIST bwth/EGOIST bwth 19

  21. Performance Evaluation:Re-wiring Frequency EGOIST delay/optimal delay EGOIST re-wirings Appr. EGOIST/optimal delay Appr. EGOIST re-wirings Normalized delay Approximate EGOIST wiring (e= 10%) EGOIST wiring • CPU, memory and bandwidth consumption is minimal. 20

  22. Performance Under Churn:Hybrid-EGOIST 133.3.3.3 144.4.4.4 122.2.2.2 111.1.1.1 21

  23. Performance Under Churn EGOIST Efficiency Index Connectivity quality K-Random K-Regular K-Closest Hybrid-EGOIST 22

  24. Performance Under Churn K-Random K-Regular K-Closest Hybrid-EGOIST EGOIST Efficiency Index Connectivity quality 23

  25. Performance Under Cheating Single Untruthful node Many Untruthful nodes Untruthful Truthful Untruthful Truthful truthful EGOIST truthful EGOIST Delay/ Delay with abuse 24

  26. Applications • Multi-path file transfer • Real-time VoIP • Online multiplayer P2P games EGOIST k-Closest k-Random k-Regular [Quake III traces from Donnybrook, SIGCOMM’08] 25

  27. Current Status • Explore worst case scenaria for cheating. • Study scalability. • Provide a general wiring service. 26

  28. http://csr.bu.edu/sns

  29. Thank you. 28

More Related