Call For Papers (a pdf version)

The SIGCOMM 2007 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, performance, and simulation.

Areas of interest include, but are not limited to:

Analysis and design of network architectures and algorithms
Experimental and measurement results from operational networks
Fundamental insights into network and traffic characteristics
Network fault-tolerance and reliability, debugging, and troubleshooting
Network management and traffic engineering
Network security, vulnerability, and defenses
Network, transport, and application-layer protocols
Networking issues for Web, multimedia, and gaming applications
Operating system and other host support for networking
Peer-to-peer, overlay, and content distribution networks
Resource management, quality of service, and signaling
Routing, switching, and addressing
Tools and techniques for network measurement and simulation
Wireless, mobile, ad-hoc, and sensor networks

Submissions can be up to 14 pages in length, in two-column 10pt format. Please see submission instructions for details. Note that accepted camera ready papers will be 12 pages in length, in two-column format with 9pt font. SIGCOMM is a selective conference where full papers typically report novel results firmly substantiated by experimentation, simulation, or analysis.

Important Dates

Paper Title and Abstract Submission:	Jan. 24, 2007
Full-paper Submission:	Jan. 31, 2007. 4:00pm Eastern Standard Time (EST) (HARD deadline)
Acceptance Notification:	May 4, 2007
Camera Ready Due:	Jun. 5, 2007
Conference:	Aug. 27-31, 2007

As in previous years, SIGCOMM 2007 will have workshops, a poster session, a student travel grant program, a GeoDiversity travel grant program, and a Student Paper Award.

We are also soliciting proposals for tutorials, due by Nov 3, 2006. Please contact Workshop/Tutorial Chairs for further details.