Resume

• 2015

  Facebook

  Sprint Advanced Technology Lab

  University of Toronto

  Sprint Advanced Technology Lab

  Professor

  Department of Computer Science

  University of Toronto

  Research Assistant

  Stanford University

  Assistant Professor

  Department of Computer Science

  University of Toronto

  Associate Chair

  Research

  Department of Computer Science

  University of Toronto

  Facebook

  Associate Professor

  Department of Computer Science

  University of Toronto

  Facebook Distinguished Faculty Award

  Facebook distinguished faculty award for research on packet switching architectures/algorithms and software defined networks.

• 2001

  PhD

  Electrical Engineering

• 1999

  MSc

  Computer Science

• 1995

  BSc

  Computer Engineering

• Programming

  Simulations

  Distributed Systems

  Software Engineering

  Algorithms

  Software Design

  Mathematical Modeling

  High Performance Computing

  Computer Architecture

  Software-Defined Networking

  Networking

  Parallel Computing

  Optimization

  Software Development

  Computer Science

  Scalability

  OpenFlow

  Beehive: Towards a Simple Abstraction for Scalable Software-Defined Networking

  Beehive: Towards a Simple Abstraction for Scalable Software-Defined Networking

  Recently

  several papers have studied the possibility of shrinking buffer sizes in Internet core routers to just a few dozen packets under certain constraints. If proven right

  these results can open doors to building all-optical routers

  since a major bottleneck in building such routers is the lack of large optical memories. However

  reducing buffer sizes might pose new security risks: it is much easier to fill up tiny buffers

  and thus organizing Denial of Service (DoS) attacks seems easier in a network with tiny buffers. To the best of our knowledge

  such risks have not been studied before; all the focus has been on performance issues such as throughput

  drop rate

  and flow completion times. In this paper

  we study DoS attacks in the context of networks with tiny buffers. We show that even though it is easier to fill up tiny buffers

  synchronizing flows is more difficult. Therefore to reduce the network throughput

  the attacker needs to utilize attacks with high packet injection rates. Since such attacks are easily detected

  we conclude that DoS attacks are in fact more difficult in networks with tiny buffers.

  Denial of Service Attacks in Networks with Tiny Buffers

  Reaching a desired set of users via different paths: an online advertising technique on a micro-blogging platform

  Yashar

  Ganjali

  Department of Computer Science

  University of Toronto

  Stanford University