Sciweavers

16883 search results - page 2907 / 3377
» Generalized Non-Reducible Descriptors
Sort
View
SIGCOMM
2006
ACM
16 years 1 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
16 years 1 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
16 years 1 months ago
Growth codes: maximizing sensor network data persistence
Sensor networks are especially useful in catastrophic or emergency scenarios such as floods, fires, terrorist attacks or earthquakes where human participation may be too dangero...
Abhinav Kamra, Vishal Misra, Jon Feldman, Dan Rube...
SIGCOMM
2006
ACM
16 years 1 months ago
Building an AS-topology model that captures route diversity
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
Wolfgang Mühlbauer, Anja Feldmann, Olaf Maenn...
SIGCOMM
2006
ACM
16 years 1 months ago
Understanding the network-level behavior of spammers
This paper studies the network-level behavior of spammers, including: IP address ranges that send the most spam, common spamming modes (e.g., BGP route hijacking, bots), how persi...
Anirudh Ramachandran, Nick Feamster
« Prev « First page 2907 / 3377 Last » Next »