Sciweavers

SIGCOMM
2006
ACM
15 years 10 months ago
Minimizing churn in distributed systems
A pervasive requirement of distributed systems is to deal with churn — change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate ca...
Brighten Godfrey, Scott Shenker, Ion Stoica
SIGCOMM
2006
ACM
15 years 10 months ago
Planet scale software updates
Fast and effective distribution of software updates (a.k.a. patches) to millions of Internet users has evolved into a critical task over the last years. In this paper, we characte...
Christos Gkantsidis, Thomas Karagiannis, Milan Voj...
SIGCOMM
2006
ACM
15 years 10 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
SIGCOMM
2006
ACM
15 years 10 months ago
The impact and implications of the growth in residential user-to-user traffic
Kenjiro Cho, Kensuke Fukuda, Hiroshi Esaki, Akira ...
107
Voted
SIGCOMM
2006
ACM
15 years 10 months ago
In VINI veritas: realistic and controlled network experimentation
This paper describes VINI, a virtual network infrastructure that allows network researchers to evaluate their protocols and services in a realistic environment that also provides ...
Andy C. Bavier, Nick Feamster, Mark Huang, Larry L...
SIGCOMM
2006
ACM
15 years 10 months ago
Jigsaw: solving the puzzle of enterprise 802.11 analysis
The combination of unlicensed spectrum, cheap wireless interfaces and the inherent convenience of untethered computing have made 802.11-based networks ubiquitous in the enterprise...
Yu-Chung Cheng, John Bellardo, Péter Benk&o...
170
Voted
SIGCOMM
2006
ACM
15 years 10 months ago
Quantifying Skype user satisfaction
The success of Skype has inspired a generation of peer-topeer-based solutions for satisfactory real-time multimedia services over the Internet. However, fundamental questions, suc...
Kuan-Ta Chen, Chun-Ying Huang, Polly Huang, Chin-L...
SIGCOMM
2006
ACM
15 years 10 months ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau
SIGCOMM
2006
ACM
15 years 10 months ago
Virtual ring routing: network routing inspired by DHTs
This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in D...
Matthew Caesar, Miguel Castro, Edmund B. Nightinga...
SIGCOMM
2006
ACM
15 years 10 months ago
ROFL: routing on flat labels
It is accepted wisdom that the current Internet architecture conflates network locations and host identities, but there is no agreement on how a future architecture should distin...
Matthew Caesar, Tyson Condie, Jayanthkumar Kannan,...