SIGCOMM Conference

SIGCOMM is our flagship annual conference. This page links to previous SIGCOMM conferences.


SIGCOMM is the flagship annual conference of the Special Interest Group on Data Communication (SIGCOMM), a vital special interest group of the Association for Computing Machinery (ACM).

The annual SIGCOMM conference seeks papers describing significant research contributions to the field of computer and data communication networks. We invite submissions on network architecture, design, implementation, operations, analysis, measurement, and simulation.

Full papers are no more than 14 pages long and typically report novel results firmly substantiated by experimentation, simulation, or analysis. Posters present ongoing work on one 30" x 40" (75cm x 100cm) page. Student poster submissions will be favored.

Papers are double-blind reviewed (no author identification) by a technical program committee (TPC). Depending on the year and the program chairs, the TPC can have between 20-40 researchers. The paper acceptance ratio also varies year to year, from between 8-16%, on average accepting 30-35 papers out of 300-350 submissions.

The meeting is 3 days, single-track. It is accompanied by 2 days of tutorials and related workshops which vary each year. The conference occurs once a year in the late summer, with the location varying internationally, typically including locations in North America and Europe every three years.

Attendance is open, and there are some limited student travel grants available.

Steering Committee

  • David Andersen (term ends Jan 2020)
  • Amin Vahdat (Chair, term ends Jan 2020)
  • Ramesh Govindan (term ends Jan 2019)
  • Brad Karp (term ends Jan 2019)
  • Ellen Zegura (term ending Janary 2021)
  • Alex C. Snoeren (term ending January 2021)

EC members

  • Roch Guerin (SIG Chair)


Upcoming Conference


ACM SIGCOMM 2018 will be held in Budapest, Hungary on August 20-24, 2018.


Previous SIGCOMM Conferences

The proceedings of the following past SIGCOMM conferences are available online: