![Graph connectivity / Emerging technologies / Network architecture / Computing / SIGCOMM / Stress testing / Software-defined networking / Algorithm / Reachability / OpenFlow / Mathematics / Academia Graph connectivity / Emerging technologies / Network architecture / Computing / SIGCOMM / Stress testing / Software-defined networking / Algorithm / Reachability / OpenFlow / Mathematics / Academia](https://www.pdfsearch.io/img/4672d323a893c05f57716b231b0f739a.jpg) Date: 2015-12-04 11:47:25Graph connectivity Emerging technologies Network architecture Computing SIGCOMM Stress testing Software-defined networking Algorithm Reachability OpenFlow Mathematics Academia | | Destroying networks for fun (and profit) Nick Shelly∗§, Brendan Tschaen†, Klaus-Tycho Förster∗, Michael Chang‡, Theophilus Benson†, Laurent Vanbever∗ ∗ ETH Zürich, ‡Princeton University, †Duke UniveAdd to Reading ListSource URL: users.cs.duke.eduDownload Document from Source Website File Size: 419,24 KBShare Document on Facebook
|