ACM SIGCOMM Test of Time Paper Award

The ACM SIGCOMM Test of Time Award recognizes papers published 10 to 12 years in the past in Computer Communication Review or any SIGCOMM sponsored or co-sponsored conference that is deemed to be an outstanding paper whose contents are still a vibrant and useful contribution today. The award is given annually and consists of a custom glass award. The paper is chosen by an award committee appointed by the SIGCOMM Award Committee Chair.
The past recipients of the ACM SIGCOMM Test of Time Paper Award are:

2024:

• "P4: programming protocol-independent packet processors" by Pat Bosshart, Dan Daly, Glen Gibb, Martin Izzard, Nick McKeown, Jennifer Rexford, Cole Schlesinger, Dan Talayco, Amin Vahdat, George Varghese, David Walker, in ACM SIGCOMM Computer Communication Review, 44(3), 2014. 

By creating a high-level protocol- and platform- independent programming language for packet processors, P4 changed how we think about customizing and reconfiguring the behavior of packet switches.

The 2024 Test of Time Award Committee members were: Fahad Dogar (Tufts), Dongman Lee (Kaist), Jorg Ott (TU Munich) and chair Craig Partridge (Colorado State University).

2023:

• "B4: Experience with a Globally-Deployed Software Defined Wan" by Sushant Jain, Alok Kumar, Subhasree Mandal, Joon Ong, Leon Poutievski, Arjun Singh, Subbaiah Venkata, Jim Wanderer, Junlan Zhou, Min Zhu, Jon Zolla, Urs Hölzle, Stephen Stuart, Amin Vahdat, in ACM SIGCOMM 2013. 

2022:

• "Network Traffic Characteristics of Data Centers in the Wild" by Theophilus Benson, Aditya Akella, and David A. Maltz, in ACM SIGCOMM 2010. 

For its insightful characterization of the traffic patterns and network topologies in modern data centers, and the curation of public datasets that enabled academic research on data-center networks.

• "Understanding the Impact of Video Quality on User Engagement" by Florin Dobrian, Vyas Sekar, Asad Awan, Ion Stoica, Dilip Joseph, Aditya Ganjam, Jibin Zhan, and Hui Zhang, in ACM SIGCOMM 2011. 

For pioneering large-scale measurements and in-depth study of how video quality affects user engagement, which shed light on metrics to infer video quality of experience and has had a long-lasting impact on the optimization of adaptive streaming.

The 2022 award papers were selected by a committee comprising Fadel Adib from MIT, Venkat Padmanabhan (Chair) from Microsoft Research India, Jennifer Rexford from Princeton, and Renata Teixeira from Netflix.

2021:

• "Internet Inter-Domain Traffic" by Craig Labovitz, Scott Iekel-Johnson, Danny McPherson, Jon Oberheide, and Farnam Jahanian, in ACM SIGCOMM 2010.

For pioneering and systematic study of the consolidation of Internet traffic and changes in the peering structure caused by Hypergiants, that had a long-lasting impact on Internet modeling, Internet measurement, and Internet architecture.

• "Data-Center TCP (DCTCP)", by Mohammad Alizadeh, Albert Greenberg, David Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari Sridharan, in ACM SIGCOMM 2010.

For novel, data-driven design and implementation of a variant of the Transmission Control Protocol tailored to the data-center environment, that has a long-lasting impact on data-center operation and design of network protocols.
The 2021 award paper was selected by a committee composed of: Nick Feamster (U Chicago), Athina Markopoulou (UC Irvine), Jennifer Rexford (Princeton), and Georgios Smaragdakis (TU Delft, chair).

2020:

• "A network in a laptop: rapid prototyping for software-defined networks" by Bob Lantz, Brandon Heller, and Nick McKeown, in ACM HotNets 2010

Using illustrative cases studies, the paper demonstrates how a Mininet-based design can be wrapped in a VM to create a “network appliance” that can be distributed over the Internet so that anyone with a laptop can download and run a ``living, breathing” example of a new networked system. The paper has had a profound impact on catalyzing collaborative network research by setting new standards for reproducible networking research in the form of “runnable papers.”
The 2020 award paper was selected by a committee composed of: Paul Barford (University of Wisconsin-Madison), Hamed Haddadi (Imperial College London, chair), Thomas Karagiannis (Microsoft Research Cambridge), Sue Moon (KAIST), Walter Willinger (NIKSUN).

2019:

• "VL2: A Scalable and Flexible Data Center Network" by Albert Greenberg, James R. Hamilton, Navendu Jain, Srikanth Kandula, Changhoon Kim, Parantap Lahiri, Dave A. Maltz, Parveen Patel, and Sudipta Sengupta. SIGCOMM 2009

This paper articulated the core design principles that have become the foundation for modern datacenter networks: scalable Clos topologies, randomized load-balanced routing, and virtual networks constructed by decoupling endpoint addresses and locations. By convincingly arguing for these principles, and providing one of the first glimpses into real-world datacenter network traffic characteristics, this paper has had enduring impact on both the practice of datacenter network design and the large body of research on the topic that has followed over the last decade.
The 2019 award paper was selected by a committee composed of: Hitesh Ballani (MSR, chair), Mark Handley (UCL), Z. Morley Mao (UMich), and Mohammadreza Alizadeh Attar (MIT).

2018:

• "A Scalable, Commodity Data Center Network Architecture" by Mohammad Al-Fares, Alexander Loukissas, and Amin Vahdat. SIGCOMM 2008

This paper lucidly articulates a vision for what is today the standard structure of a data center network: commodity packet switches interconnected in a fat-tree topology. By posing and addressing practical challenges in data center networking, the authors drew attention to this then-emerging area, and propelled the community to consider the design of new networking techniques for the relatively ‘green field’ of the data center -- a research area that has flourished since. 

• "XORs in the air: practical wireless network coding" by Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Médard, and Jon Crowcroft. SIGCOMM 2006

This paper's interdisciplinary team brought information-theoretic research on network coding to bear on the domain of wireless networks, with an ingenious new scheme for achieving capacity gains by jointly coding information from multiple flows into individual packets. This paper's design and implementation upended the networking community’s understanding of limits on wireless capacity and ushered in diverse work on capacity improvement in the decade that followed.
The 2018 award papers were selected by a committee composed of John Byers (Boston University, chair), Krishna Gummadi (MPI), Brad Karp (UCL), and Lili Qiu (University of Texas)

2017:

• "Ethane: Taking control of the Enterprise" by Martin Casado, Michael J. Freedman, Justin Pettit, Jianying Luo, Nick McKeown, Scott Shenker. SIGCOMM 2007.

Ethane ushered in the age of Software-Defined Networking (SDN) and a new generation of research that inspired both academia and industry to design network control planes that we can reason about.

• "Measurement and analysis of online social networks", by Alan Mislove, Massimiliano Marcon, Krishna P. Gummadi, Peter Druschel, Bobby Bhattacharjee. IMC 2007.

This is one of the first papers that examine multiple online social networks at scale. By introducing novel measurement techniques, the paper has had an enduring influence on the analysis, modeling and design of modern social media and social networking services .

The 2017 award papers were selected by a committee composed of Walter Willinger (NIKSUN, Inc., chair), Katerina Argyraki (EPFL), Matthew Roughan (University of Adelaide), and Heather Zheng (University of Chicago).

 
2016:

• "Link-level measurements from an 802.11b mesh network" by Daniel Aguayo, John Bicket, Sanjit Biswas, Glenn Judd, Robert Morris . SIGCOMM 2004.

This paper was one of the first attempts to bring a “systems approach” to wireless networking and in particular provides key lessons from one of the first real operational deployments of wireless mesh networks. The impact of this work was in spawning new directions in wireless network research and in significantly raising the bar for research and evaluation in this domain by bringing to the fore real-world complexities of wireless signal propagation. 

• "A first-principles approach to understanding the Internet's router-level topology", by Lun Li, David Alderson, Walter Willinger, John Doyle. SIGCOMM 2004.

This paper questioned the prevailing work on scale-free graph structure for network topologies that incorrectly speculated an “Achilles’ heel” for the Internet, and instead provided a methodologically sound basis to explain the observed structure of Internet topologies. The impact of the paper was in bringing a greater degree of rigor in network topology research and evaluation, and in informing the community of potential pitfalls in using black-box network models without a clear understanding of underlying structural effects in network design.
The 2016 award papers were selected by a committee of Vyas Sekar (CMU, chair), Ratul Mahajan (Microsoft Research), Dina Papagiannaki (Telefonica), and Jennifer Rexford (Princeton). Papers co-authored by the committee members were excluded from consideration. All remaining papers in SIGCOMM sponsored conferences from 2004 to 2006 (SIGCOMM, CCR, IMC, CoNEXT, SenSys, and ANCS) were candidates for selection.

2015:

• "A clean slate 4D approach to network control and management." by Albert Greenberg, Gisli Hjalmtysson, David A. Maltz, Andy Myers, Jennifer Rexford, Geoffrey Xie, Hong Yan, Jibin Zhan, and Hui Zhang. CCR October 2005.

This paper led to a resurgence of interest in the topic of separated data and control planes to better manage networks that developed into Software Defined Networking (SDN).

• "Sizing router buffers", by Guido Appenzeller, Isaac Keslassy, and Nick McKeown. SIGCOMM 2004.

This paper questioned the old rule-of-thumb for buffering at routers and contributed theory and experiments to show much less buffering is needed.  It has ongoing relevance to issues such as bufferbloat and small buffers in commodity switching chips.

2014:

•  “Congestion Control for High Bandwidth-Delay Product Networks” by Dina Katabi, Mark Handley, and Charlie Rohrs, SIGCOMM 2002

XCP opened the door to a "second generation" of congestion control papers, building upon related TCP and ECN work, and with an understanding of traffic management not requiring per-flow state.  The decoupling of congestion control from transfer efficiency underpins many of the subsequent TCP approaches, and influenced the TCP implementations in common use today.

• “Measuring ISP Topologies with Rocketfuel” by Neil Spring, Ratul Mahajan, and David Wetherall, , SIGCOMM 2002.

Rocketfuel contributed methods to make efficient measurements for ascertaining Internet router-level topologies,  useful for the modeling and simulation of routing, transport protocols, and graph evolution, to name a few areas. In addition, this effort produced a dataset used by a number of subsequent efforts. One recent (2011) text describes this dataset as: "the most trustable existing dataset for Internet service provider (ISP) networks."  Rocketfuel topologies have also been incorporated into popular simulation tools such as ns-3.

2013:

• PlanetLab: an overlay testbed for broad-coverage services, Brent Chun, David Culler, Timothy Roscoe, Andy Bavier, Larry Peterson, Mike Wawrzoniak and Mic Bowman, Proc. SIGCOMM CCR, Volume 33 Issue 3 (July 2003).

For catalyzing a qualitative change in the nature of experimental networking research. By overcoming barriers to planetary scale experimentation and deployment, the authors---and their enduring testbed artifact---ushered in a new era of empirically validated network protocol design, catalyzed community-wide attention to the thoughtful construction and employment of appropriate research infrastructures, testbeds, and measurement platforms, and helped to foster a now vibrant research area focused on understanding Internet-scale network phenomena.

• A delay-tolerant network architecture for challenged internets, Kevin Fall, Proc. SIGCOMM 2003.

For anchoring a line of network architecture research that represented a sharp conceptual break from the internet-centric focus of the community at the time, substantially broadened the scope of applicability of networked computer communication, and remains a vital and active research topic today serving domains ranging from resource-poor rural environments to interplanetary space science support.

2012:

• Tussle in cyberspace: defining tomorrow's internet, David Clark, Karen Sollins, John Wroclawski and Bob Braden, Proc. ACM SIGCOMM 2002.

The "Tussle in Cyberspace" paper observed that different parties involved in the Internet's evolution can have interests that were directly at odds and that the conflict between these interests has a direct effect on the success or failure of efforts to update, rework or add features to the network. The paper, and its expanded version published a few years later in IEEE/ACM Tranactions on Networking, forced network architects and protocol designers to recognize the swirl of conflicting demands that could enable or derail their vision, and brought the term "tussle" into widespread use as a reminder of those demands.

2011:

• Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications, Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan, Proc. ACM SIGCOMM 2001.

• A Scalable Content-addressable Network, Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker, Proc. ACM SIGCOMM 2001.

2010:

• An analysis of BGP convergence properties, by Tim Griffin and Gordon Wilfong. SIGCOMM 1999.

• On Power-Law Relationships of the Internet Topology, by Michalis Faloutsos, Petros Faloutsos, and Christos Faloutsos. SIGCOMM 1999.

2009:

• A Digital Fountain Approach to Reliable Distribution of Bulk Data, by John Byers, Michael Luby, Michael Mitzenmacher, and Ashutosh Rege, Proc. of ACM SIGCOMM 1998.

2008:

• Internet Routing Instability, by Craig Labovitz, G. Robert Malan, and Farnam Jahanian, Proc. of ACM SIGCOMM 1997.

• The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm, by Matthew Mathis, Jeffrey Semke, Jamshid Mahdavi, and Teunis Ott, CCR 27(3), 1997.

• Modeling TCP Throughput:  A Simple Model and Its Empirical Validation, by Jitendra Padhye, Victor Firoiu, Don Towsley, and Jim Kurose, Proc. of ACM SIGCOMM 1998.

2007:

• Towards an Active Network Architecture, by David L. Tennenhouse and David J. Wetherall, CCR 26(2), April 1996.

2006:
In 2006, SIGCOMM presented the test-of-time award to the authors of the notable papers from 1969 to 1995 that were published in a special issue of ACM SIGCOMM Computer Communications Review in January of 1995.

• End-to-End Routing Behavior in the Internet, by Vern Paxson, Proc. of ACM SIGCOMM 1996.

• Research Areas in Computer Communication, L. Kleinrock (Vol. 4, No. 3, July 1974)

• Nomadic Computing - An Opportunity, L. Kleinrock

• The ALOHA system, F. F. Kuo (Vol. 4, No. 1, January 1974)

• Selecting Sequence Numbers, R. S. Tomlinson (Proc. ACM SIGCOMM/SIGOPS Interprocess Communications Workshop, Santa Monica, CA, March 1975)

• An Overview of the New Routing Algorithm for the ARPANET, J. M. McQuillan, I. Richter, E. C. Rosen (Proc. Sixth Data Comm.Symposium, November 1979)

• Congestion Control in IP/TCP Internetworks, J. Nagle (Vol. 14, No. 4, October 1984)

• Improving Round-Trip Time Estimates in Reliable Transport Protocols, P. Karn, C. Partridge (Proc. SIGCOMM `87, Stowe, VT, August 1987, published as CCR Vol. 17, No. 5, October 1987)

• Fragmentation Considered Harmful, C. A. Kent, J. C. Mogul (Proc. SIGCOMM `87, Stowe, VT, August 1987, published as CCR Vol. 17, No. 5, October 1987)

• Multicast Routing in Internetworks and Extended LANs, S. Deering (Proc. SIGCOMM `88, Stanford, CA, August 1988, Vol. 18, No. 4)

• The Design Philosophy of the DARPA Internet Procotols, D. D. Clark (Proc. SIGCOMM `88, Stanford, CA, August 1988, Vol. 18, No. 4)

• Development of the Domain Name System, P. V. Mockapetris, K. J. Dunlap (Proc. SIGCOMM `88, Stanford, CA, August 1988, Vol. 18, No. 4)

• Measured Capacity of an Ethernet: Myths and Reality, D. R. Boggs, J. C. Mogul, C. A. Kent (Proc. SIGCOMM `88, Stanford, CA, August 1988, Vol. 18, No. 4)

• A Binary Feedback Scheme for Congestion Avoidance in Computer Networks with a Connectionless Network Layer, K. K. Ramakrishnan, R. Jain (Proc. SIGCOMM `88, Stanford, CA, August 1988, Vol. 18, No. 4)

• Congestion Avoidance and Control, V. Jacobson (Proc. SIGCOMM `88, Stanford, CA, August 1988, Vol. 18, No. 4)

• Analysis and Simulation of a Fair Queueing Algorithm, A. Demers, S. Keshav, S. Shenker (Proc. SIGCOMM `89, Austin, TX, September 1989, Vol 19. No. 4)

• A Control-Theoretic Approach to Flow Control, S. Keshav (Proc. SIGCOMM `91, Zurich, Switzerland, September 1991, Vol. 21, No. 4)

• On the Self-Similar Nature of Ethernet Traffic, W. E. Leland, M. S. Taqqu, W. Willinger, D. V. Wilson (Proc. SIGCOMM `93, San Francisco, CA, September 1993, Vol. 23, No. 4)