Scott J Shenker

Digital Library

ACM Paris Kanellakis Theory and Practice Award

USA - 2017

citation

For pioneering contributions to fair queueing in packet-switching networks, which had a major impact on modern practice in computer communication.

In a landmark paper in SIGCOMM 1989 (with Demers and Keshav), Shenker developed the first practical fair queueing (FQ) algorithm, a paradigm that combines three desirable principles: allocating bandwidth and buffer space fairly across senders, controlling latency independently of buffers, and providing a service model that is insensitive to the timing of packet arrivals. Over the next two decades, Shenker advanced the FQ concept to the resource-optimized Core- Stateless variant (CSFQ) and Approximate Fair Dropping (AFD) all the way to the Dominant Resource Fairness (DRF) method for general cloud computing.

Before Shenker's seminal work, the dominant queuing strategy in Internet routers was first-in first-out (FIFO), which led to queues to back up and leading to unfair shares of bandwidth. The FQ paper in 1989 marked a turning point for theoretical approaches, and had a dramatic impact on practice. For example, the DRF method for scheduling in cloud computing has been implemented in the Apache Mesos software, which is deployed at numerous companies. Today, virtually all network routers use variants of FQ developed by Shenker (such as AFD) or in follow-up work (such as DRF, WFQ and Hierarchical FQ) inspired by Shenker's foundational contributions.

Press Release

ACM Fellows

USA - 2003

citation

For contributions to Internet architecture and protocols.

2017 ACM Paris Kanellakis Theory and Practice Award

Scott Shenker was honored for pioneering contributions to fair queueing in packet-switching networks, which had a major impact on modern practice in computer communication. Shenker’s work was fundamental to helping the internet grow from a tool used by a small community of researchers, to a staple of daily life that is used by billions of people. Since the internet was introduced, demand has grown for the ability of computer networks to transmit voice and data simultaneously. Traditionally, this was a challenge, as early networks were not designed to offer integrated services. Shenker was the first to develop the first practical fair queueing algorithm for packet-switching networks, which provided equitable access to transmission bandwidth for different grades of service quality. Many of the commercial routers that make up the internet today use Shenker’s algorithms.

Shenker also developed a mathematical tool for rigorous network research, and introduced ideas for implementing “guaranteed” real-time services such as voice, video streaming and multicasts. Recently, Shenker has been involved in positing how to redesign the internet from the ground up. Software-defined networking (SDN) and software-defined internet architecture (SDIA) are key ideas he developed as part of these inquiries. Researchers consider SDN and SDIA invaluable concepts for mapping out how to most effectively maintain and expand the internet in the coming years.

The ACM Paris Kanellakis Theory and Practice Award honors specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing. This award is accompanied by a prize of $10,000 and is endowed by contributions from the Kanellakis family, with additional financial support provided by ACM's Special Interest Groups on Algorithms and Computation Theory (SIGACT), Design Automation (SIGDA), Management of Data (SIGMOD), and Programming Languages (SIGPLAN), the ACM SIG Projects Fund, and individual contributions.