Rob Jansen and Nick Hopper University of Minnesota

Slides:

Advertisements

Similar presentations

PlanetLab V3 and beyond Steve Muir Princeton University September 17, 2004.

Advertisements

CGrid 2005, slide 1 Empirical Evaluation of Shared Parallel Execution on Independently Scheduled Clusters Mala Ghanesh Satish Kumar Jaspal Subhlok University.

Concurrent programming: From theory to practice Concurrent Algorithms 2014 Vasileios Trigonakis Georgios Chatzopoulos.

Estinet open flow network simulator and emulator. IEEE Communications Magazine 51.9 (2013): Wang, Shie-Yuan, Chih-Liang Chou, and Chun-Ming Yang.

PI Notifications 1.1 Tim Drews, QA Developer David Moler, Developer.

LOAD BALANCING IN A CENTRALIZED DISTRIBUTED SYSTEM BY ANILA JAGANNATHAM ELENA HARRIS.

Flash: An efficient and portable Web server Authors: Vivek S. Pai, Peter Druschel, Willy Zwaenepoel Presented at the Usenix Technical Conference, June.

ARP Traffic Study Jim Rees, Manish Karir Research and Development Merit Network Inc.

SKELETON BASED PERFORMANCE PREDICTION ON SHARED NETWORKS Sukhdeep Sodhi Microsoft Corp Jaspal Subhlok University of Houston.

Adam Duffy Edina Public Schools.  The heart of virtualization is the “virtual machine” (VM), a tightly isolated software container with an operating.

Transparent Checkpoint of Closed Distributed Systems in Emulab Anton Burtsev, Prashanth Radhakrishnan, Mike Hibler, and Jay Lepreau University of Utah,

Modeling Kanban Scheduling in Systems of Systems Alexey Tregubov, Jo Ann Lane.

Presented by: Yash Gurung, ICFAI UNIVERSITY.Sikkim BUILDING of 3 R'sCLUSTER PARALLEL COMPUTER.

Towards High-Availability for IP Telephony using Virtual Machines Devdutt Patnaik, Ashish Bijlani and Vishal K Singh.

1 Soft Timers: Efficient Microsecond Software Timer Support For Network Processing Mohit Aron and Peter Druschel Rice University Presented By Jonathan.

RDMA ENABLED WEB SERVER Rajat Sharma. Objective  To implement a Web Server serving HTTP client requests through RDMA replacing the traditional TCP/IP.

1 An Empirical Study on Large-Scale Content-Based Image Retrieval Group Meeting Presented by Wyman

Virtual Network Servers. What is a Server? 1. A software application that provides a specific one or more services to other computers  Example: Apache.

THE AFFORDABLE SUPERCOMPUTER HARRISON CARRANZA APARICIO CARRANZA JOSE REYES ALAMO CUNY – NEW YORK CITY COLLEGE OF TECHNOLOGY ECC Conference 2015 – June.

Introduction to HP LoadRunner Getting Familiar with LoadRunner >>>>>>>>>>>>>>>>>>>>>>

Venkatram Ramanathan 1. Motivation Evolution of Multi-Core Machines and the challenges Background: MapReduce and FREERIDE Co-clustering on FREERIDE Experimental.

Predicting performance of applications and infrastructures Tania Lorido 27th May 2011.

Shadow: Simple HPC for Systems Security Research Invited Talk Kansas State University September 25 th, 2013 Rob Jansen U.S. Naval Research Laboratory

Planning and Designing Server Virtualisation.

AUTHORS: STIJN POLFLIET ET. AL. BY: ALI NIKRAVESH Studying Hardware and Software Trade-Offs for a Real-Life Web 2.0 Workload.

Adam Duffy Edina Public Schools.  Traditional server ◦ One physical server ◦ One OS ◦ All installed hardware is limited to that one server ◦ If hardware.

High Performance Computing Processors Felix Noble Mirayma V. Rodriguez Agnes Velez Electric and Computer Engineer Department August 25, 2004.

Group 1 Remote Computer Monitoring System Nick ConwayDoug Lother James HaggardWes Reinhart.

Effect Of Message Size and Number of Clients on WS Frameworks For CIS* Service Oriented Computing Dariusz Grabka Gerett Commeford Jack Cole.

Sandor Acs 05/07/

Fulvio Galeazzi, CHEP 2003, Mar 24— A Monitoring System for the BaBar INFN Computing Cluster Moreno Marzolla Università “Ca' Foscari” di Venezia.

A Measurement Based Memory Performance Evaluation of High Throughput Servers Garba Isa Yau Department of Computer Engineering King Fahd University of Petroleum.

Investigating the Performance of Audio/Video Service Architecture II: Broker Network Ahmet Uyar & Geoffrey Fox Tuesday, May 17th, 2005 The 2005 International.

LHCb-Italy Farm Monitor Domenico Galli Bologna, June 13, 2001.

1 Evaluation of Cooperative Web Caching with Web Polygraph Ping Du and Jaspal Subhlok Department of Computer Science University of Houston presented at.

1 Soft Timers: Efficient Microsecond Software Timer Support For Network Processing Mohit Aron and Peter Druschel Rice University Presented By Oindrila.

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Based upon slides from Jay Lepreau, Utah Emulab Introduction Shiv Kalyanaraman

GridNEWS: A distributed Grid platform for efficient storage, annotating, indexing and searching of large audiovisual news content Ioannis Konstantinou.

How Low Can You Go: Balancing Performance with Anonymity in Tor’ DC-Area Anonymity,Privacy, and Security Seminar May 10 th, 2013 Rob Jansen U.S. Naval.

Mellanox Connectivity Solutions for Scalable HPC Highest Performing, Most Efficient End-to-End Connectivity for Servers and Storage September 2010 Brandon.

PROOF Benchmark on Different Hardware Configurations 1 11/29/2007 Neng Xu, University of Wisconsin-Madison Mengmeng Chen, Annabelle Leung, Bruce Mellado,

Shadow: Scalable Simulation for Systems Security Research CrySP Speaker Series on Privacy University of Waterloo January 20 th, 2016 Rob Jansen U.S. Naval.

Cloud Computing – UNIT - II. VIRTUALIZATION Virtualization Hiding the reality The mantra of smart computing is to intelligently hide the reality Binary->

CIP HPC CIP - HPC HPC = High Performance Computer It’s not a regular computer, it’s bigger, faster, more powerful, and more.

1 Evaluation of Cooperative Web Caching with Web Polygraph Ping Du and Jaspal Subhlok Department of Computer Science University of Houston presented at.

Intra-Socket and Inter-Socket Communication in Multi-core Systems Roshan N.P S7 CSB Roll no:29.

Introduction to threads

Mohit Aron Peter Druschel Presenter: Christopher Head

Virtualization for Cloud Computing

Optimizing Distributed Actor Systems for Dynamic Interactive Services

Application or server monitoring

PeerFlow: Secure Load Balancing in Tor Aaron Johnson1 Rob Jansen1 Aaron Segal2 Nicholas Hopper3 Paul Syverson1 1U.S. Naval Research Laboratory 2Yale.

Diskpool and cloud storage benchmarks used in IT-DSS

Self Healing and Dynamic Construction Framework:

Experiences with http/WebDAV protocols for data access in high throughput computing

Shadow: Real Applications, Simulated Networks

RT2003, Montreal Niko Neufeld, CERN-EP & Univ. de Lausanne

Experience of Lustre at a Tier-2 site

Performance Enhancements for Tor

3.2 Virtualisation.

GSP 215 RANK Lessons in Excellence-- gsp215rank.com.

Inside Job: Applying Traffic Analysis to Measure Tor from Within

Anupam Das , Nikita Borisov

Shadow: Scalable and Deterministic Network Experimentation

Moodle Scalability What is Scalability?

Support for ”interactive batch”

Anupam Das , Nikita Borisov

Privacy-Preserving Dynamic Learning of Tor Network Traffic

Performance And Scalability In Oracle9i And SQL Server 2000

Relax and Adapt: Computing Top-k Matches to XPath Queries

Presentation transcript:

Shadow: Running Tor in a Box for Accurate and Efficient Experimentation Rob Jansen and Nick Hopper University of Minnesota U.S. Naval Research Laboratory rob.g.jansen@nrl.navy.mil Whats the point about talking about shadow – why people will care

Anonymity with Tor Client Relays Server

Tor in a Box with Shadow Discrete event network simulator Natively executes real applications Simulates time, network, crypto, CPU Model latency and bandwidth Efficient, accurate, controlled Single Linux-box without root Linux

Shadow's Design I Simulation blueprint Discrete time events The effect of these techniques is: precise control over the experiment and repeatability (XML specification), scalability (no real time requirement)

Shadow's Design II Node management Function interposition Shadow Memory Space Effects: memory efficiency (minimize state overhead), run real applications (emulates/simulates linux kernel) Scalability depends on application Context Switch Tor Memory Space

Scallion – A Plug-in Running Tor Integrates Tor into Shadow Scalability 1250 nodes in 10 GB RAM, 5x* - 10x** slowdown 5750 nodes in 60 GB RAM, 40x** slowdown * 3.3 GHz AMD Phenom II X6 1100T ** 2.2 GHz AMD Opteron 6174

Accuracy Shadowing Tor

Demonstrating Shadow's Utility Tang & Goldberg [CCS 10] Shadow Replacement for Round Robin Prioritize bursty web traffic over bulk traffic Shadow agrees with 3 node PlanetLab tests

Web Bulk Lightly Loaded Tor Heavily Loaded Tor Top row: normal load of 50 relays, 950 web, 50 bulk Bottom row: double bulk load of 50 relays, 950 web, and 100 bulk New results were something that they were not able to gather on planetlab They did the best they could with the tools they had, and Tor uses it because it seemed like it is a win – now we can look at things at better scale, and the results not clear

Conclusion Efficient, accurate, controllable, repeatable Tor experiments on one machine Larger scale than previously possible New results from new capabilities Able to run many applications Freely available and usable software Several people already using shadow

Questions? rob.g.jansen@nrl.navy.mil cs.umn.edu/~jansen shadow.cs.umn.edu github.com/shadow