Project Name: CS 244: Replicating “ONCache: A Cache-Based Low-Overhead Container Overlay Network” Team Members: Dr. Phil: Sebastian Ingino (ingino[at]stanford[dot]edu), Andrew (Drew) Woen (amwoen[at]stanford[dot]edu), Vidur Gupta (vidur[at]stanford[dot]edu), Max Cura (mcura[at]stanford[dot]edu) Original […]
Project Name: Replicating “Structured Streams: a New Transport Abstraction” Team Members: Atindra Jha (atj10@stanford.edu); Onkar Deshpande (onkard@stanford.edu) Source: https://dl.acm.org/doi/10.1145/1282427.1282421 Key result: Delivering web pages over Structured Stream Transport (SST) protocol works […]
Project Name: Replicating “SUSS: Improving TCP Performance by Speeding Up Slow Start” Team Members: Francis Chua (fqchua[at]stanford[dot]edu), Adam Lambert (sfadam[at]stanford[dot]edu), June Lee (junelee1[at]stanford[dot]edu) Source Paper: Arghavani, Mahdi, et al. “SUSS: […]
Team: Rogue Packet Key Result(s): one-sentence, easily accessible description of each result. Source(s): Dave Levin, Katrina LaCurts, Neil Spring, and Bobby Bhattacharjee. 2008. Bittorrent is an auction: analyzing and improving bittorrent’s […]
Team Members: Steven Yuanshuo Feng (syfeng@stanford.edu), Jonathan Tseng (jtseng20@stanford.edu), Laura Louise Bocek (lauralb@stanford.edu), Mothana Alsoofi (mothana@stanford.edu) Source Paper: “Timely Classification and Verification of Network Traffic Using Gaussian Mixture Models” by […]
Project Name: Replicating “The Best of Both Worlds: High Availability CDN Routing Without Compromising Control” Team Members: Hannah Dunn (hdunn5@stanford.edu), Keely Podosin (kpodosin@stanford.edu), Lara Francuillli (lftsouza@stanford.edu), L’Hussen Touré (ltoure24@stanford.edu) Key […]
Team Members: Majd Nasra, Kenny Oseleononmen Original Authors: Sarah Tollman, Seo Jin Park, and John Ousterhout Abstract This report replicates the findings of the paper “EPaxos Revisited” by Sarah Tollman, […]
Team members: Ben Friedman, Patricia Wei, Ron Dubinsky Source: GitHub repository here Introduction Published by Luigi Rizzo in ACM SIGCOMM in 1997, Dummynet contributes a simple way to simulate and […]
Discussion The general trends of our results support the paper’s claim that randomized election timeouts are better for availability in comparison to a constant election timeout for every node. More […]
Group Members: Daneshvar Amrollahi, Evan Chen, Noel Sarduy Introduction The paper “Formal Methods for Network Performance Analysis” by Mina Tahmasbi Arashloo, Ryan Beckett, and Rachit Agarwal, presented at the 20th […]