Please note: This PhD defence will take place in DC 1304.
Amir Hossein Seyhani Parashkoh PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Mina Tahmasbi Arashloo
Networking researchers and engineers spend much of their time trying to understand the performance of contention points, network components where multiple incoming packet streams share the same outgoing link(s). Recently, researchers have developed new logical models for analyzing such contention points, but unfortunately, such models are expensive: they do not scale well as buffer capacities increase beyond 10s of packets, making it difficult or impossible to reason about real-world systems faithfully. This paper proposes a suite of efficient, new abstractions for reasoning about buffers and their performance characteristics. I will present the new model and how it can be used to reason about the performance of contention points. I will also demonstrate the modularity of this framework, which can take advantage of a range of abstractions that trade performance off against precision. Finally, I will present the evaluation results against a collection of benchmarks and demonstrate the scaling benefits of the new model.