The process of putting together the SIGCOMM technical program was a challenging one. There were a record 300 submissions this year with authors from well over a hundred different institutions. The program committee selected 25 papers, which we've grouped into 9 sessions. We trust you'll find the program and talks exciting and thought-provoking!All submissions to SIGCOMM 2002 underwent a rigorous double-blind review process by members of the program committee and nearly 100 external reviewers from the community (see page xxx). In response to advice from the SIGCOMM Technical Advisory Committee, the program committee was smaller (24 members) than usual this year. The goal was to foster a particularly broad participation at the PC meeting, though it required that each PC member put in an immense amount of work. We also strongly encouraged the PC to emphasize innovation over perfect execution in evaluating each paper. Our aim was to include as many "high-risk," thought-provoking papers as we could.Cumulatively, the PC and external reviewers generated 942 reviews. The median number of reviews per paper was 4, with some papers receiving as many as 9 reviews. The culmination of the review process was the PC meeting held at MIT on April 11, 2002. The meeting started at 8:30am and ran until 11pm, with a break for dinner in between. The result was a selection of 25 high-quality papers, including a few papers that were accepted with shepherding by members of the PC to ensure that any significant concerns raised by the reviewers or the PC were satisfactorily addressed.SIGCOMM 2002 features a single-track technical program that spans the areas of Internet routing and BGP, flow measurements and simulation, protocol design, overlay networks, and new theoretical results.In addition, and for the first time, SIGCOMM includes a session on "position papers" that articulate high-level architectural principles and challenging future directions. The PC selected two position papers from 36 submissions, in a process that was both highly stimulating and quite contentious. While it's clear to us that the process of shaping and accepting good position papers will take time to fully iron out, we are excited by the possibilities they offer for broadening SIGCOMM's scope, and urge SIGCOMM to continue the experiment for a few years to gain further experience with the idea.The technical program also features a student poster session showcasing works-in-progress, as well as an invited talk by Mike O'Dell, who promises to provide a thought-providing reality check on the future prospects and challenges of network research for building tomorrow's global networks.
Understanding BGP misconfiguration
It is well-known that simple, accidental BGP configuration errors can disrupt Internet connectivity. Yet little is known about the frequency of misconfiguration or its causes, except for the few spectacular incidents of widespread outages. In this paper,...
On the correctness of IBGP configuration
The Border Gateway Protocol (BGP) has two distinct modes of operation. External BGP (EBGP) exchanges reachability information between autonomous systems, while Internal BGP (IBGP) exchanges external reachability information within an autonomous system. ...
Realistic BGP traffic for test labs
This paper examines the possibility of generating realistic routing tables of arbitrary size along with realistic BGP updates of arbitrary frequencies via an automated tool deployable in a small-scale test lab. Such a tool provides the necessary ...
Informed content delivery across adaptive overlay networks
Overlay networks have emerged as a powerful and highly flexible method for delivering content. We study how to optimize throughput of large transfers across richly connected, adaptive overlay networks, focusing on the potential of collaborative ...
SOS: secure overlay services
Denial of service (DoS) attacks continue to threaten the reliability of networking systems. Previous approaches for protecting networks from DoS attacks are reactive in that they wait for an attack to be launched before taking appropriate measures to ...
Internet indirection infrastructure
Attempts to generalize the Internet's point-to-point communication abstraction to provide services like multicast, anycast, and mobility have faced challenging technical problems and deployment barriers. To ease the deployment of such services, this ...
Congestion control for high bandwidth-delay product networks
Theory and experiments show that as the per-flow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes increasingly important as the Internet evolves to ...
On the long-run behavior of equation-based rate control
We consider unicast equation-based rate control, where a source estimates the loss event ratio $p$, and, primarily at loss events, adjusts its send rate to $f(p)$. Function $f$ is assumed to represent the loss-throughput relation that TCP would ...
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
For years, the conventional wisdom [7, 22] has been that the continued stability of the Internet depends on the widespread deployment of "socially responsible" congestion control. In this paper, we seek to answer the following fundamental question: If ...
Measuring ISP topologies with rocketfuel
To date, realistic ISP topologies have not been accessible to the research community, leaving work that depends on topology on an uncertain footing. In this paper, we present new Internet mapping techniques that have enabled us to directly measure ...
Network topology generators: degree-based vs. structural
Following the long-held belief that the Internet is hierarchical, the network topology generators most widely used by the Internet research community, Transit-Stub and Tiers, create networks with a deliberately hierarchical structure. However, in 1999 a ...
Traffic matrix estimation: existing techniques and new directions
Very few techniques have been proposed for estimating traffic matrices in the context of Internet traffic. Our work on POP-to-POP traffic matrices (TM) makes two contributions. The primary contribution is the outcome of a detailed comparative evaluation ...
Replication strategies in unstructured peer-to-peer networks
The Peer-to-Peer (P2P) architectures that are most prevalent in today's Internet are decentralized and unstructured. Search is blind in that it is independent of the query and is thus not more effective than probing randomly chosen peers. One technique ...
Wave and equation based rate control using multicast round trip time
This paper introduces Wave and Equation Based Rate Control (WEBRC), the first multiple rate multicast congestion control protocol to be equation based. The equation-based approach enforces fairness to TCP with the benefit that fluctuations in the flow ...
Scalable application layer multicast
We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers ...
Route flap damping exacerbates internet routing convergence
Route flap damping is considered to be a widely deployed mechanism in core routers that limits the widespread propagation of unstable BGP routing information. Originally designed to suppress route changes caused by link flaps, flap damping attempts to ...
Route oscillations in I-BGP with route reflection
We study the route oscillation problem [16, 19] in the Internal Border Gateway Protocol (I-BGP)[18] when route reflection is used. We propose a formal model of I-BGP and use it to show that even deciding whether an I-BGP configuration with route ...
Routers with a single stage of buffering
Most high performance routers today use combined input and output queueing (CIOQ). The CIOQ router is also frequently used as an abstract model for routers: at one extreme is input queueing, at the other extreme is output queueing, and in-between there ...
Lightweight network support for scalable end-to-end services
Some end-to-end network services benefit greatly from network support in terms of utility and scalability. However, when such support is provided through service-specific mechanisms, the proliferation of one-off solutions tend to decrease the robustness ...
On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms
In this work, we clarify, extend and solve an open problem concerning the computational complexity for packet scheduling algorithms to achieve tight end-to-end delay bounds. We first focus on the difference between the time a packet finishes service in ...
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
The available bandwidth (avail-bw) in a network path is of major importance in congestion control, streaming applications, QoS verification, server selection, and overlay networks. We describe an end-to-end methodology, called Self-Loading Periodic ...
On the characteristics and origins of internet flow rates
This paper considers the distribution of the rates at which flows transmit data, and the causes of these rates. First, using packet level traces from several Internet links, and summary flow statistics from an ISP backbone, we examine Internet flow ...
New directions in traffic measurement and accounting
Accurate network traffic measurement is required for accounting, bandwidth provisioning and detecting DoS attacks. These applications see the traffic as a collection of flows they need to measure. As link speeds and the number of flows increase, keeping ...
An end-to-end approach to globally scalable network storage
This paper discusses the application of end-to-end design principles, which are characteristic of the architecture of the Internet, to network storage. While putting storage into the network fabric may seem to contradict end-to-end arguments, we try to ...
Tussle in cyberspace: defining tomorrow's internet
The architecture of the Internet is based on a number of principles, including the self-describing datagram packet, the end to end arguments, diversity in technology and global addressing. As the Internet has moved from a research curiosity to a ...
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
SIGCOMM '16 | 231 | 39 | 17% |
SIGCOMM '15 | 242 | 40 | 17% |
SIGCOMM '14 | 242 | 45 | 19% |
SIGCOMM '13 | 246 | 38 | 15% |
SIGCOMM '11 | 223 | 32 | 14% |
SIGCOMM '03 | 319 | 34 | 11% |
SIGCOMM '02 | 300 | 25 | 8% |
SIGCOMM '01 | 252 | 23 | 9% |
SIGCOMM '00 | 238 | 26 | 11% |
SIGCOMM '99 | 190 | 24 | 13% |
SIGCOMM '98 | 247 | 26 | 11% |
SIGCOMM '97 | 213 | 24 | 11% |
SIGCOMM '96 | 162 | 27 | 17% |
SIGCOMM '95 | 143 | 30 | 21% |
SIGCOMM '94 | 141 | 29 | 21% |
Overall | 3,389 | 462 | 14% |