Sciweavers

456 search results - page 89 / 92
» On Routing in Distributed Hash Tables
Sort
View
IEEEPACT
2003
IEEE
14 years 4 months ago
Memory Hierarchy Design for a Multiprocessor Look-up Engine
We investigate the implementation of IP look-up for core routers using multiple microengines and a tailored memory hierarchy. The main architectural concerns are limiting the numb...
Jean-Loup Baer, Douglas Low, Patrick Crowley, Neal...
CCR
2006
108views more  CCR 2006»
13 years 11 months ago
Counting 6to4 relay routers
6to4 is a mechanism for providing IPv6 addresses and connectivity where native IPv6 is not available. In 6to4, the links between the IPv4 and IPv6 Internets are called relay route...
David Malone
ICC
2011
IEEE
236views Communications» more  ICC 2011»
12 years 10 months ago
0 to 10k in 20 Seconds: Bootstrapping Large-Scale DHT Networks
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
Jae Woo Lee, Henning Schulzrinne, Wolfgang Kellere...
INFOCOM
2008
IEEE
14 years 5 months ago
Beyond TCAMs: An SRAM-Based Parallel Multi-Pipeline Architecture for Terabit IP Lookup
—Continuous growth in network link rates poses a strong demand on high speed IP lookup engines. While Ternary Content Addressable Memory (TCAM) based solutions serve most of toda...
Weirong Jiang, Qingbo Wang, Viktor K. Prasanna
CONEXT
2009
ACM
13 years 12 months ago
Virtually eliminating router bugs
Software bugs in routers lead to network outages, security vulnerabilities, and other unexpected behavior. Rather than simply crashing the router, bugs can violate protocol semant...
Eric Keller, Minlan Yu, Matthew Caesar, Jennifer R...