Why Flow-Completion Time is the Right Metric for Congestion Control (Rate Control Protocol) Philip Zhuang – pzhuang@stanford.edu Victor Kaiser-Pendergrast – v.kaiser.pendergrast@gmail.com Introduction Network research in packet switched networks as almost […]
Introduction We examine Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks [1], one of the most highly cited papers of the BItTorrent protocol. The major contribution in the paper was […]
Danaë Metaxa-Kakavouli and Grace Muzny Introduction Cellular wireless networks present unique challenges because they exhibit high variance in link speed. Sprout is a transport protocol designed specifically for this situation […]
Introduction In this paper, authors Korczyński, Janowski, and Duda try to develop a sampling scheme to detect SYN Flooding attacks and Portscans. Protection from DDoS attacks is a particularly important part […]
Team: Varun Ramesh (vramesh2@stanford.edu) and Blane Wilson (bctwilson@stanford.edu) Source Code: https://github.com/rameshvarun/misbehaving-receiver Paper: Savage, Stefan, Neal Cardwell, David Wetherall, and Tom Anderson. “TCP congestion control with a misbehaving receiver.” ACM SIGCOMM Computer Communication Review […]
A study of A Control-Theoretic Approach for Dynamic Adaptive Video Streaming over HTTP Helen Hastings and Sloane Sturzenegger {hhas77, sloanes} @stanford.edu The Thrill of Victory and the Agony of Defeat […]
Eli Berg and Gus Liu Introduction QJump was presented by Matthew P. Grosvenor et. al at NSDI 2015 as an algorithm for mitigating the effects of network congestion due to […]
