Presentation is loading. Please wait.

Presentation is loading. Please wait.

Tracker-based Peer Selection using ALTO Map Information draft-yang-tracker-peer-selection-00 Y. Richard Yang Richard Alimi, Ye Wang, David Zhang, Kai Lee.

Published byOsborne Bailey Modified over 9 years ago

Similar presentations

Presentation on theme: "Tracker-based Peer Selection using ALTO Map Information draft-yang-tracker-peer-selection-00 Y. Richard Yang Richard Alimi, Ye Wang, David Zhang, Kai Lee."— Presentation transcript:

1 Tracker-based Peer Selection using ALTO Map Information draft-yang-tracker-peer-selection-00 Y. Richard Yang Richard Alimi, Ye Wang, David Zhang, Kai Lee IETF 79 - Beijing, China - Nov 2010

2 Challenges Tracker Scalability  Many peers distributed in many torrents/channels  Many ISPs providing ALTO info Application-Network Information Fusion  Application requirements/policies  Application endpoint info  Network providers’ ALTO info  Third-party database info 2 IETF 79 - Beijing, China - Nov 2010

3 Simple Representation Problem: scanning Peer Table to select peers can be inefficient Peer IDIP AddressUpload Capacity Play PointALTO Network Info City… GH4C9128.36.233.1512 kbps01:19:21pid1.yaleNew Haven … J8NRE130.132.10.210 Mbps00:05:37pid2.yaleUnknown… ………………… 3 IETF 79 - Beijing, China - Nov 2010 Peer Table Cost Tables, e.g.,  ALTO Cost table

4 Peer Selection using Classification Objective  Aggregation to improve scalability only need to match categories  better scalability Many Classification Attributes, e.g.,  Upload capacity class, play point cluster, ALTO Network Map Multi-Dimension Classification  Classify peers using multiple attributes, e.g., Level 1: ALTO Network Map Level 2: Upload capacity 4 IETF 79 - Beijing, China - Nov 2010

5 Peer Classification: an Example IETF 79 - Beijing, China - Nov 2010 5 Classification 1 (upload capacity) Classification 2 (ALTO map) n1 (Root) n2 (low) n3 (med) n4 (high) n5 (Root) n6 (ISP1) n7 (ISP2) n8 (PID1) n9 (PID2) n10 (PIDA) n11 (PIDB)

6 Peer Classification: an Example IETF 79 - Beijing, China - Nov 2010 6 new peer (high capacity) (IP address in ISP1:PID2) Classification 1 (upload capacity) Classification 2 (ALTO map) n1 (Root) n2 (low) n3 (med) n4 (high) n5 (Root) n6 (ISP1) n7 (ISP2) n8 (PID1) n9 (PID2) n10 (PIDA) n11 (PIDB)

7 Peer Selection using Classification Home Node  A leaf category node where the peer issuing LISTING request belongs to Peer Selection Sequence  A mapping: from a home node to a traversal sequence of category nodes, with a specified target fraction to be reached upon visiting each node Peer Selection Process  Sequentially follow the nodes in the sequence in order 7 IETF 79 - Beijing, China - Nov 2010

8 An Example Peer A in n4 (home leaf) requests 50 neighbors: - select up to 25 (50%) peers from n4; - continue to reach up to 40 (80%) from n5; - continue to reach up to 49 (95%) from n2; - continue to reach up to 50 (100%) from n3 Peering Selection Table n4→[n4, 50%] [n5, 80%] [n2, 95%] [n3, 100%] n5→[n4, 20%] [n5, 60%] [n2, 95%] [n3, 100%] … n9→… 8 IETF 79 - Beijing, China - Nov 2010 A, B, C… D, E… A, B, C, D, E… Root ISP1 (n1) HC (n4) LC (n5) ISP2 (n2) HC (n6) LC (n7) ISP3 (n3) HC (n8) LC (n9)

9 Simple Peer Classification using ALTO Network Maps One three-layer classification tree using the ALTO Network Map of each ISP  Used in P4P trials  Can be used with distributed trackers (one tracker per ISP) … … 9 IETF 79 - Beijing, China - Nov 2010 ISP1 Root Intra- ISP1 iPID ePID … …

10 Peering Matrix Computation Bandwidth Matching  Consider both application requirements and ALTO info for each PID, tracker periodically estimates aggregated upload capacity and download demand use bandwidth matching algorithm to compute weights Generic Peering Matrix bandwidth matching, assuming uniform supply and demand across PIDs ALTO Services Application Peering Matrix Computation Network Map Cost Map App-specific or generic peering matrix App-specific states 10 IETF 79 - Beijing, China - Nov 2010

11 ALTO/P4P Library for Tracker Peer Selection 11 Application Optimization Engine (peering matrix computation; a separate thread or machine) ALTO Info update (run in its own thread) Peer Classification: -Upon peer arrival, looks up new address in each ALTO Network Map IETF 79 - Beijing, China - Nov 2010 Peer Selection: -Upon peer LISTING request, selects peers according to classification Peer Update: -Upon peer keep alive, update statistics of classification

12 Memory: < 150 MB Benchmarking 12 Application Optimization Engine (if state dependent, 5 sec) ALTO Info update (run in its own thread; potentially slowest) Peer Classification: -Lookup rate: ~2,000,000 lookups/sec using Patricia tree IETF 79 - Beijing, China - Nov 2010 Peer Selection: -Join rate (classification + peer selection): 25,000 peers/sec in single thread Peer Update 1,000,000 peers; Network Map/Cost Map with 10 to 30 PIDs

13 PlanetLab Experiments Experiment Setup  ~2500 P2P live streaming clients 4 instances running on each PlanetLab node  Three emulated ALTO servers US, Europe, Asia  Generic Peering Matrix using the library Results Metricw/o ALTOw/ ALTO Network Efficiency Intra-US supply ratio 25.9 GB (/44.1 GB) 58.7% 40.9 GB (/52.6 GB) 77.8% Intra-PID supply ratio 6.9 GB 15.6% 22.7 GB 43.2% Application Performance Avg. Playback Startup Delay 31.1 seconds26.9 seconds #Playback Freezes106 for all clients52 for all clients 13 IETF 79 - Beijing, China - Nov 2010

14 Thank you! IETF 79 - Beijing, China - Nov 2010 14

15 Backup Slides

16 Tracker ISP Data Structures ISP 1ISP M ISPPIDMap PIDMap PIDMapPortalAPI ISPPDistanceMap PDistanceMap PDistanceMapPortalAPI 16 IETF 79 - Beijing, China - Nov 2010

17 Per Channel Data Structures isp1ispK Peer Group1 Peer Group2 Peer Group 3 Peer Group 4 17 IETF 79 - Beijing, China - Nov 2010

18 Peering Matrix  A data structure to implement peering weights of per-ISP classification tree each entry in matrix encodes peering weight from row to column complexity: O(N) iPID1iPID2iPID3iPID4intra ISP ePID1ePID2ePID3 iPID1 iPID2 iPID3 iPID4 18 IETF 79 - Beijing, China - Nov 2010

19 Implementation Experience Processing Complexity  Peer IP lookup in peer classification We use Patricia Trie for IP address lookup: > 2,000,000/second  extended LC-trie can be more efficient  hash map is slow Multi-thread Processing  ALTO info update should run in a thread periodically refresh ALTO maps Network Map update triggers Cost Map update and peer classification update  slowest part Cost Map update triggers Peering Matrix update  e.g., by calling AOE  Can run multi-thread workers for peer classification if peer arrival/departure rate is high 19 IETF 79 - Beijing, China - Nov 2010

Download ppt "Tracker-based Peer Selection using ALTO Map Information draft-yang-tracker-peer-selection-00 Y. Richard Yang Richard Alimi, Ye Wang, David Zhang, Kai Lee."

Similar presentations

Digital Library Service – An overview Introduction System Architecture Components and their functionalities Experimental Results.

Digital Library Service – An overview Introduction System Architecture Components and their functionalities Experimental Results.
Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.

Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.
20/10/2006ALPAGE1 Ordered slicing of very large scale overlay networks Mark Jelasity University of Bologna, Italy Anne-Marie Kermarrec INRIA Rennes/IRISA,

20/10/2006ALPAGE1 Ordered slicing of very large scale overlay networks Mark Jelasity University of Bologna, Italy Anne-Marie Kermarrec INRIA Rennes/IRISA,
More on protocol implementation Version walks Timers and their problems.

More on protocol implementation Version walks Timers and their problems.
Playback delay in p2p streaming systems with random packet forwarding Viktoria Fodor and Ilias Chatzidrossos Laboratory for Communication Networks School.

Playback delay in p2p streaming systems with random packet forwarding Viktoria Fodor and Ilias Chatzidrossos Laboratory for Communication Networks School.
On Large-Scale Peer-to-Peer Streaming Systems with Network Coding Chen Feng, Baochun Li Dept. of Electrical and Computer Engineering University of Toronto.

On Large-Scale Peer-to-Peer Streaming Systems with Network Coding Chen Feng, Baochun Li Dept. of Electrical and Computer Engineering University of Toronto.
Conducted by:Cheng Wen Chi Chiu Kwok Shing Choi Kwok Yam Advised by Prof. Danny Tsang TD1a-09, BEng of Computer Engineering, HKUST.

Conducted by:Cheng Wen Chi Chiu Kwok Shing Choi Kwok Yam Advised by Prof. Danny Tsang TD1a-09, BEng of Computer Engineering, HKUST.
Kangaroo: Video Seeking in P2P Systems Xiaoyuan Yang †, Minas Gjoka ¶, Parminder Chhabra †, Athina Markopoulou ¶, Pablo Rodriguez † † Telefonica Research.

Kangaroo: Video Seeking in P2P Systems Xiaoyuan Yang †, Minas Gjoka ¶, Parminder Chhabra †, Athina Markopoulou ¶, Pablo Rodriguez † † Telefonica Research.
Lava: A Reality Check of Network Coding in Peer-to-Peer Live Streaming Mea Wang, Baochun Li Department of Electrical and Computer Engineering University.

Lava: A Reality Check of Network Coding in Peer-to-Peer Live Streaming Mea Wang, Baochun Li Department of Electrical and Computer Engineering University.
Suphakit Awiphan, Takeshi Muto, Yu Wang, Zhou Su, Jiro Katto

Suphakit Awiphan, Takeshi Muto, Yu Wang, Zhou Su, Jiro Katto
PERSISTENT DROPPING: An Efficient Control of Traffic Aggregates Hani JamjoomKang G. Shin Electrical Engineering & Computer Science UNIVERSITY OF MICHIGAN,

PERSISTENT DROPPING: An Efficient Control of Traffic Aggregates Hani JamjoomKang G. Shin Electrical Engineering & Computer Science UNIVERSITY OF MICHIGAN,
Efficient and Flexible Parallel Retrieval using Priority Encoded Transmission(2004) CMPT 886 Represented By: Lilong Shi.

Efficient and Flexible Parallel Retrieval using Priority Encoded Transmission(2004) CMPT 886 Represented By: Lilong Shi.
Router Architecture : Building high-performance routers Ian Pratt

Router Architecture : Building high-performance routers Ian Pratt
A Peer-to-Peer On-Demand Streaming Service and Its Performance Evaluation Presenter: Nera Liu Author: Yang Guo, Kyoungwon Suh, Jim Kurose and Don Towsley.

A Peer-to-Peer On-Demand Streaming Service and Its Performance Evaluation Presenter: Nera Liu Author: Yang Guo, Kyoungwon Suh, Jim Kurose and Don Towsley.
CStream: Neighborhood Bandwidth Aggregation For Better Video Streaming Thangam Vedagiri Seenivasan Advisor: Mark Claypool Reader: Robert Kinicki 1 M.S.

CStream: Neighborhood Bandwidth Aggregation For Better Video Streaming Thangam Vedagiri Seenivasan Advisor: Mark Claypool Reader: Robert Kinicki 1 M.S.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.

Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
Scribe: A Large-Scale and Decentralized Application-Level Multicast Infrastructure Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, and Antony L. T.

Scribe: A Large-Scale and Decentralized Application-Level Multicast Infrastructure Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, and Antony L. T.
Boost Write Performance for DBMS on Solid State Drive Yu LI.

Boost Write Performance for DBMS on Solid State Drive Yu LI.
Efficient IP-Address Lookup with a Shared Forwarding Table for Multiple Virtual Routers Author: Jing Fu, Jennifer Rexford Publisher: ACM CoNEXT 2008 Presenter:

Efficient IP-Address Lookup with a Shared Forwarding Table for Multiple Virtual Routers Author: Jing Fu, Jennifer Rexford Publisher: ACM CoNEXT 2008 Presenter:
CoolStreaming/DONet: A Data- driven Overlay Network for Peer- to-Peer Live Media Streaming INFOCOM 2005 Xinyan Zhang, Jiangchuan Liu, Bo Li, and Tak- Shing.

CoolStreaming/DONet: A Data- driven Overlay Network for Peer- to-Peer Live Media Streaming INFOCOM 2005 Xinyan Zhang, Jiangchuan Liu, Bo Li, and Tak- Shing.

Similar presentations

Ads by Google