Reproducing Network Research

network systems experiments made accessible, runnable, and reproducible

Main Menu

Skip to content
  • Projects
  • About
  • Contribute

Visual Logging and Interpretation of Buffer Sizing Experiments

June 8, 2022by sjobalia Leave a comment

Purvi Goel and Sarah Jobalia Twenty years ago, Appenzeller et al. challenged the “rule of thumb” for buffer sizing, B = RTT x C. The old rule of thumb had […]

Read Article →

CS 244 ’21: Reproducing “Restructuring endpoint congestion control”

December 6, 2021by serhatarslanpress Leave a comment

This report documents our attempt to reproduce the results of the “Restructuring endpoint congestion control” paper. While we were able to successfully reproduce the findings from the paper, we encountered […]

Read Article →

CS 244 ’20: Reproducing “Taking a Long Look at QUIC”

June 23, 2020by bspang Leave a comment

Read Article →

CS 244 ’20: Methodically Modeling Tor

June 23, 2020by bspang Leave a comment

This report documents the reproduction of Methodically Modeling the Tor Network for CS 244. While the techniques for generating Tor network models have evolved since 2012, the model presented in […]

Read Article →

CS 244 ’20: Reproducing Scafida: A Scale-free Network Inspired Datacenter Topology

June 23, 2020by bspang Leave a comment

In this paper, we reproduce the main findings of Scafida: A Scale-Free Network Inspired Data Center Architecture. The paper proposes and evaluates Scafida, a datacenter topology that breaks the symmetry […]

Read Article →

CS 244 ’20: Reproducing “Large Scale Simulation of Tor” in Shadow

June 23, 2020by bspang Leave a comment

Privacy over the internet is a critical issue worldwide, as more and more of the world executes business and personal transactions over the internet. Tor is a network layer that […]

Read Article →

CS 244 ’20: Reproducing Sparrow

June 23, 2020by bspang Leave a comment

Bandwidth availability, device count increases and new applications such as machine learning have resulted in a steady growth of cloud computing needs, that data centers are required to answer. Among […]

Read Article →

CS 244 ’20: Quantifying the Variation in Congestion Control Performance on Pantheon Paths and Emulators

June 23, 2020by bspang Leave a comment

We examine the ways in which congestion control schemes vary across different real network scenarios, and quantify the complexity of variations. Using measurement data from the Pantheon of Congestion Control, […]

Read Article →

CS 244 ’20: Reproducing and Performance Testing Kademlia

June 23, 2020by bspang Leave a comment

Reproducing and Performance Testing Kademlia Distributed hash tables (DHTs) have become a widely used construct of many distributed systems, offering optimal addition/removal of nodes with minimal work and the ability […]

Read Article →

CS 244 ’20: Reproducing Fat-Tree

June 23, 2020by bspang Leave a comment

Read Article →

Post navigation

1 2 … 19 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 174 other subscribers

Blog Stats

  • 402,859 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

  • Visual Logging and Interpretation of Buffer Sizing Experiments
  • CS 244 ’21: Reproducing “Restructuring endpoint congestion control”
  • CS 244 ’20: Reproducing “Taking a Long Look at QUIC”
  • CS 244 ’20: Methodically Modeling Tor
  • CS 244 ’20: Reproducing Scafida: A Scale-free Network Inspired Datacenter Topology
  • CS 244 ’20: Reproducing “Large Scale Simulation of Tor” in Shadow
  • CS 244 ’20: Reproducing Sparrow
  • CS 244 ’20: Quantifying the Variation in Congestion Control Performance on Pantheon Paths and Emulators
  • CS 244 ’20: Reproducing and Performance Testing Kademlia
  • CS 244 ’20: Reproducing Fat-Tree
  • CS 244 ’20: Reproducing “Multi-Resource Fair queuing for Packet Processing”
  • CS 244 ’20: An Internet Wide View of Internet Wide Scanning Reproduction
  • CS 244 ’20: Retransmission Timeout in TCP
  • CS 244 ’20: A reproduction of “Avoiding traceroute anomalies with Paris traceroute”
  • CS 244 ’20: A Reproduction of “A Longitudinal End-to-End View of the DNSSEC Ecosystem”
  • CS 244 ’20: A Reproduction of “Jumpstarting BGP Security with Path-End Validation”
  • CS 244 ’20: Reproducing “Fibbing: Central Control Over Distributed Routing”
  • CS 244 ’20: Shenango Reproduction
  • CS 244 ’20: Reproducing “Residential Links Under the Weather”
  • CS 244 ’20: Weakly Supervised Network Traffic Classification
  • 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
  • DCTCP and Queues
  • Fairness of Jellyfish vs. Fat-Tree
  • Life’s not fair, neither is TCP (…under the following conditions)
  • Solving Bufferbloat – The CoDel Way
  • MPTCP Wireless Performance
  • Why Flow-Completion Time is the Right Metric for Congestion Control
  • Seeing RED
  • Choosing the Default Initial Congestion Window
  • Jellyfish vs. Fat Tree
  • DCell: A Scalable and Fault-Tolerant Network Structure for Data Centers
  • TCP Daytona: Congestion Control with a Misbehaving Receiver
  • Multipath TCP over WiFi and 3G links
  • Exploring Outcast
  • Sizing Router Buffers
  • Template for Final Project Blog Posts

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
  • Follow Following
    • Reproducing Network Research
    • Join 174 other followers
    • Already have a WordPress.com account? Log in now.
    • Reproducing Network Research
    • Customize
    • Follow Following
    • Sign up
    • Log in
    • Report this content
    • View site in Reader
    • Manage subscriptions
    • Collapse this bar
 

Loading Comments...