Sciweavers

CCR
2008
94views more  CCR 2008»
13 years 5 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...
CCR
2008
55views more  CCR 2008»
13 years 5 months ago
Thoughts on reviewing
Mark Allman
CCR
2008
96views more  CCR 2008»
13 years 5 months ago
On BGP communities
This paper focuses on BGP communities, a particular BGP attribute that has not yet been extensively studied by the research community. It allows an operator to group destinations ...
Benoit Donnet, Olivier Bonaventure
CCR
2008
84views more  CCR 2008»
13 years 5 months ago
Cold topics in networking
A major contribution to global warming has been the number of new workshops publishing proceedings with the prefix hot. In this article, I propose that we counter this trend in an...
Jon Crowcroft
CCR
2008
65views more  CCR 2008»
13 years 5 months ago
The future in your pocket
There is a growing sentiment among academics in computing that a shift to multicore processors in commodity computers will demand that all programmers become parallel programmers....
Patrick Crowley
CCR
2008
118views more  CCR 2008»
13 years 5 months ago
A generic language for application-specific flow sampling
Flow records gathered by routers provide valuable coarse-granularity traffic information for several measurement-related network applications. However, due to high volumes of traf...
Harsha V. Madhyastha, Balachander Krishnamurthy
CCR
2008
69views more  CCR 2008»
13 years 5 months ago
SIGCOMM News
Erich M. Nahum