P4P: Proactive Provider Assistance for P2P Haiyong Xie Yale University.

Slides:



Advertisements
Similar presentations
P4P: ISPs and P2P Laird Popkin, Pando Networks Doug Pasko, Verizon.
Advertisements

Optimal Capacity Sharing of Networks with Multiple Overlays Zheng Ma, Jiang Chen, Yang Richard Yang and Arvind Krishnamurthy Yale University University.
Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
Cognitive Publish/Subscribe for Heterogeneous Clouds Šarūnas Girdzijauskas, Swedish Institute of Computer Science (SICS) Joint work with:
Phalanx: Withstanding Multimillion-Node Botnets Colin Dixon Arvind Krishnamurthy Tom Anderson University of Washington NSDI 2008.
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
Packet Caches on Routers: The Implications of Universal Redundant Traffic Elimination Ashok Anand, Archit Gupta, Aditya Akella University of Wisconsin,
PROMISE: Peer-to-Peer Media Streaming Using CollectCast Mohamed Hafeeda, Ahsan Habib et al. Presented By: Abhishek Gupta.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
Can Congestion Control and Traffic Engineering be at Odds? Jiayue He, Mung Chiang, Jennifer Rexford Princeton University November 30 th, 2006.
Traffic Engineering With Traditional IP Routing Protocols
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Motivation Due to the development of new Internet access technologies (DSL's and HFC's), VoD services have become increasingly popular Despite the continuous.
1IMIC, 8/30/99 Constraint-Based Unicast and Multicast: Practical Issues Bala Rajagopalan NEC C&C Research Labs Princeton, NJ
1 P4P: Provider Portal for Applications Haiyong Xie( 謝海永 )† Y. Richard Yang† *Arvind Krishnamurthy Yanbin Liu§ Avi Silberschatz† †Yale University *University.
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol Jiayue He Princeton University Joint work with Martin Suchara,
1 Routing as a Service Karthik Lakshminarayanan (with Ion Stoica and Scott Shenker) Sahara/i3 retreat, January 2004.
P4P: Proactive Provider Assistance for P2P Haiyong Xie (Yale) *This is a joint work with Arvind Krishnamurthy (UWashington) and Richard.
Multipath Routing CS 522 F2003 Beaux Sharifi. Agenda Description of Multipath Routing Necessity of Multipath Routing 3 Major Components Necessary for.
On Self Adaptive Routing in Dynamic Environments -- A probabilistic routing scheme Haiyong Xie, Lili Qiu, Yang Richard Yang and Yin Yale, MR and.
Backbone Support for Host Mobility: A Joint ORBIT/VINI Experiment Jennifer Rexford Princeton University Joint work with the ORBIT team (Rutgers) and Andy.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
Tradeoffs in CDN Designs for Throughput Oriented Traffic Minlan Yu University of Southern California 1 Joint work with Wenjie Jiang, Haoyuan Li, and Ion.
UCSC 1 Aman ShaikhICNP 2003 An Efficient Algorithm for OSPF Subnet Aggregation ICNP 2003 Aman Shaikh Dongmei Wang, Guangzhi Li, Jennifer Yates, Charles.
MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid, et. al. IEEE INFOCOM 2001.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
A User Experience-based Cloud Service Redeployment Mechanism KANG Yu.
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
CS An Overlay Routing Scheme For Moving Large Files Su Zhang Kai Xu.
P4P : Provider Portal for (P2P) Applications Laboratory of Networked Systems Yale University.
P4P: Provider Portal for Applications Haiyong Xie, Y. Richard Yang Arvind Krishnamurthy, Yanbin Liu, Avi Silberschatz SIGCOMM ’08 Hoon-gyu Choi
E VALUATION OF F AIRNESS IN ICN X. De Foy, JC. Zuniga, B. Balazinski InterDigital
HUAWEI TECHNOLOGIES CO., LTD. Page 1 Survey of P2P Streaming HUAWEI TECHNOLOGIES CO., LTD. Ning Zong, Johnson Jiang.
1 P4P - Provider Portal for Applications Based On The Article Haiyong Xie, Y. Richard Yang, Arvind Krishnamurthy, Yanbin Liu and Avi Silberschatz, P4P:
Quantitative Evaluation of Unstructured Peer-to-Peer Architectures Fabrício Benevenuto José Ismael Jr. Jussara M. Almeida Department of Computer Science.
OPERETTA: An Optimal Energy Efficient Bandwidth Aggregation System Karim Habak†, Khaled A. Harras‡, and Moustafa Youssef† †Egypt-Japan University of Sc.
P4P : Provider Portal for (P2P) Applications Laird Popkin Pando Networks, Inc Haiyong Xie Laboratory of Networked Systems Yale University.
A Utility-based Approach to Scheduling Multimedia Streams in P2P Systems Fang Chen Computer Science Dept. University of California, Riverside
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.
P4P : Provider Portal for (P2P) Applications Haiyong Xie, Y. Richard Yang, Arvind Krishnamurthy, and Avi Silberschatz.
P4P: Towards Cooperation between P2P and ISPs Haiyong Xie (Yale) Arvind Krishnamurthy (U. Washington) Avi Silberschatz (Yale) Y. Richard Yang (Yale)
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
ALTO: A Multi Dimensional Peer Selection Problem IETF 73 Saumitra Das
Towards a High Performance Extensible Grid Architecture Klaus Krauter Muthucumaru Maheswaran {krauter,
Accelerating Peer-to-Peer Networks for Video Streaming
Confluent vs. Splittable Flows
P4P : Provider Portal for (P2P) Applications Haiyong Xie, Y
Presented by Tae-Seok Kim
UNIT-V Transport Layer protocols for Ad Hoc Wireless Networks
H.264/SVC Video Transmission Over P2P Networks
PROTEAN: A Scalable Architecture for Active Networks
RTP: A Transport Protocol for Real-Time Applications
Group 2: Qiuxi Zhu, Buchao Yu, Guoxi Wang
A Framework for Automatic Resource and Accuracy Management in A Cloud Environment Smita Vijayakumar.
nTorrent: Peer-to-Peer File Sharing in Named Data Networking
Chapter 3: Open Systems Interconnection (OSI) Model
P4P: ISPs and P2P Laird Popkin, Pando Networks Doug Pasko, Verizon.
The Impact of Multihop Wireless Channel on TCP Performance
QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.
Authors: Jinliang Fan and Mostafa H. Ammar
P4P : Provider Portal for (P2P) Applications
Presentation transcript:

P4P: Proactive Provider Assistance for P2P Haiyong Xie Yale University

NY P2P Meetup 2 Roadmap  Motivation  P4P framework  Design rationale  System architecture  Computing peering suggestions  Evaluations  Ongoing work

NY P2P Meetup 3 P2P : The Significant Bandwidth Consumer Traffic  Up to 60-70% of Internet traffic is contributed by P2P applications [cachelogic]  Random peering causes traffic spread across PoPs and domains Problems  Increased network resource usage (e.g., using bandwidth of more links)  Increased network operational costs  Degraded performance of other applications

NY P2P Meetup 4 Bandwidth Battle between ISPs and P2P The battle results in a lose-lose situation ISPs try to “manage” P2P traffic  Upgrade network infrastructure  Deploy P2P caching devices  Terminate connectivity  Rate limit P2P traffic P2P tries to evade from being captured  Use random ports  Encrypt traffic

NY P2P Meetup 5 Where is the Fundamental Problem? Traditional ISP feedback/control to application traffic:  Routing/TE  Rate control through congestion feedback (packet drops) These are ineffective for P2P  Due to highly dynamic, scattered traffic pattern caused by dynamic, unguided (network-oblivious) peer selection Need a mechanism for ISPs to communicate with P2P about network status and policies

NY P2P Meetup 6 Objective Design a framework to enable better ISP and P2P coordination  ISPs and P2P jointly decide P2P peer selection ISPs “guide” the peering relationships in P2P systems to  Improve throughput of P2P users  Make it feasible to implement ISP policies (e.g., intradomain TE, interdomain TE and cost optimization)

NY P2P Meetup 7 P4P Framework – Design Rationale Performance improvement for both ISPs and P2P Scalability  Support a large number of P2P users and networks in dynamic settings Privacy preservation Extensibility  Application-specific requirements  Tracker-based vs. trackerless P2P systems  Gossip among peers Incremental deploymentability

NY P2P Meetup 8 ISP A Design For Tracker-based P2P pTrackeriTracker peer Use BitTorrent in a single ISP as an example  pTracker keeps P2P system states  iTracker makes suggestions for peering relationships Information flow:  1. peer queries pTracker  2. pTracker asks iTracker for guidance  3. iTracker returns high- level peering suggestions  4. pTracker selects and returns a set of active peers, according to the suggestions iTracker can be run by trusted third parties.

NY P2P Meetup 9 ISP A A Complete P4P Design 1 pTracker iTracker Peer a iTracker’s responsibilities  Keeps P2P system states (PID-based, light-weight)  makes suggestions for peering relationships Information flow:  1. peers register or update with iTracker  2. iTracker returns PID and PID-based peering suggestions  3. Peers exchange peer information (with associated PID information) through gossips  4. Peers update peering relationships according to the received peering suggestions Peer b

NY P2P Meetup 10 Compute Suggested Peering Relationships Formulate as a joint optimization problem  ISP’s objective: minimize maximum link utilization  P2P’s objective: maximize throughput  Allow a certain number of random connections to ensure robustness Naïve approach takes multiple steps  Compute optimal throughput for each P2P system  Solve the ISP optimization problem with constraints of each P2P system’s throughput being maximized One-step approach through duality transformation min max link_utilization s.t. P2P throughput is maximized

NY P2P Meetup 11 Evaluation – Methodology Simulations  Discrete-event simulation a module for modeling BitTorrent protocol a module for modeling underlying network topology and data transfer dynamics using TCP rate equation  Network topology: PoP-level AT&T and Abilene topologies  Network routing: OSPF routing PlanetLab experiments  53 Internet2 nodes on PlanetLab  iTracker for Abilene network  Use OSPF routing to re-construct traffic load on Abilene links

NY P2P Meetup 12 Evaluation – Abilene Simulation Compared to P4P, native P2P can result in  2x download completion time  2x higher link utilization Native P2P can result in some peers experiencing very long download completion time Native P2P can result in much larger variance in link utilization

NY P2P Meetup 13 Evaluation – AT&T Simulation Compared to P4P, native P2P can result in  1.6x download completion time  3x higher link utilization Some peers can experience very long download completion time with native P2P Link utilization variance can be larger for native P2P

NY P2P Meetup 14 Evaluation – Liveswarms on Planetlab Liveswarms* is a P2P-based video streaming application, which adapts BitTorrent protocol to video streaming context Run liveswarms on 53 PlanetLab nodes for 900 seconds P4P and native liveswarms achieve roughly the same amount of throughput P4P reduces link load  Average link load saving is 34MB  Maximum average link load saving is 60% Native liveswarms:1Mbps P4P liveswarms: 432Kbps *Michael Piatek, Colin Dixon, Arvind Krishnamurthy, Tom Anderson. LiveSwarms: Adapting BitTorrent for end host multicast. Technical report: UW-CSE

NY P2P Meetup 15 Summary and Ongoing Work Our design achieves the objective  Performance improvement for both ISPs and P2P  Scalability: iTracker is light-weight, maintains necessary states only  Privacy preservation  Extensibility  Robustness Ongoing work  Evaluate the design through large-scale experiments  More P2P application types (e.g., streaming and VoD)  P4P for multiple domains

NY P2P Meetup 16 Questions?