Sciweavers

85 search results - page 16 / 17
» Small Forwarding Tables for Fast Routing Lookups
Sort
View
PAM
2009
Springer
14 years 1 days ago
Revisiting Route Caching: The World Should Be Flat
Internet routers’ forwarding tables (FIBs), which must be stored in expensive fast memory for high-speed packet forwarding, are growing quickly in size due to increased multihomi...
Changhoon Kim, Matthew Caesar, Alexandre Gerber, J...
INFOCOM
2009
IEEE
13 years 12 months ago
Fighting Spam with the NeighborhoodWatch DHT
—In this paper, we present DHTBL, an anti-spam blacklist built upon a novel secure distributed hash table (DHT). We show how DHTBL can be used to replace existing DNS-based black...
Adam Bender, Rob Sherwood, Derek Monner, Nathan Go...
ISCC
2009
IEEE
262views Communications» more  ISCC 2009»
14 years 2 hour ago
Babelchord: a social tower of DHT-based overlay networks
Chord is a protocol to distribute and retrieve information at large scale. It builds a large but rigid overlay network without taking into account the social nature and the underl...
Luigi Liquori, Cédric Tedeschi, Francesco B...
COMCOM
2007
174views more  COMCOM 2007»
13 years 5 months ago
Directional geographical routing for real-time video communications in wireless sensor networks
In this paper, we address the problem of real-time video streaming over a bandwidth and energy constrained wireless sensor network (WSN) from a small number of dispersed video-sen...
Min Chen, Victor C. M. Leung, Shiwen Mao, Yong Yua...
FPT
2005
IEEE
170views Hardware» more  FPT 2005»
13 years 11 months ago
High Quality Uniform Random Number Generation Through LUT Optimised Linear Recurrences
This paper describes a class of FPGA-specific uniform random number generators with a 2k −1 length period, which can provide k random bits per-cycle for the cost of k Lookup Ta...
David B. Thomas, Wayne Luk