Sciweavers

165 search results - page 14 / 33
» Fast Routing Table Lookup Using CAMs
Sort
View
78
Voted
FPL
2009
Springer
99views Hardware» more  FPL 2009»
15 years 2 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
BROADNETS
2007
IEEE
15 years 4 months ago
Scheduling routing table calculations to achieve fast convergence in OSPF protocol
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...
Mukul Goyal, Weigao Xie, Mohd Soperi, Seyed H. Hos...
68
Voted
SIGCOMM
1999
ACM
15 years 2 months ago
Routing with a Clue
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
FPL
2008
Springer
107views Hardware» more  FPL 2008»
14 years 11 months ago
Scalable high-throughput SRAM-based architecture for IP-lookup using FPGA
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. However, this approach results in inefficient memory utilization. Due to available...
Hoang Le, Weirong Jiang, Viktor K. Prasanna
WIDM
2004
ACM
15 years 3 months ago
XPath lookup queries in P2P networks
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the exte...
Angela Bonifati, Ugo Matrangolo, Alfredo Cuzzocrea...