Sciweavers

17760 search results - page 3233 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
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
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
15 years 10 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
15 years 10 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
SIGCOMM
2006
ACM
15 years 10 months ago
Interference-aware fair rate control in wireless sensor networks
In a wireless sensor network of N nodes transmitting data to a single base station, possibly over multiple hops, what distributed mechanisms should be implemented in order to dyna...
Sumit Rangwala, Ramakrishna Gummadi, Ramesh Govind...
« Prev « First page 3233 / 3552 Last » Next »