JSwitchSim – Java Switch Simulator Paul Tarjan Nick Mckeown Stanford High-Performance Networking Group.

Slides:



Advertisements
Similar presentations
How SAS implements structured programming constructs
Advertisements

Configuring a Load-Balanced Switch in Hardware Srikanth Arekapudi, Shang-Tse (Da) Chuang, Isaac Keslassy, Nick McKeown Stanford University.
Slick: A control plane for middleboxes Bilal Anwer, Theophilus Benson, Dave Levin, Nick Feamster, Jennifer Rexford Supported by DARPA through the U.S.
1.  Congestion Control Congestion Control  Factors that Cause Congestion Factors that Cause Congestion  Congestion Control vs Flow Control Congestion.
Lecture 12. Emulating the Output Queue So far we have shown that it is possible to obtain the same throughput with input queueing as with output queueing.
An Overview of Software-Defined Network Presenter: Xitao Wen.
SKELETON BASED PERFORMANCE PREDICTION ON SHARED NETWORKS Sukhdeep Sodhi Microsoft Corp Jaspal Subhlok University of Houston.
High-Performance Networking Group Isaac Keslassy, Nick McKeown
Submitters: Erez Rokah Erez Goldshide Supervisor: Yossi Kanizo.
PRESENTED BY: ILYA NELKENBAUM KEREN ARMON SUPERVISOR: MR. YOSSI KANIZO 09/03/2011 Cuckoo the Kicking Bird 1.
Submitters: Erez Rokah Erez Goldshide Supervisor: Yossi Kanizo Networked Software Systems Laboratory Department of Electrical Engineering Technion - Israel.
Nick McKeown CS244 Lecture 6 Packet Switches. What you said The very premise of the paper was a bit of an eye- opener for me, for previously I had never.
Color Aware Switch algorithm implementation The Computer Communication Lab (236340) Spring 2008.
Routers with a Single Stage of Buffering Sundar Iyer, Rui Zhang, Nick McKeown High Performance Networking Group, Stanford University,
Combined Input Output Queuing Switch Simulator The Laboratory of Computer Communication and Networking.
1 Input Queued Switches: Cell Switching vs. Packet Switching Abtin Keshavarzian Joint work with Yashar Ganjali, Devavrat Shah Stanford University.
Analysis of a Packet Switch with Memories Running Slower than the Line Rate Sundar Iyer, Amr Awadallah, Nick McKeown Departments.
Integrated Scientific Workflow Management for the Emulab Network Testbed Eric Eide, Leigh Stoller, Tim Stack, Juliana Freire, and Jay Lepreau and Jay Lepreau.
The Crosspoint Queued Switch Yossi Kanizo (Technion, Israel) Joint work with Isaac Keslassy (Technion, Israel) and David Hay (Politecnico di Torino, Italy)
Operating Systems Simulator Jessica Craddock Kelvin Whyms CPSC 410.
EE 122: Router Design Kevin Lai September 25, 2002.
Project Progress Presentation GENERATION OF NS2 TRACE FILES FOR SATELLITE-WIRELESS NETWORKS CS603 - Wireless Communications & Networks Summer II 2003 Wasim.
Matnet – Matlab Network Simulator for TinyOS Alec WooTerence Tong July 31 st, 2002.
1 EE384Y: Packet Switch Architectures Part II Load-balanced Switches Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University.
1 Achieving 100% throughput Where we are in the course… 1. Switch model 2. Uniform traffic  Technique: Uniform schedule (easy) 3. Non-uniform traffic,
Course Project for CS Objective Simulate the FatTree network using ndnSIM. Simulate a multicast session with l oadbalancing Add more producers to.
Color Aware Switch algorithm implementation The Computer Communication Lab (236340) Spring 2008.
An Overview of Software-Defined Network Presenter: Xitao Wen.
Pipelined Two Step Iterative Matching Algorithms for CIOQ Crossbar Switches Deng Pan and Yuanyuan Yang State University of New York, Stony Brook.
EstiNet Network Simulator & Emulator 2014/06/ 尉遲仲涵.
Formal checkings in networks James Hongyi Zeng with Peyman Kazemian, George Varghese, Nick McKeown.
OMNET++. Outline Introduction Overview The NED Language Simple Modules.
Lesson 5 – Looking at the Output MATSim Tutorial, 2011, Shanghai 1.
1 Enabling Large Scale Network Simulation with 100 Million Nodes using Grid Infrastructure Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
Introduction to NS2 -Network Simulator- -Prepared by Changyong Jung.
Summary of switching theory Balaji Prabhakar Stanford University.
1 Data Structures CSCI 132, Spring 2014 Lecture 3 Programming Principles and Life Read Ch. 1.
High-Level Interconnect Architectures for FPGAs Nick Barrow-Williams.
Cross Language Clone Analysis Team 2 April 7, 2011.
Network Simulator-2 Sandeep singla 1998A2A7540. NS-2 A discrete event simulator Focused on modeling network protocols –Wired, wireless –TCP,UDP,unicast,multicast.
Verified Network Configuration. Verinec Goals Device independent network configuration Automated testing of configuration Automated distribution of configuration.
Visualizing Peer-to-Peer Networks Final Presentation By Team SPEW.
The Router SC 504 Project Gardar Hauksson Allen Liu.
Routers. These high-end, carrier-grade 7600 models process up to 30 million packets per second (pps).
Packet Forwarding. A router has several input/output lines. From an input line, it receives a packet. It will check the header of the packet to determine.
Jaroslav Šnajberk, Tomáš Potužák, Richard Lipka Department of Computer Science and Engineering Faculty of Applied Sciences University of West Bohemia,
Ptolemy Tutorial What is Ptolemy? How it works? What is the development environment for you Show demo and former simulation work.
CS324e - Elements of Graphics and Visualization Java GUIs - Event Handling.
Definition The framework is a library that controls the flow of events and data through well-defined interface points defined by user-written algorithm.
Computer Simulation of Networks ECE/CSC 777: Telecommunications Network Design Fall, 2013, Rudra Dutta.
M. Ellis - MICE Video Conference - 30th August Software Report Recent progress:Recent progress: –Start of code to read DATE format (two parts) One.
Buffered Crossbars With Performance Guarantees Shang-Tse (Da) Chuang Cisco Systems EE384Y Thursday, April 27, 2006.
Lesson 1 1 LESSON 1 l Background information l Introduction to Java Introduction and a Taste of Java.
Topics in Internet Research: Project Scope Mehreen Alam
ICS - Intelligent Collaboration system Simulator DSL lab, computer science faculty Technion – Israel institute of technology Supervisor: Uri Shani Michal.
CINT & Reflex – The Future CINT’s Future Layout Reflex API Work In Progress: Use Reflex to store dictionary data Smaller memory footprint First step to.
ALPHABET RECOGNITION USING SPHINX-4 BY TUSHAR PATEL.
Progress on Pixel Region Optimization and SystemVerilog Simulation Phase 2 Pixel Electronics Meeting – Progress on Pixel Region Optimization and SystemVerilog.
Krebs Cycle Analyzer Christopher Clement Ryan Miller BMES 546.
Network layer (addendum) Slides adapted from material by Nick McKeown and Kevin Lai.
scheduling for local-area networks”
Packet Forwarding.
Simulator of an Asynchronous Distributed System
When I want to execute the subroutine I just give the command Write()
IOA Code Generator (Making IOA Run)
Design Review.
Memory Management Algorithms Huan Liu, Damon Mosk-Aoyama
Write about the funding Sundar Iyer, Amr Awadallah, Nick McKeown
Presentation transcript:

JSwitchSim – Java Switch Simulator Paul Tarjan Nick Mckeown Stanford High-Performance Networking Group

What is JSwitchSim? ● Network switch simulator ● Not a topology simulator (like ns2) (Although it could be with plugins) ● Allows experimentation with other algorithms and data structures ● Replacement and upgrade for Sim (written in C, by Nick)

What is JSwitchSim? (2) ● Object-oriented modular design ● Easily pluggable ● Either event based (Calendar Queue) or sequential time progression ● Has a GUI or configuration file based (GUI can save to config files)

Program Structure ● Very similar structure to SIM

Program Structure (2) ● Traffic : Generates Traffic ● Splitter : Creates fixed sized cells from packets ● Input Action : Moves cells to the Input Queues ● Input Queues : An n x m matrix of FIFO queues (where n is # of inputs and m is # of outputs) ● Algorithm : Decides how to configure fabric ● Fabric : Moves the data from Input Queues to Output Queues using the Algorithm's output ● Output Queue : m FIFO queues (m is # of outputs) ● Output Action : Takes cells from the Output Queues and disposes of them ● Stats : Records statistics

Code Structure ● Everything implements Event ● Helper Classes DefaultEvent, RepeatableSimEvent ● All plugin classes extend RepeatableSimEvent ● To create plugins extend the corresponding abstract class and implement the abstract method (saving in the corresponding folder) ● For example: Algorithms extend algorithm.Algorithm and implement getMatrix() saved in the folder “algorithm”

Code Structure (2) ● Each run of the program instantiates all new plugins (don't worry about state) ● Main method : common.Main ● Parser : common.Parser ● Gui : common.Gui ● Iterating loop (or queue executer) : common.GlobalData ● All Global Data : common.GlobalData.globaldata

Benchmark – Sequential Events Bernoulli IID 0.5 prob Traffic

Benchmark – Unordered Events Bernoulli IID 0.5 prob Traffic

Benchmark – Ordered Queued Events Bernoulli IID 0.5 prob Traffic

Benchmark – Java vs C

Benchmark – SIM vs JSIM (bare)

Demo ● Just run “java common.Main” or use the jar ● Uses java 1.5

Future Work ● Need tons of plugins to be built ● This is where you can come in!