Towards a Transparent and Proactively-Managed Internet Ehab Al-Shaer School of Computer Science DePaul University Yan Chen EECS Department Northwestern.

Slides:



Advertisements
Similar presentations
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Advertisements

1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
Cooperative Overlay Networking for Streaming Media Content Feng Wang 1, Jiangchuan Liu 1, Kui Wu 2 1 School of Computing Science, Simon Fraser University.
PROMISE: Peer-to-Peer Media Streaming Using CollectCast Mohamed Hafeeda, Ahsan Habib et al. Presented By: Abhishek Gupta.
Spring 2003CS 4611 Content Distribution Networks Outline Implementation Techniques Hashing Schemes Redirection Strategies.
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
© 2006 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice S 3 : A Scalable Sensing Service.
Networks and Distributed Systems: Project Ideas
1 Clustering Web Content for Efficient Replication Yan Chen, Lili Qiu*, Weiyu Chen, Luan Nguyen, Randy H. Katz EECS Department UC Berkeley *Microsoft Research.
Tomography-based Overlay Network Monitoring UC Berkeley Yan Chen, David Bindel, and Randy H. Katz.
Traffic Engineering With Traditional IP Routing Protocols
Internet Traffic Patterns Learning outcomes –Be aware of how information is transmitted on the Internet –Understand the concept of Internet traffic –Identify.
Comparing flow-oblivious and flow-aware adaptive routing Sara Oueslati and Jim Roberts France Telecom R&D CISS 2006 Princeton March 2006.
Criticisms of I3 Zhichun Li. General Issues Functionality Security Performance Practicality If not significant better than existing schemes, why bother?
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
1 Traffic Engineering for ISP Networks Jennifer Rexford IP Network Management and Performance AT&T Labs - Research; Florham Park, NJ
Tomography-based Overlay Network Monitoring and its Applications Joint work with David Bindel, Brian Chavez, Hanhee Song, and Randy H. Katz UC Berkeley.
1 Clustering Web Content for Efficient Replication Yan Chen, Lili Qiu*, Weiyu Chen, Luan Nguyen, Randy H. Katz EECS Department UC Berkeley *Microsoft Research.
Scalable Adaptive Data Dissemination Under Heterogeneous Environment Yan Chen, John Kubiatowicz and Ben Zhao UC Berkeley.
An Algebraic Approach to Practical and Scalable Overlay Network Monitoring University of California at Berkeley David Bindel, Hanhee Song, and Randy H.
Tomography-based Overlay Network Monitoring UC Berkeley Yan Chen, David Bindel, and Randy H. Katz.
Towards a Transparent Internet Ehab Al-Shaer School of Computer Science DePaul University Yan Chen EECS Department Northwestern University Richard Yang.
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
Tomography-based Overlay Network Monitoring and its Applications Joint work with David Bindel, Brian Chavez, Hanhee Song, and Randy H. Katz UC Berkeley.
Introspective Replica Management Yan Chen, Hakim Weatherspoon, and Dennis Geels Our project developed and evaluated a replica management algorithm suitable.
1 Routing as a Service Karthik Lakshminarayanan (with Ion Stoica and Scott Shenker) Sahara/i3 retreat, January 2004.
Yao Zhao 1, Yan Chen 1, David Bindel 2 Towards Unbiased End-to-End Diagnosis 1.Lab for Internet & Security Tech, Northwestern Univ 2.EECS department, UC.
Tomography-based Overlay Network Monitoring Hugo Angelmar Slides courtesy of (Yan Chen, David Bindel, and Randy H. Katz)
Or, Providing Scalable, Decentralized Location and Routing Network Services Tapestry: Fault-tolerant Wide-area Application Infrastructure Motivation and.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
World Wide Web Caching: Trends and Technology Greg Barish and Katia Obraczka USC Information Science Institute IEEE Communications Magazine, May 2000 Presented.
1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
SCAN: a Scalable, Adaptive, Secure and Network-aware Content Distribution Network Yan Chen CS Department Northwestern University.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
P4P: Provider Portal for Applications Haiyong Xie, Y. Richard Yang Arvind Krishnamurthy, Yanbin Liu, Avi Silberschatz SIGCOMM ’08 Hoon-gyu Choi
World Wide Web Caching: Trends and Technologys Gerg Barish & Katia Obraczka USC Information Sciences Institute, USA,2000.
Sharing Information across Congestion Windows CSE222A Project Presentation March 15, 2005 Apurva Sharma.
Advanced Networking Lab. Given two IP addresses, the estimation algorithm for the path and latency between them is as follows: Step 1: Map IP addresses.
Arun Venkataramani Donald Towsley Presented by: Shiqi Chen, Ionut Trestian.
Putting Intelligence in Internetworking: an Architecture of Two Level Overlay EE228 Project Anshi Liang Ye Zhou.
A Scalable, Adaptive, Network-aware Infrastructure for Efficient Content Delivery Yan Chen Ph.D. Status Talk EECS Department UC Berkeley.
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.
Architectures and Algorithms for Future Wireless Local Area Networks  1 Chapter Architectures and Algorithms for Future Wireless Local Area.
A Utility-based Approach to Scheduling Multimedia Streams in P2P Systems Fang Chen Computer Science Dept. University of California, Riverside
Towards a Scalable, Adaptive and Network-aware Content Distribution Network Yan Chen EECS Department UC Berkeley.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
1 Wide Area Network Emulation on the Millennium Bhaskaran Raman Yan Chen Weidong Cui Randy Katz {bhaskar, yanchen, wdc, Millennium.
Efficient and Adaptive Replication using Content Clustering Yan Chen EECS Department UC Berkeley.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Funda Ergun Behnam Malakooti Case Western Reserve University NAG Intelligent and Agile Protocols and Architectures for Space and Terrestrial Networks.
Content Delivery Networks: Status and Trends Speaker: Shao-Fen Chou Advisor: Dr. Ho-Ting Wu 5/8/
Challenges in the Next Generation Internet Xin Yuan Department of Computer Science Florida State University
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Network Computing Laboratory Load Balancing and Stability Issues in Algorithms for Service Composition Bhaskaran Raman & Randy H.Katz U.C Berkeley INFOCOM.
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.
Efficient and Adaptive Replication using Content Clustering Yan Chen EECS Department UC Berkeley.
1 Scalability and Accuracy in a Large-Scale Network Emulator Nov. 12, 2003 Byung-Gon Chun.
P4P : Provider Portal for (P2P) Applications Haiyong Xie, Y
Northwestern Lab for Internet and Security Technology (LIST) Yan Chen Department of Computer Science Northwestern University.
Content Distribution Network (CDN)
Dynamic Replica Placement for Scalable Content Delivery
Fixing the Internet: Think Locally, Impact Globally
EE 122: Lecture 22 (Overlay Networks)
Existing CDNs Fail to Address these Challenges
Using Service Function Chaining for In-Network Computation
Presentation transcript:

Towards a Transparent and Proactively-Managed Internet Ehab Al-Shaer School of Computer Science DePaul University Yan Chen EECS Department Northwestern University

Motivations The Internet has evolved to become a un- cooperative ossificated network of networks –Network has to be treated as a blackbox »Performance of even neighboring networks are opaque »Inter-domain routing based on policies but not performance »Have to resort to overlay networks which are suboptimal –Diagnosis and fault location extremely hard Network config management reactive and expensive –Reactive configurations: tune after deployment –Vulnerable: manually handled and subject to conflicts –Imperative & fragmented: need to access several specific devices in order to implement a service goal

Proposed Solution I: Transparent Internet Every network shares its measurement and management information with other networks when necessary (glass box) –Link-level performance: delay, loss rate, available bandwidth, etc. –Management info »Configuration: QoS setting, traffic policing »Middle box settings: firewalls, etc. The information sharing –As part of the inter-domain protocols: Transparent Gateway Protocols (TGP) –Other applications: leverage DHT

Analogy to the Airline Alliance When airlines compose multi-lag flights, they need more than just route info. –Type of aircraft, # of vacancies, probability of punctuation, etc. Such open model is mutual beneficial –Provide the best flight composition for clients –Similarly, open network model can provide best communications for applications

Proposed Solution II: Proactive Configuration Management Proactive verification: configuration verified and translated to different vendor specific devices Proactive validation: Test the configuration changes on the real archived network traffic without interrupting the main operation network Autonomic configuration: configurations are auto-tuned dynamically to achieve the “objectives definingVerifying Deploying Evaluating Optimizing Validation Dynamic Validation: auto-tuning

Objectives Provides a completely transparent view of the Internet to networks and applications Diagnosis & trouble shooting becomes extremely easy –No more Internet tomography needed Flexible inter-domain routing –Not just based on policy or # of AS/hops –Flexible metrics based on bandwidth, latency, etc. Global traffic engineering –Each AS performs its own local traffic engineering –Provide AS path-level routing guide Unified framework that applications query (push/pull) info as needed –Streaming media, content distribution –Anomaly/security applications

Flexible Inter-domain Routing Multiple routing paths with TGP –Incorporate measurement info into AS paths –Bandwidth-intensive and latency-intensive applications can take different AS paths. Challenge: inter-domain routing based on bandwidth without making reservation Solution: Discretize the bandwidth for better stability –Though stability is a classical problem, not unique to TGP

Global Traffic Engineering For the current Internet, only local optimum is achieved in each AS –Allowing the network to handle all traffic patterns possible, within the networks ingress-egress capacity constraints (e.g. two phase routing) With global information, we can potentially achieve global optimum (or Nash equilibrium) –Each AS is a selfish individual –A center (or each AS) infers the Nash equilibrium –Each AS can try the Nash equilibrium, or attempt to benefit itself based on the inferred Nash equilibrium

Example of Benefit of Global TE AS 1 AS 2 AS 3 AS 5 AS 4 1G 2G 1G 2G 1G traffic to AS 1

Without Global TE Example of Benefit of Global TE AS 1 AS 2 AS 3 AS 5 AS 4 1G 2G 1G 2G 1G traffic to AS 1 1G 0.5G 1.5G 0.5G

With Global TE Example of Benefit of Global TE AS 1 AS 2 AS 3 AS 5 AS 4 1G 2G 1G 2G 1G traffic to AS 1 1G

Unified Transparency Framework for Various Functionality Sharing of anomaly/security-related measurement –Various characteristics of traffic: heavy hitter, heavy changes, histogram, etc. –Self-diagnosis to survivability Adaptations –Routing adaptations at router level or application level

Practical Issues and Solutions Incentives for information sharing –Mandatory for next-generation Internet ? –Alliance model for incremental growth Security/cheating: Trust but verify –Trust most of the info shared but periodically verify »Much easier than the current Internet tomography unless many ASes collude –Verification part of the protocol »Some fields in the packet headers designed for that purpose

Backup Materials

Measurement Info to Share Basic metrics –Delay, loss rate, capacity, available bandwidth –Demand (or traffic volume) and application types Intra-AS Measurement Info –Link-level info »Queried only when necessary –Aggregated Info »OD flow level info »Path segment b/t entry and exit points in each AS Inter-AS Measurement Info –General AS relationship –AS-level topology –Inter-AS link metrics

Combined w/ routing info and export to neighboring ASes through TGP protocol Provide global retrievable Management Information Base (MIB) with DHT Network link-level monitoring Transparent Internet Architecture

Methodology Network topology Web workload Network end-to-end latency measurement Analytical evaluation Algorithm design Realistic simulation iterate PlanetLab tests

TGP MIB Dissemination Architecture Leverage Distributed Hash Table - Tapestry for –Distributed, scalable location with guaranteed success –Search with locality data plane network plane data source Web server SCAN server client replica always update cache DHT mesh Replica Location Dynamic Replication/Update and Replica Management adaptive coherence Overlay Network Monitoring

X UC Berkeley UC San Diego Stanford HP Labs Adaptive Overlay Streaming Media Implemented with Winamp client and SHOUTcast server Congestion introduced with a Packet Shaper Skip-free playback: server buffering and rewinding Total adaptation time < 4 seconds

Summary A tomography-based overlay network monitoring system –Selectively monitor a basis set of O(n logn) paths to infer the loss rates of O(n 2 ) paths –Works in real-time, adaptive to topology changes, has good load balancing and tolerates topology errors Both simulation and real Internet experiments promising Built adaptive overlay streaming media system on top of TOM –Bypass congestion/failures for smooth playback within seconds

Tie Back to SCAN Provision: Dynamic Replication + Update Multicast Tree Building Replica Management: (Incremental) Content Clustering Network End-to-End Distance Monitoring Internet Iso-bar: latency TOM: loss rate Network DoS Resilient Replica Location: Tapestry

Contribution of My Thesis Replica location –Proposed the first simulation-based network DoS resilience benchmark and quantify three types of directory services Dynamically place close to optimal # of replicas –Self-organize replicas into a scalable app-level multicast tree for disseminating updates Cluster objects to significantly reduce the management overhead with little performance sacrifice –Online incremental clustering and replication to adapt to users’ access pattern changes Scalable overlay network monitoring

Existing CDNs Fail to Address these Challenges Non-cooperative replication inefficient No coherence for dynamic content Unscalable network monitoring - O(M × N) M: # of client groups, N: # of server farms X

Problem Formulation Subject to certain total replication cost (e.g., # of URL replicas) Find a scalable, adaptive replication strategy to reduce avg access cost

CDN Applications (e.g. streaming media) SCAN: Scalable Content Access Network Provision: Cooperative Clustering-based Replication User Behavior/ Workload Monitoring Coherence: Update Multicast Tree Construction Network Performance Monitoring Network Distance/ Congestion/ Failure Estimation red: my work, black: out of scope

Comparison of Content Delivery Systems (cont’d) Properties Web caching (client initiated) Web caching (server initiated) Pull-based CDNs (Akamai) Push- based CDNs SCAN Distributed load balancing NoYes NoYes Dynamic replica placement Yes NoYes Network- awareness No Yes, unscalable monitoring system NoYes, scalable monitoring system No global network topology assumption Yes NoYes