Reproducing Network Research

network systems experiments made accessible, runnable, and reproducible

Main Menu

Skip to content
  • Projects
  • About
  • Contribute

CS 244 ’19: Re-Evaluating Entropy Levels in RSA Key Generation

September 27, 2019by bspang Leave a comment

Download report Andrew Guan, William Zeng Original paper: Nadia Heninger, Zakir Durumeric, Eric Wustrow, and J Alex Halder- man. 2012. Mining your Ps and Qs: Detection of widespread weak keys […]

Read Article →

CS 244 ’19: Reproducing “Analysis of the HTTPS Certificate Environment”

September 27, 2019by bspang Leave a comment

Download report Emily Marx, Timothy Le Original paper: Zakir Durumeric, James Kasten, Michael Bailey, and J Alex Halderman. 2013. Analysis of the HTTPS certificate ecosystem. In Proceedings of the 2013 […]

Read Article →

CS 244 ’19: Reproducing Results from Dominant Resource Fairness

September 27, 2019by bspang Leave a comment

Download report Keshav Santhanam, Homero Roman Roman Original paper: Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, and Ion Stoica. 2011. Dominant Resource Fairness: Fair Allocation of Multiple […]

Read Article →

CS 244 ’19: Reproducing AWStream’s Pedestrian Detection

September 27, 2019by bspang Leave a comment

Download report Eric Prokop, Peiqian Li Original paper: Ben Zhang, Xin Jin, Sylvia Ratnasamy, John Wawrzynek, and Edward A. Lee. 2018. AWStream: adaptive wide-area streaming analytics. In Proceedings of the 2018 […]

Read Article →

CS 244 ’19: Reproducing Tokyo-Ping

September 27, 2019by bspang Leave a comment

Download report Nicholas Hirning, Michael Straka Original paper: C. Pelsser, L. Cittadini, S. Vissicchio, R. Bush. From Paris to Tokyo: On the Suitability of ping to Measure Latency. IMC, 2013. […]

Read Article →

CS 244 ’19: A Reproduction of Succinct Data Store System

September 27, 2019by bspang Leave a comment

Download report Peter Spradling, Jerry Zhilin Jiang Original paper: R. Agarwal, A. Khandelwal, and I. Stoica. Succinct: Enabling queries on compressed data. In USENIX Symposium on Networked Systems Design and Implementation, […]

Read Article →

CS 244 ’19: Exploring Copysets under Repeated Failures

September 27, 2019by bspang Leave a comment

Download report Jayden Navarro, Isaiah Brandt-Sims Original paper: Asaf Cidon, Stephen M. Rumble, Ryan Stutsman, Sachin Katti, John Ousterhout, and Mendel Rosenblum. 2013. Copysets: reducing the frequency of data loss […]

Read Article →

Post navigation

1 2 … 24 Next →
Can network systems research papers be replicated?

This blog details stories from Stanford CS244 students and researchers anywhere who have been inspired to share their research, largely using the Mininet-HiFi network emulator on EC2 instances.

For more details, check out the Projects gallery, the About page, or Contribute.

Tweet/post/send them to your colleagues, comment at the bottom of each post, or even replicate each blog post using the provided instructions!

Enter your email address to follow this blog and receive notifications of new posts by email.

Join 151 other followers

Blog Stats

  • 345,397 hits

bufferbloat buffering buffer sizing bursty chrome codel collapse congestion congestion control congestion window consensus container-based emulation cs244 Datacenter data center dcell dctcp debugging delay dos ecmp ecn emre orbay fairness fast-open fat tree fault tolerance FIFO flow-completion time flow scheduling gateways hedera http HULL incast init cwnd jellyfish low latency metrics mininet mobile shell mosh mptcp MSM MWM networking nox openflow outcast pacing performance performance isolation pFabric phantom queues PIM port blackout priority queues queueing raft red rtt scalability sdn ssh stanford switching tcp tfo timely topology transport vemulab video streaming wifi wireless

All Posts

  • CS 244 ’19: Re-Evaluating Entropy Levels in RSA Key Generation
  • CS 244 ’19: Reproducing “Analysis of the HTTPS Certificate Environment”
  • CS 244 ’19: Reproducing Results from Dominant Resource Fairness
  • CS 244 ’19: Reproducing AWStream’s Pedestrian Detection
  • CS 244 ’19: Reproducing Tokyo-Ping
  • CS 244 ’19: A Reproduction of Succinct Data Store System
  • CS 244 ’19: Exploring Copysets under Repeated Failures
  • CS 244 ’19: Reproducing Copa
  • CS 244 ’19: Reproducing Fair Switch Scheduling Algorithms
  • CS 244 ’19: Reproducing Fidelity and Scalability of Congestion Control Plane Algorithms
  • CS 244 ’19: Moving Beyond Proxy Signals for Datacenter Congestion Control
  • CS 244 ’18: Recreating and Extending Pensieve
  • CS 244 ’18: High Throughput Data Center Topology Design
  • CS 244 ’18: Reproducing TCP ex Machina: Computer-Generated Congestion Control
  • CS244 ’18: A Succinct Reproduction
  • CS 244 ’18: DNS Resolvers Considered Harmful (in some circumstances)
  • CS244 ’18: Reproducing ABC Congestion Control
  • CS244 ’18: Triangulation Using RTT
  • CS 244 ’18: Cuckoo for Filters
  • CS 244 ’18: Flows Passing in the Night: A Reproduction of “Heavy-Hitter Detection Entirely in the Data Plane”
  • CS244 ’18: Elastic Cloud WAN: Squid
  • CS 244 ’18: Exploring an Identity Binding Attack in SDN
  • CS 244 ’18: Network-Ordered Paxos on a Cloud Platform
  • CS 244 ’18: Evaluating F10, a Fault-Tolerant Data Center Network
  • CS244 ’18: Reproducing Results from: Constant Time Updates in Hierarchical Heavy-Hitters
  • CS 244 ’18: High Throughput Data Center Topology Design by Ankit Singla et al.
  • CS244 ’18: Beyond Fat-Trees and into the “Xpanse”
  • CS244 ’18: Reproducing Compound TCP
  • CS244 ’17: TCP Congestion Control with a Misbehaving Receiver
  • CS244 ’17: BitTyrant: Do incentives build robustness in BitTorrent?
  • CS244 ’17: DCTCP – Data Center TCP
  • CS244 ’17: CONFUSED, TIMID, AND UNSTABLE: PICKING A VIDEO STREAMING RATE IS HARD.
  • CS244 ’17: TCP Congestion Control with a Misbehaving Receiver
  • CS244 ’17: iSLIP the Switch Scheduling Problem
  • CS244 ’17: Compiling Path Queries
  • CS244 ’17: An Argument For Increasing TCP’S Initial Congestion Window
  • CS244 ’17: An Argument for Increasing TCP’s Initial Congestion Window
  • CS244 ‘17: Dcell: A Scalable and Fault-Tolerant Network Structure for Data Centers
  • CS244 ’17 pFabric: Deconstructing Datacenter Packet Transport
  • CS244 ’17: Xpander: Towards Optimal-Performance Datacenters
  • CS244 ’17: An Experimental Study of TLS forward secrecy deployments
  • CS244 ’17: Mahimahi: Accurate Record-and-Replay for HTTP
  • CS244 ’17: PCC, fairness and flow completion time
  • CS244 ’17: Confused, Timid, and Unstable: Picking a Video Streaming Rate is Hard
  • CS244 ’17: Mosh – An Interactive Remote Shell for Mobile Clients
  • CS244 ’17: Low-rate TCP DoS attacks
  • CS244 ‘17: Reproducing TCP Level Attacks: TCP Congestion Control with a Misbehaving Receiver
  • CS244 2017: ReBBR: Reproducing BBR Performance in Lossy Networks
  • CS244 ’17 TCP Fast Open
  • CS244 ’17: Comparison of Sprout and Verus Protocols
  • CS244 ’17: Low-Rate TCP-Targeted Denial of Service Attacks
  • CS244 ’17: Adaptive Congestion Control for Unpredictable Cellular Networks
  • CS 244 ’17: Congestion-Based Congestion Control with BBR
  • CS244 2017: Is HTTPS still slow?
  • CS244 ‘17: Netflix and Chill – Analyzing the Netflix video client’s request behaviour after the video buffer fills
  • CS244 ‘17: Jellyfish: Networking Data Centers Randomly
  • CS244 ’16: Why Flow Completion Time is the Right Metric for Congestion Control (Rate Control Protocol)
  • CS244 ’16: Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks
  • CS244 ’16: Sprout via Mahimahi
  • CS244 ‘16: An Accurate Sampling Scheme for Detecting SYN Flooding Attacks and Portscans
  • CS244 ’16: TCP Congestion Control with a Misbehaving Receiver
  • CS244 ’16: Failed Experiments with FastMPC: Integrating Rate-Based Adaptive Streaming into VLC
  • CS244 ’16: QJUMP – Controlling Network Interference
  • CS244 ’16: Revisiting TCP Pacing on the Modern Linux Kernel
  • CS244 ’16: TIMELY
  • CS244’16 Low-Rate TCP-Targeted Denial of Service Attacks
  • CS244 ’16: Elephants vs. Lightning – A Comparison of Hadoop and Spark on Iterative Machine Learning
  • CS244 ‘16: Abstractions for Network Update
  • CS244 ’16: Towards Wifi Mobility without Fast Handover
  • CS244 ‘16: DCTCP
  • CS244 ‘16: Misbehaving TCP Receivers Can Cause Internet-Wide Congestion Collapse
  • CS244 ’16: Path Diversity in the Jellyfish Network
  • CS244 ’16: Verus vs. Sprout
  • CS244 ’16: QUIC Loss Recovery
  • CS244 ’16: Low-rate TCP-targeted Denial of Service Attacks
  • CS244 ’16: PCC Shallow Queues and Fairness
  • CS244 ’16: TCP Fast Open
  • CS244 ’16: Self-clocked Rate adaption for Conversational Video in LTE
  • (no title)
  • CS244 ’15: CONFUSED, TIMID, AND UNSTABLE: PICKING A VIDEO STREAMING RATE IS HARD.
  • CS244 ’15: Is Flow Completion Time a Better Measure for Congestion Control?
  • CS244 ’15: Increasing TCP’s Initial Congestion Window
  • CS244′ 15: Proportional Rate Reduction of TCP
  • CS244 ’15: Raft, Understandable Distributed Consensus
  • CS244 ’15: CoDel – Controlling Delay in Queues
  • CS 244 ‘15: Reproducing the 3G/WiFi application level latency results in MPTCP
  • CS244’15: Denial Of Service using TCP’s RTO.
  • CS244 ’15: Mosh | Reproducing Network Research Results
  • CS244 ’15 TCP Fast Open
  • CS244’15- TCP Fast Open
  • CS244 ‘15: Hedera Flow Scheduling
  • CS244 ’15: Misbehaving TCP Receivers Can Cause Internet-Wide Congestion Collapse
  • CS244 ’15: The Intuition Behind Why a Randomly Networked Data Center Works
  • CS244 ’15: Recursively Cautious Congestion Control
  • CS244 ’15: TCP Congestion Control with a Misbehaving Receiver
  • CS 244 ’15: QJump—delay guarantees in datacenter networks
  • CS 244 ’15: ASAP, A low-latency transport layer
  • CS244 ’15: How Speedy is SPDY?
  • CS244 ’15: PFABRIC: DECONSTRUCTING DATA CENTER TRANSPORT
  • CS 244 ’15 : An Argument for Increasing TCP’s Initial Congestion Window
  • CS244 ’15: Evaluating PCC: Re-architecting Congestion Control for High Performance
  • CS244 ’14: TCP Congestion Control with a Misbehaving Receiver
  • CS244 ‘14: Sprout
  • CS244 ’14: TCP Congestion Control with a Misbehaving Receiver
  • CS244 ’14: Jellyfish
  • CS244 ’14: Jellyfish – Networking Data Centers Randomly
  • CS244 ’14: TCP Fast Open
  • CS 244 ‘14: Mosh: An Interactive Remote Shell for Mobile Clients
  • CS 244 ’14: Bro Network Intrusion Detection System Performance Analysis
  • CS244 ’14: Examining the Impact of Receive Buffer Size on MPTCP
  • CS244 ’14: Why Flow-Completion Time is the Right metric for Congestion Control
  • CS244 ’14: Confused, Timid, and Unstable: Picking a Video Streaming Rate is Hard
  • CS244 ’14: MPTCP Application Latency over WiFi and 3G
  • CS244 ‘14: TCP Fast Open
  • CS244 ’14: DCell: Why Not to Use Mininet + PacketIn Handler of Custom POX Controller
  • CS244 ’14: Investigating Opt-Ack Attacks
  • CS 244 ’14: An Argument for Increasing TCP’s Initial Congestion Window
  • CS244 ’13: Mosh
  • CS244 ’13: Jellyfish Path Diversity and Throughput Comparison
  • CS244 ’13: Jellyfish, Networking Data Centers Randomly
  • CS244’13: Proportional Rate Reduction for TCP
  • CS 244 ’13: Increasing the TCP Initial Congestion Window
  • CS244 ’13: TCP Fast Open
  • CS244 ’13: Rising from the depths – Observing and implementing improvements in online video bitrate selection
  • CS244 ’13: Evaluation of Mosh “mobile shell” performance results
  • CS244 ’13: High Speed Switch Scheduling
  • CS244 ’13: pFabric: Deconstructing data center transport
  • CS244 ’13: Scaling Consistent Updates
  • CS244 ’13: pFabric: Datacenter Packet Switching
  • CS244 ’13: TCP Pacing and Buffer Sizing
  • CS244 ’13: Increasing TCP’s Initial Congestion Window
  • CS244 ’13: Video Rate Selection For Streaming Services
  • CS244 ’13: DCell: A Scalable and Fault-Tolerant Network Structure for Data Centers
  • CS244 ’13: Low Rate TCP-Targeted DoS Attack
  • CS244 ’13: DCTCP Queue Sizing
  • CS244 ’13 DCTCP
  • CS244 ’13: Improving Datacenter Performance and Robustness with Multipath TCP
  • CS244 ‘13: Hedera
  • CS244 ‘13: Video Streaming’s Downward Spiral: Reproducing Research on the Selection of Video Rates
  • CS244 ’13: TCP Fast Open
  • CS244 ’13: Alfalfa: A Videoconferencing Protocol for Cellular Wireless Networks
  • Mini-Stanford Backbone
  • Hedera
  • DCTCP
  • Performance Isolation in vEmulab and Mininet vs. Mininet-HiFi
  • TCP Incast Collapse
  • HULL: High Bandwidth, Ultra Low Latency
  • Increasing TCP’s Initial Congestion Window
  • Hedera
  • DCell : A Scalable and Fault-Tolerant Network Structure for Data Centers

Meta

  • Register
  • Log in
  • Entries feed
  • Comments feed
  • WordPress.com
Blog at WordPress.com.
Reproducing Network Research
Blog at WordPress.com.
Privacy & Cookies: This site uses cookies. By continuing to use this website, you agree to their use.
To find out more, including how to control cookies, see here: Cookie Policy
Cancel