Learn More
We describe a synopsis structure, the Difference Digest, that allows two nodes to compute the elements belonging to the set difference in a single round with communication overhead proportional to the <i>size of the difference</i> times the logarithm of the keyspace. While set reconciliation can be done efficiently using logs, logs require overhead for(More)
In the context of online role-playing games, we evaluate offloading AI computation from game servers to game clients. In this way, the aggregate resources of thousands of participating client machines can enhance game realism in a way that would be prohibitively expensive on a central server. Because offloading can add significant latency to a computation(More)
Emerging large-scale scientific applications have a critical need for high bandwidth and predictable-performance network service. The OptlPuter project is pioneering a radical new type of distributed application paradigm that exploits dedicated optical circuits to tightly couple geographically dispersed resources. These private optical paths are set up on(More)
The need to identify correlated traffic bursts at various, and especially fine-grain, time scales has become pressing in modern data centers. The combination of Gigabit link speeds and small switch buffers have led to “microbursts”, which cause packet drops and large increases in latency. Our paper describes the design and implementation of an efficient and(More)
A major challenge for real-time streaming overlays is to distribute high bit-rate streams with uninterrupted playback. Hosts usually have sufficient inbound bandwidth to support streaming, but due to the prevalence of asymmetric links in broadband networks, the bottleneck is the aggregate, overlay-wide outbound bandwidth. If this bandwidth is less than what(More)