Colloquium Details
Jellyfish: Networking Data Centers, Randomly
| Author: | Ankit Singla University of Illinois at Urbana-Champaign |
|---|---|
| Date: | February 19, 2015 |
| Time: | 15:30 |
| Location: | 220 Deschutes |
Abstract
Large Internet services, “big science”, and increasingly, industrial R&D, are all powered by warehouse scale computing — tens of thousands of servers connected over a network. Increasing parallelism and big data analytics necessitate that the network provide high throughput connectivity. In this talk, I will describe our design for such a network, based on using random graphs.
Not only do our networks beat state-of-the-art real-world networks by achieving higher throughput, they are, in fact, near-optimal, i.e., one cannot build, using the same networking equipment, *any* network that provides much higher throughput. Further, our networks allow construction at arbitrary sizes, easier network growth over time, and integration of newer and more powerful network equipment as it becomes available — practical problems that rigidly structured traditional networks fail to address.
Biography
Ankit Singla is a PhD Candidate in Computer Science at the University of Illinois at Urbana-Champaign. He received his Bachelors in Technology (Computer Science) at IIT Bombay, India, in 2008. He is a winner of the 2012 Google PhD Fellowship. These days, he is refining a plan for building a speed-of-light Internet, which he loses no opportunity to talk about.