CS244 ’17: TCP Congestion Control with a Misbehaving Receiver
Alex Sosa and Hemanth Kini Introduction The paper we chose was TCP Congestion Control with a Misbehaving Receiver by Savage et. al. A basic summary of this paper is that […]
CS244 ’17: BitTyrant: Do incentives build robustness in BitTorrent?
by Andy Bartolo (bartolo where stanford dot edu) and Dinislam Tebuev (tebuevd where stanford dot edu) Introduction In the early 2000s, Bram Cohen’s BitTorrent protocol took the world by […]
CS244 ’17: DCTCP – Data Center TCP
By Stephen Ibanez (sibanez@stanford.edu) and Kostis Kaffes (kkaffes@stanford.edu) Introduction The best performing congestion control algorithms today allow flows to maximize their throughput while maintaining small queues in network switches. Having […]
CS244 ’17: CONFUSED, TIMID, AND UNSTABLE: PICKING A VIDEO STREAMING RATE IS HARD.
Team Vayu Kishore, Pan Hu Goals The original paper [1] performs a measurement study on the the bit-rate selection of the clients of major video streaming services to gain insight […]
CS244 ’17: TCP Congestion Control with a Misbehaving Receiver
By Matthew Denton and Pavan Mehrotra Goals Savage et. al. “TCP Congestion Control with a Misbehaving Receiver” describes three vulnerabilities in TCP that can be exploited to force faster segment […]
CS244 ’17: iSLIP the Switch Scheduling Problem
Authors: Kate Stowell <kstowell@stanford.edu> Travis Lanham <tlanham@cs.stanford.edu> Paper: McKeown, Nick. “The iSLIP scheduling algorithm for input-queued switches.” IEEE/ACM transactions on networking 7.2 (1999): 188-201. Introduction Packet switches are the […]
CS244 ’17: Compiling Path Queries
Dominique Piens and Omar Rizwan Goals In “Compiling Path Queries,” Narayana et al. introduce a new declarative query language for interactive whole-network debugging. They compare it to what SQL does […]
