Sciweavers

85 search results - page 14 / 17
» Small Forwarding Tables for Fast Routing Lookups
Sort
View
SIGCOMM
2003
ACM
14 years 10 days ago
Towards an accurate AS-level traceroute tool
Traceroute is widely used to detect routing problems, characterize end-to-end paths, and discover the Internet topology. Providing an accurate list of the Autonomous Systems (ASes...
Zhuoqing Morley Mao, Jennifer Rexford, Jia Wang, R...
INFOCOM
2005
IEEE
14 years 20 days ago
IPStash: a set-associative memory approach for efficient IP-lookup
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...
Stefanos Kaxiras, Georgios Keramidas
FPL
2009
Springer
99views Hardware» more  FPL 2009»
13 years 11 months ago
Exploiting fast carry-chains of FPGAs for designing compressor trees
Fast carry chains featuring dedicated adder circuitry is a distinctive feature of modern FPGAs. The carry chains bypass the general routing network and are embedded in the logic b...
Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne
P2P
2006
IEEE
148views Communications» more  P2P 2006»
14 years 1 months ago
eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
Peer-to-peer systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave e...
Thomas Locher, Stefan Schmid, Roger Wattenhofer
ISPD
2010
ACM
207views Hardware» more  ISPD 2010»
14 years 1 months ago
FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
Gaurav Ajwani, Chris Chu, Wai-Kei Mak